Dual-code quantum computation model
From MaRDI portal
Publication:496911
DOI10.1007/s11128-015-1022-0zbMath1327.81126OpenAlexW1533940374MaRDI QIDQ496911
Publication date: 23 September 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-015-1022-0
teleportationReed-muller codebacon-shor codecode conversionfault-tolerant quantum computationsteane code
Related Items (2)
Low-overhead code concatenation approaches for universal quantum computation ⋮ Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Encoding an arbitrary state in a \([7, 1, 3\) quantum error correction code]
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Multiple-particle interference and quantum error correction
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
- Noise Threshold for Universality of Two-Input Gates
- Quantum measurements and gates by code deformation
- Resilient quantum computation: error models and thresholds
- Reliable quantum computers
- Quantum Reed-Muller codes
- Topological quantum memory
- Clifford gates by code deformation
- Transversality Versus Universality for Additive Quantum Codes
This page was built for publication: Dual-code quantum computation model
