Related papers: Quotient Space Quantum Codes
Protecting quantum information from the detrimental effects of decoherence and lack of precise quantum control is a central challenge that must be overcome if a large robust quantum computer is to be constructed. The traditional approach to…
Amongst quantum error-correcting codes the surface code has remained of particular promise as it has local and very low-weight checks, even despite only encoding a single logical qubit no matter the lattice size. In this work we discuss new…
The five-qubit quantum error correcting code encodes one logical qubit to five physical qubits, and protects the code from a single error. It was one of the first quantum codes to be invented, and various encoding circuits have been…
Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels.…
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
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 explore what the integrated use of quantum spatial distribution (QSD), or more specifically, superposition of both spin and position states of particles, and gauge symmetry (GS) within stabilizer formalism provides for quantum error…
Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable…
In this work we extend the connection between Quantum Error Correction (QEC) and Lattice Gauge Theories (LGTs) by showing that a $\mathbb{Z}_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit…
We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-\epsilon}$ for any…
In this paper, we prove a lower bound on the soundness of quantum locally testable codes under the distance balancing construction of Evra et al. arXiv:2004.07935 [quant-ph]. Our technical contribution is that the new soundness of the…
Quantum error correction is an essential ingredient in the development of quantum technologies. Its subject is to investigate ways to embed quantum Hilbert spaces into a physical system such that this subspace is robust against small…
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union…
Benchmarking the performance of quantum error correction codes in physical systems is crucial for achieving fault-tolerant quantum computing. Current methodologies, such as (shadow) tomography or direct fidelity estimation, fall short in…
We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…
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…
Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed…
In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant…