Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal.This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation.Widely overlooked, however, is the possibility of nontransversal, yet still fault-tolerant, gates that work directly on small quantum codes.Here, we demonstrate precisely the existence of such gates.In particular, we show how the limits of nontransversality can be overcome by performing rounds of intermediate error correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement.Moreover, the logical gates we construct, the most prominent examples being Toffoli and controlled-controlled-Z, often complete universal gate sets on their codes.We detail such universal constructions for the smallest quantum codes, the 5-qubit and 7-qubit codes, and then proceed to generalize the approach.One remarkable result of this generalization is that any nondegenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of fault-tolerant gates.Another is the interaction of logical qubits across different stabilizer codes, which, for instance, implies a broadly applicable method of code switching.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Self-citationScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“Ideally, these magic states would be efficiently constructible themselves, but current so-called distillation procedures actually incur large overheads in terms of time and qubits [7,8].”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 22×
“Any nondegenerate Jn, 1, dK CSS code with d ≥ 3 and stabilizer S has two normalizers p1, p2 ∈ N (S) \ S with SC(p1) and SC(p2) both error-correcting and {p1, p2} = 0.”
BackgroundInfluentialGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Self-citationTheory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 8×
“Some of the largest breakthroughs have been universality with transversal Clifford gates and magic ancillas [5], with a transversal gate set but with a gauge qubit reset [11], with nontransversal constructions on large codes built as concatenations of smaller codes with complementary transversal gate sets [14], and wi…”
BackgroundMethodInfluentialImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“Recall that the stabilizer S of an ⟦n; k; d⟧ quantum code can be written as a bifurcated binary matrix [25,44],”
BackgroundQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 10×
“[21] Emanuel Knill and Raymond Laflamme, “Theory of quantum error-correcting codes,” Phys.”
MethodInfluentialPreskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203
A new universal and fault-tolerant quantum basis
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194 · cited 1×
“For instance, it is natural to ask questions such as, what other logical gates can be implemented in a pieceably fault-tolerant manner, with or without functional ancillas, or, what are the fewest functional ancillas necessary to implement a given gate pieceably fault tolerantly in a given code? Some interesting targe…”
BackgroundBoth Toffoli and Controlled-NOT need little help to universal quantum computing
Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99 · cited 1×
“Ideally, these magic states would be efficiently constructible themselves, but current so-called distillation procedures actually incur large overheads in terms of time and qubits [7,8].”
Background
Cited by
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
“Pieceable fault tolerance, which breaks nontransverse gates into fault-tolerant pieces [75,76]”
BackgroundHardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Cong, I., Levine, H., Keesling, A., Bluvstein, D., Wang, S.-T., & Lukin, M. D. (2022) · Physical Review X · doi:10.1103/physrevx.12.021049 · Cited by 144
Fault-tolerant quantum computation with few qubits
Chao, R., & Reichardt, B. W. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0085-z · Cited by 137
“Finally, we intersperse X error-correction procedures to catch X faults before they can spread, much like the pieceable fault-tolerance constructions of Yoder et al. 11 except on a single code block.”
MethodInfluential
Metadata
- Authors
- Yoder, T. J., Takagi, R., & Chuang, I. L.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2016-09-13
- Volume
- 6
- Issue
- 3
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2520649408
- Cited by
- 73
- References
- 20
- FWCI
- 4.15
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.