The DOI matches its Crossref record; 47 of the 49 references it cites were found in a registry or an index.
Coherence in logical quantum channels
Open accessAbstract
We study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In particular, we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Specifically, it seems that the logical circuit realizes inherently digital operation, for which the small coherent errors do not substantially shift/distort the bitstring distribution but just reduce the overall fidelity49,110”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [110]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“First, empirically, it seems that the logical circuit is much more tolerant to coherent errors49,110,111, and understanding the manifestations of this is a subject of continuing investigation.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [110]
Experimental — accuracy not yet measured
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 1×
“This recovery operation can be computed efficiently on a classical computer [33], and corrects the error with a success probability that is exponentially close to 1 when L is large and the noise is both sufficiently weak and sufficiently weakly correlated.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · cited 1×
“Decoding the toric code is a well-studied problem and many good algorithms are known [30, 31, 32].”
BackgroundSelf-citationGeneralized Hypergeometric Functions
Slater, L. J., & Rheinboldt, W. C. (1967) · Physics Today · doi:10.1063/1.3034196 · Cited by 1,592
Generalized Hypergeometric Functions
L., Y. L., & Slater, L. J. (1966) · Mathematics of Computation · doi:10.2307/2003571 · Cited by 1,527 · cited 1×
“5) in [29].”
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Self-citationClassical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019 · cited 1×
“This quantity r has the great virtue that it can be feasibly measured using randomized benchmarking [6, 7], but as a characterization of the noise strength it has shortcomings.”
BackgroundStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753 · cited 1×
“Fortunately, the accuracy threshold theorem for quantum computation establishes that quantum computing is scalable, assuming that the noise is neither too strong nor too strongly correlated [1, 2, 3, 4, 5].”
BackgroundFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“Specifically, it seems that the logical circuit realizes inherently digital operation, for which the small coherent errors do not substantially shift/distort the bitstring distribution but just reduce the overall fidelity 49,110 (see, for example, the agreement in Extended Data Fig.”
BackgroundRealization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
Bao, Y., Fan, R., Vishwanath, A., & Altman, E. (2026) · Physical Review Letters · doi:10.1103/6f98-tvb8 · Cited by 180
“One useful extension is to characterize the effect of quantum channels that include coherent errors [28, 29, 52–54].”
Dynamical Magic Transitions in Monitored Clifford+ T Circuits
Bejan, M., McLauchlan, C., & Béri, B. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030332 · Cited by 120
“We may also view T gates as coherent errors on an encoded stabilizer state [42, 80–85]; from this viewpoint magic is a coherent, pure-state analog of the entropy that would come from Pauli channels.”
BackgroundBaldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022) · Quantum · doi:10.22331/q-2022-05-09-707 · Cited by 54
“Coherent errors are known to have a larger impact on smaller distance codes compared to larger distance codes [67].”
Background
Metadata
- Authors
- Iverson, J. K., & Preskill, J.
- Affiliations
- California Institute of Technology (US)
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2020-07-01
- Volume
- 22
- Issue
- 7
- Pages
- 073066
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2995554994
- Cited by
- 61
- References
- 49
- Citations by year
- 2026: 4 · 2025: 23 · 2024: 12 · 2023: 7 · 2022: 6 · 2021: 8 · 2020: 1
- FWCI
- 2.16
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0/ (vor, 30 d)
- iopscience.iop.org/info/page/text-and-data-mining (tdm, 30 d)
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Army Research Office and Laboratory for Physical Sciences (W911NF-18- 1-0103)
- National Science Foundation (PHY-1733907)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- coherent noise, quantum error correction, logical channels, toric code, stabilizer codes, fault-tolerant quantum computing, control error
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: Coherence in logical quantum channels. https://app.cochat.ai/papers/10.1088/1367-2630/ab8e5c
- The paper
- Iverson, J. K., & Preskill, J. (2020). Coherence in logical quantum channels. New Journal of Physics. https://doi.org/10.1088/1367-2630/ab8e5c
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.