Related papers: A Note on Clifford Stabilizer Codes for Ising Anyo…
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…
We establish a database consisting of a representative of every binary quantum stabilizer code under local Clifford permutation equivalence for $n\leq 9$.
We propose a physical realization of a commuting Hamiltonian of interacting Majorana fermions realizing $Z_{2}$ topological order, using an array of Josephson-coupled topological superconductor islands. The required multi-body interaction…
Fermion-to-qubit mappings that preserve geometric locality are especially useful for simulating lattice fermion models (e.g., the Hubbard model) on a quantum computer. They avoid the overhead associated with geometric non-local parity terms…
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…
We present the teleportation and superdense coding protocols for a family of anyon theories coming from Tambara-Yamagami categories, of which the lowest rank theories describe Ising anyons. In contrast to the usual approach to anyonic…
Clifford algebras and Majorana conditions are analyzed in any spacetime. An index labeling inequivalent $\Gamma$-structures up to orthogonal conjugations is introduced. Inequivalent charge-operators in even-dimensions, invariant under Wick…
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable…
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were…
The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
Majorana-based quantum computation seeks to encode information non-locally in pairs of Majorana zero modes, thereby isolating qubit states from a local noisy environment. In addition to long coherence times, the attractiveness of…
Localized Majorana fermions emerge in many topologically ordered systems and exhibit exchange statistics of Ising anyons. This enables noise-resistant implementation of a limited set of operations by braiding and fusing Majorana fermions.…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
We define and study parafermion stabilizer codes which can be viewed as generalizations of Kitaev's one dimensional model of unpaired Majorana fermions. Parafermion stabilizer codes can protect against low-weight errors acting on a small…
We present a new type of a quantum error correction code, termed Majorana-XYZ code, where the logical quantum information scales macroscopically yet is protected by topologically non-trivial degrees of freedom. It is a $[n,k,g,d]$ subsystem…
We discuss how basic Clifford algebra and indeed all of matrix algebra and matrix representations of finite groups comes from Iterants: very elementary processes such as an alternation of plus and minus one ...+-+-+- .... One can think of…
Quantum error correction is the art of protecting fragile quantum information through suitable encoding and active interventions. After encoding $k$ logical qubits into $n>k$ physical qubits using a stabilizer code, this amounts to…
We study linear functionals on a Clifford algebra (algebra of Ma- joranas) equipped with a reflection automorphism. For Hamiltonians that are functions of Majoranas or of spins, we find necessary and sufficient conditions on the coupling…