Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
arXiv:2011.00197 · doi:10.1109/TIT.2021.3130155
Abstract
Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive mitigation through decoherence free subspaces, requiring the noise to preserve the code space of a stabilizer code, and to act as the logical identity operator on the protected information. Thus, we develop necessary and sufficient conditions for all transversal -rotations to preserve the code space of a stabilizer code, which require the weight- -stabilizers to cover all the qubits that are in the support of some -component. Further, the weight- -stabilizers generate a direct product of single-parity-check codes with even block length. By adjusting the size of these components, we are able to construct a large family of QECC codes, oblivious to coherent noise, that includes the Shor codes. Moreover, given even and any stabilizer code, we can construct an stabilizer code that is oblivious to coherent noise. If we require that transversal -rotations preserve the code space only up to some finite level in the Clifford hierarchy, then we can construct higher level gates necessary for universal quantum computation. The -stabilizers supported on each non-zero -component form a classical binary code C, which is required to contain a self-dual code, and the classical Gleason's theorem constrains its weight enumerator. The conditions for a stabilizer code being preserved by transversal -rotations at level in the Clifford hierarchy lead to generalizations of Gleason's theorem that may be of independent interest to classical coding theorists.
arXiv commentJingzhen Hu and Qingzhong Liang contributed equally to this work. The paper was accepted to IEEE Transactions on Information Theory. The ISIT paper is available as an ancillary file
References in corpus (29)
- Good Quantum Error-Correcting Codes Exist
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Noiseless Quantum Codes
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Simple Quantum Error Correcting Codes
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Magic state distillation with low overhead
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Improved magic states distillation for quantum universality
- Qutrit Magic State Distillation
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Diagonal gates in the Clifford hierarchy
- Performance of quantum error correction with coherent errors
- Coherence in quantum error-correcting codes
- Coherence in logical quantum channels
- Towards low overhead magic state distillation
- Stabilizing distinguishable qubits against spontaneous decay by detected-jump correcting quantum codes
- On Optimality of CSS Codes for Transversal
- Avoiding coherent errors with rotated concatenated stabilizer codes
- Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Towers of generalized divisible quantum codes
- Designing the Quantum Channels Induced by Diagonal Gates
- Quantum Pin Codes
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Climbing the Diagonal Clifford Hierarchy
Cited by in corpus (8)
- Coherent errors and readout errors in the surface code
- Transversal Diagonal Logical Operators for Stabiliser Codes
- Designing the Quantum Channels Induced by Diagonal Gates
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians
- High-Rate Amplitude-Damping Shor Codes with Immunity to Collective Coherent Errors
- Robust projective measurements through measuring code-inspired observables
- Quantum dual extended Hamming code immune to collective coherent errors