Reducing the overhead for quantum computation when noise is biased
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We analyze a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal fault-tolerant quantum computation using only Clifford gates that preserve the noise bias. We analyze the distillation of $|T\ensuremath{\rangle}$-type magic states using this gadget at the physical level, followed by concatenation with the 15-qubit quantum Reed-Muller code, and comparing our results with standard constructions. In the regime where the noise bias (rate of Pauli $Z$ errors relative to other single-qubit errors) is greater than a factor of 10, our scheme has lower overhead across a broad range of relevant noise rates.
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
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×
“For example, the high-threshold scheme for quantum computation based on surface codes [3] has an overhead that increases with problem size, but typical numbers are of the order of 106 or more physical qubits per logical qubit when magic state distillation is included [4].”
BackgroundUniversal 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 1×
“[17] S.”
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 4×
“The high-threshold schemes of Knill [2] and Raussendorf, Harrington, and Goyal [3] have error thresholds of around 1%, and there has not been significant improvement in these threshold values in the subsequent decade of research.”
BackgroundInfluentialOperator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486 · cited 1×
“subsystem codes [16,17], quantum polar codes, quantum Reed-Muller codes, and Kitaev codes on non-self-dual lattices [18].”
BackgroundRestrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
Cited by
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
“460 Although initialization circuits have been proposed to 461 exploit a bias in the noise [52], here we focus on fault462 tolerant Clifford operations and the fault-tolerant prepa463 ration of logical qubits in the computational basis.”
BackgroundSelf-citationRepetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
Ultrahigh Error Threshold for Surface Codes with Biased Noise
Tuckett, D. K., Bartlett, S. D., & Flammia, S. T. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050505 · Cited by 216
Self-citationBias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
“We also complete the analysis by outlining the preparation of magic-states using the trivially bias-preserving physical ZZ(θ)-gates [10].”
InfluentialQuantum control of a cat qubit with bit-flip times exceeding ten seconds
Réglade, U., Bocquet, A., Gautier, R., Cohen, J., Marquet, A., Albertinale, E., Pankratova, N., Hallén, M., Rautschke, F., Sellem, L.-A., et al. (2024) · Nature · doi:10.1038/s41586-024-07294-3 · Cited by 80
Metadata
- Authors
- Webster, P., Bartlett, S. D., & Poulin, D.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-12-03
- Volume
- 92
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2268989311
- Cited by
- 43
- References
- 7
- FWCI
- 1.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reducing the overhead for quantum computation when noise is biased. https://app.cochat.ai/papers/10.1103/physreva.92.062309
- The paper
- Webster, P., Bartlett, S. D., & Poulin, D. (2015). Reducing the overhead for quantum computation when noise is biased. Physical Review A. https://doi.org/10.1103/physreva.92.062309
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.