Related papers: 3D local qupit quantum code without string logical…
Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…
Single-shot error correction outperforms conventional approaches by requiring only one round of stabilizer measurements for decoding, even in the presence of measurement errors. This capability relates to the confinement property of codes,…
The Hamiltonian model of quantum error correction code in the literature is often constructed with the help of its stabilizer formalism. But there have been many known examples of nonadditive codes which are beyond the standard quantum…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
We present a method for implementing stabilizer-based codes with encoding schemes of the operator quantum error correction paradigm, e.g., the "standard" five-qubit and CSS codes, on solid-state qubits with Ising or XY-type interactions.…
For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi & Terhal (BT) and Bravyi, Poulin & Terhal (BPT) established…
We show that the existence of string order in a given quantum state is intimately related to the presence of a local symmetry by proving that both concepts are equivalent within the framework of finitely correlated states. Once this…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
Geometrically local quantum codes, comprised of qubits and checks embedded in $\mathbb{R}^D$ with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that…
We present an error correcting protocol that enhances the lifetime of stabilizer code based qubits which are susceptible to the creation of pairs of localized defects (due to string-like error operators) at finite temperature, such as the…
Working within the framework of Loop Quantum Gravity (LQG), we construct a set of three operators suitable for identifying coordinate-like quantities on a spin-network configuration. In doing so, we rely on known properties of operators for…
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantum memories. First, we introduce two…
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be…
We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitrary error-free classical computation is allowed. In…
We provide a detailed study of the general structure of two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. Under the sole assumption of translational invariance, we show that all such codes can…
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls,…
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights $O(1)$ and such that $O(1)$ generators act on any given qubit. The number of…
Conventional fault-tolerant quantum error-correction schemes require a number of extra qubits that grows linearly with the code's maximum stabilizer generator weight. For some common distance-three codes, the recent "flag paradigm" uses…
Coherent errors are a dominant noise process in many quantum computing architectures. Unlike stochastic errors, these errors can combine constructively and grow into highly detrimental overrotations. To combat this, we introduce a simple…