Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Thaker, Tzvetan Metodi, Andrew Cross, I. Chuang, F. Chong (2006)
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing33rd International Symposium on Computer Architecture (ISCA'06)
E. Knill, R. Laflamme, W. Zurek (1996)
Threshold Accuracy for Quantum ComputationarXiv: Quantum Physics
A. Steane (2002)
Overhead and noise threshold of fault-tolerant quantum error correctionPhysical Review A, 68
Byung-Soo Choi (2013)
Cost comparison between code teleportation and stabilizer sequence methods for quantum code conversion2013 International Conference on ICT Convergence (ICTC)
J. Kempe, O. Regev, Falk Unger, R. Wolf (2008)
Upper bounds on the noise threshold for fault-tolerant quantum computing
P. Aliferis, D. Gottesman, J. Preskill (2005)
Quantum accuracy threshold for concatenated distance-3 codesQuantum Inf. Comput., 6
MA Nielsen, IL Chuang (2000)
Quantum Computation and Quantum Information
A. Calderbank, P. Shor (1995)
Good quantum error-correcting codes exist.Physical review. A, Atomic, molecular, and optical physics, 54 2
Cody Jones (2012)
Multilevel distillation of magic states for quantum computingPhysical Review A, 87
T. Brun (2013)
Fault-tolerant, nondestructive measurement of logical operators and quantum teleportation in large stabilizer codesBulletin of the American Physical Society, 2013
D. Aharonov, M. Ben-Or (1996)
Fault-Tolerant Quantum Computation with Constant Error RateSIAM J. Comput., 38
J. Preskill (1997)
Reliable quantum computersProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
S. Bravyi, A. Kitaev (2004)
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)Physical Review A, 71
H. Bombin (2010)
Clifford gates by code deformationNew Journal of Physics, 13
Cody Jones (2012)
Low-overhead constructions for the fault-tolerant Toffoli gatePhysical Review A, 87
B. Reichardt (2008)
Fault-Tolerant Quantum Computation
(2011)
Surface code quantum computing with error rates over 1
Lin Zhang, I. Fuss (1997)
Quantum Reed-Muller codesarXiv: Quantum Physics
M. Nest (2008)
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyondQuantum Inf. Comput., 10
A. Steane (1996)
Multiple-particle interference and quantum error correctionProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 452
H. Bombin (2013)
Optimal Transversal Gates under Geometric Constraints
S. Bravyi, Jeongwan Haah (2012)
Magic-state distillation with low overheadPhysical Review A, 86
I. Dumer, A. Kovalev, L. Pryadko (2014)
Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes.Physical review letters, 115 5
S. Buchbinder, Channing Huang, Y. Weinstein (2011)
Encoding an arbitrary state in a [7,1,3] quantum error correction codeQuantum Information Processing, 12
E. Knill (2004)
Fault-Tolerant Postselected Quantum Computation: SchemesarXiv: Quantum Physics
E. Knill (2004)
Fault-Tolerant Postselected Quantum Computation: Threshold AnalysisarXiv: Quantum Physics
(2000)
Quantum Computation and Quantum Information, 1st edn
E. Campbell, D. Browne (2009)
Bound states for magic state distillation in fault-tolerant quantum computation.Physical review letters, 104 3
M. Oskin, F. Chong, I. Chuang (2002)
A Practical Architecture for Reliable Quantum ComputersComputer, 35
B. Reichardt (2006)
Quantum universality by state distillationQuantum Inf. Comput., 9
Falk Unger (2007)
Noise Threshold for Universality of Two-Input GatesIEEE Transactions on Information Theory, 54
E. Dennis, A. Kitaev, A. Landahl, J. Preskill (2001)
Topological quantum memoryJournal of Mathematical Physics, 43
D. Gottesman (2013)
Fault-tolerant quantum computation with constant overheadQuantum Inf. Comput., 14
Adam Paetznick, B. Reichardt (2013)
Universal fault-tolerant quantum computation with only transversal gates and error correction.Physical review letters, 111 9
A. Fowler, S. Devitt, Cody Jones (2013)
Surface code implementation of block code state distillationScientific Reports, 3
E. Knill, R. Laflamme, W. Zurek (1997)
Resilient quantum computation: error models and thresholdsProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
Tomas Jochym-O'Connor, Yafei Yu, B. Helou, R. Laflamme (2012)
The robustness of magic state distillation against errors in Clifford gatesQuantum Inf. Comput., 13
R. Cleve, D. Gottesman (1996)
Efficient computations of encodings for quantum error correctionPhysical Review A, 56
H. Bombin, M. Martin-Delgado (2007)
Quantum measurements and gates by code deformationJournal of Physics A: Mathematical and Theoretical, 42
D. Gottesman (1997)
Theory of fault-tolerant quantum computationPhysical Review A, 57
David Wang, A. Fowler, C. Hill, L. Hollenberg (2009)
Graphical algorithms and threshold error rates for the 2d colour codearXiv: Quantum Physics
Tomas Jochym-O'Connor, R. Laflamme (2013)
Using concatenated quantum codes for universal fault-tolerant quantum gates.Physical review letters, 112 1
D. Gottesman, I. Chuang (1999)
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operationsNature, 402
Tzvetan Metodi, F. Chong (2006)
Quantum Computing for Computer ArchitectsSynthesis Lectures on Computer Architecture
Bryan Eastin, E. Knill (2008)
Restrictions on transversal encoded quantum gate sets.Physical review letters, 102 11
A. Stephens (2014)
Efficient fault-tolerant decoding of topological color codesarXiv: Quantum Physics
Y. Weinstein (2011)
Fidelity of an encoded [7,1,3] logical zeroPhysical Review A, 84
B. Zeng, Andrew Cross, I. Chuang (2007)
Transversality Versus Universality for Additive Quantum CodesIEEE Transactions on Information Theory, 57
E. Knill, R. Laflamme (1996)
Concatenated Quantum CodesarXiv: Quantum Physics
D. Gottesman (1998)
The Heisenberg Representation of Quantum Computers
A. Fowler, A. Stephens, Peter Groszkowski (2008)
High-threshold universal quantum computation on the surface codePhysical Review A, 80
D. Bacon (2005)
Operator quantum error-correcting subsystems for self-correcting quantum memoriesPhysical Review A, 73
Jonas Anderson, G. Duclos-Cianci, D. Poulin (2014)
Fault-tolerant conversion between the Steane and Reed-Muller quantum codes.Physical review letters, 113 8
In this work, we propose the dual-code quantum computation model—a fault-tolerant quantum computation scheme which alternates between two different quantum error-correction codes. Since the chosen two codes have different sets of transversal gates, we can implement a universal set of gates transversally, thereby reducing the overall cost. We use code teleportation to convert between quantum states in different codes. The overall cost is decreased if code teleportation requires fewer resources than the fault-tolerant implementation of the non-transversal gate in a specific code. To analyze the cost reduction, we investigate two cases with different base codes, namely the Steane and Bacon-Shor codes. For the Steane code, neither the proposed dual-code model nor another variation of it achieves any cost reduction since the conventional approach is simple. For the Bacon-Shor code, the three proposed variations of the dual-code model reduce the overall cost. However, as the encoding level increases, the cost reduction decreases and becomes negative. Therefore, the proposed dual-code model is advantageous only when the encoding level is low and the cost of the non-transversal gate is relatively high.
Quantum Information Processing – Springer Journals
Published: May 23, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.