Dual-code quantum computation model

DOI10.1007/S11128-015-1022-0MaRDI QIDQ496911zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

teleportationReed-muller codebacon-shor codecode conversionfault-tolerant quantum computationsteane code

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Low-overhead code concatenation approaches for universal quantum computation
• Quantum double aspects of surface code models
• Unfolding the color code
• Fault-Tolerant Quantum Computation with Constant Error Rate
• scientific article

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5953464 (Why is no real title available?)
• scientific article; zbMATH DE number 5666697 (Why is no real title available?)
• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
• Clifford gates by code deformation
• Encoding an arbitrary state in a \([7, 1, 3]\) quantum error correction code
• Fault-Tolerant Quantum Computation with Constant Error Rate
• Multiple-particle interference and quantum error correction
• Noise Threshold for Universality of Two-Input Gates
• Quantum Reed-Muller codes
• Quantum accuracy threshold for concatenated distance-3 code
• Quantum measurements and gates by code deformation
• Relations of classical-quantum correspondence in Dicke model
• Reliable quantum computers
• Resilient quantum computation: error models and thresholds
• The Heisenberg representation of quantum computers
• Topological quantum memory
• Transversality Versus Universality for Additive Quantum Codes
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing

Cited in

(4)

• Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
• Duality Computing in Quantum Computers
• Low-overhead code concatenation approaches for universal quantum computation
• Duality quantum computers and quantum operations

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)