Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
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
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Linear transformations which preserve trace and positive semidefiniteness of operators
Jamiołkowski, A. (1972) · Reports on Mathematical Physics · doi:10.1016/0034-4877(72)90011-0 · Cited by 1,512
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 2×
“This shows that as long as we only apply Clifford gates, there is no need to actively error-correct, we can instead efficiently keep track of the Pauli frame in classical software [6].”
BackgroundMethodQuantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464 · cited 1×
“We conclude this section by mentioning that Clifford frames are also useful in randomized benchmarking schemes where random Clifford gates are applied to transform a given noise channel into an effective de-polarizing channel [21, 30, 31].”
BackgroundGauge 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
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105
Self-citation
Cited by
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Quantum error correction: an introductory guide
Roffe, J. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1667078 · Cited by 356
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
Self-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
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223
Self-citation
Metadata
- Authors
- Chamberland, C., Iyer, P., & Poulin, D.
- Venue
- Quantum
- Published
- 2018-01-04
- Volume
- 2
- Pages
- 43
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2608522339
- Cited by
- 53
- References
- 10
- FWCI
- 3.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. https://app.cochat.ai/papers/10.22331/q-2018-01-04-43
- The paper
- Chamberland, C., Iyer, P., & Poulin, D. (2018). Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. Quantum. https://doi.org/10.22331/q-2018-01-04-43
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.