Dual-code quantum computation model
From MaRDI portal
Publication:496911
DOI10.1007/S11128-015-1022-0zbMATH Open1327.81126OpenAlexW1533940374MaRDI QIDQ496911FDOQ496911
Authors: Byung-Soo Choi 
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
Recommendations
teleportationReed-muller codebacon-shor codecode conversionfault-tolerant quantum computationsteane code
Cites Work
- Title not available (Why is that?)
- Multiple-particle interference and quantum error correction
- The Heisenberg representation of quantum computers
- Quantum accuracy threshold for concatenated distance-3 code
- Reliable quantum computers
- Encoding an arbitrary state in a \([7, 1, 3]\) quantum error correction code
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Topological quantum memory
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Resilient quantum computation: error models and thresholds
- Relations of classical-quantum correspondence in Dicke model
- Transversality Versus Universality for Additive Quantum Codes
- Title not available (Why is that?)
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Title not available (Why is that?)
- 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
- Quantum Reed-Muller codes
- Clifford gates by code deformation
Cited In (4)
This page was built for publication: Dual-code quantum computation model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496911)
