Catalysis and activation of magic states in fault-tolerant architectures
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
In many architectures for fault-tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible even for some fairly noisy nonstabilizer states, as distillation can convert many noisy copies into fewer purer magic states. Here we propose protocols that exploit multiple species of magic states in surprising ways. These protocols provide examples of previously unobserved phenomena that are analogous to catalysis and activation well known in entanglement theory.
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
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
A topological Dirac insulator in a quantum spin Hall phase
Hsieh, D., Qian, D., Wray, L., Xia, Y., Hor, Y. S., Cava, R. J., & Hasan, M. Z. (2008) · Nature · doi:10.1038/nature06843 · Cited by 3,523
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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Observation of Unconventional Quantum Spin Textures in Topological Insulators
Hsieh, D., Xia, Y., Wray, L., Qian, D., Pal, A., Dil, J. H., Osterwalder, J., Meier, F., Bihlmayer, G., Kane, C. L., et al. (2009) · Science · doi:10.1126/science.1167733 · Cited by 1,239
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Quantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406
Bound entanglement can be activated
Horodecki, P., Horodecki, M., & Horodecki, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1056 · Cited by 399
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Dehaene, J., & De Moor, B. (2003) · Physical Review A · doi:10.1103/physreva.68.042318 · Cited by 183
Quantum Universality from Magic States Distillation Applied to CSS Codes
Reichardt, B. W. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-7654-8 · Cited by 143
Cited by
The resource theory of stabilizer quantum computation
Veitch, V., Hamed Mousavian, S. A., Gottesman, D., & Emerson, J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/013009 · Cited by 501
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387
Self-citationNegative quasi-probability as a resource for quantum computation
Veitch, V., Ferrie, C., Gross, D., & Emerson, J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/113011 · Cited by 377
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
“[16] or Lemma 2 of Ref.”
Self-citationLeone, L., Oliviero, S. F. E., & Hamma, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050402 · Cited by 276
Metadata
- Authors
- Campbell, E. T.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2011-03-25
- Volume
- 83
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1995488584
- Cited by
- 78
- References
- 11
- FWCI
- 2.96
- Type
- journal article
- Language
- en
- Open access
- green
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.