Related papers: Quantum Pin Codes
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings.…
Stabilizer codes form an important class of quantum error correcting codes which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length $n$ is equivalent to constructing subspaces…
We consider two different ways to encode quantum information, by parallel or anti-parallel pairs of spins. We find that there is more information in the anti-parallel ones. This purely quantum mechanical effect is due to entanglement, not…
Quantum error correction is indispensable to achieving reliable quantum computation. When quantum information is encoded redundantly, a larger Hilbert space is constructed using multiple physical qubits, and the computation is performed…
We find that the overlapping of a topological quantum color code state, representing a quantum memory, with a factorized state of qubits can be written as the partition function of a 3-body classical Ising model on triangular or Union Jack…
Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code and explicitly constructs the corresponding QEC code. Our…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
Mutually unbiased bases have been extensively studied in the literature and are simple and effective in quantum key distribution protocols, but they are not optimal. Here equiangular spherical codes are introduced as a more efficient and…
We introduce a morphing procedure that can be used to generate new quantum codes from existing quantum codes. In particular, we morph the 15-qubit Reed-Muller code to obtain a $[\![10,1,2]\!]$ code that is the smallest known stabilizer code…
The coupon collector is a prototypical model for evaluating the number of samples for identifying a set. By superposing all elements in the set as a pure quantum state, a quantum version of the coupon collector aims to learn the state,…
For realizing a quantum memory we suggest to first encode quantum information via a quantum error correcting code and then concatenate combined decoding and re-encoding operations. This requires that the encoding and the decoding operation…
A promising strategy to protect quantum information from noise-induced errors is to encode it into the low-energy states of a topological quantum memory device. However, readout errors from such memory under realistic settings is less…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…
Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous…
A conjugate code pair is defined as a pair of linear codes such that one contains the dual of the other. The conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is argued…