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
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Quantum accuracy threshold for concatenated distance-3 codesPreprint
Aliferis, P., Gottesman, D., & Preskill, J. (2005) · Quantum information & computation · doi:10.48550/arxiv.quant-ph/0504218 · Cited by 564
Self-citationBarnett, S. (2009) · Oxford University Press eBooks · doi:10.1093/oso/9780198527626.001.0001 · Cited by 550
Noise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · 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].”
BackgroundScalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502 · 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.”
BackgroundQuantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
Self-citationResilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346 · 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].”
BackgroundResilient Quantum Computation: Error Models and Thresholds
Knill, E. H., Laflamme, R., & Zurek, W. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 296
Fast Decoders for Topological Quantum Codes
Duclos-Cianci, G., & Poulin, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050504 · Cited by 244
Fault-Tolerant Quantum Computation with Long-Range Correlated Noise
Aharonov, D., Kitaev, A., & Preskill, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.050504 · Cited by 243 · cited 1×
“In a more realistic noise model, the higher-weight terms in the Hamiltonian would have O(1) strength (independent of system size), but would decay sufficiently rapidly as the qubits separate that the effective single-qubit noise strength is also O(1) [27, 28].”
BackgroundSelf-citationEfficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214 · cited 1×
“Decoding the toric code is a well-studied problem and many good algorithms are known [30, 31, 32].”
BackgroundThe number of polygons on a lattice
Hammersley, J. M. (1961) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s030500410003557x · Cited by 209 · cited 2×
“A logical string can be regarded as a self-avoiding walk on the square lattice whose endpoints are a distance L apart, but previously derived upper bounds on the number of self-avoiding walks with specified length [34, 35, 36] do not treat the case where the distance between the endpoints differs from the length of th…”
BackgroundEstimating the coherence of noise
Wallman, J., Granade, C., Harper, R., & Flammia, S. T. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/11/113020 · Cited by 192 · cited 2×
“If we know only r, and have no information about the coherence of the noise, we cannot estimate D accurately, and therefore cannot easily make sound predictions about how effectively any error-correcting code will combat the noise [8, 9, 10].”
BackgroundBounding quantum gate error rate based on reported average fidelity
Sanders, Y. R., Wallman, J. J., & Sanders, B. C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/18/1/012002 · Cited by 180 · cited 1×
“If we know only r, and have no information about the coherence of the noise, we cannot estimate D accurately, and therefore cannot easily make sound predictions about how effectively any error-correcting code will combat the noise [8, 9, 10].”
BackgroundComparing Experiments to the Fault-Tolerance Threshold
Kueng, R., Long, D. M., Doherty, A. C., & Flammia, S. T. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.170502 · Cited by 177 · cited 2×
“Upper and lower bounds on the diamond distance can be expressed in terms of the benchmarking parameter p(N ) = 1− r(N )d/(d− 1) and the unitarity u(N ) [9]: √ d2 − 1 2d f(p, u) ≤ D ≤ d √ d2 − 1 2 f(p, u), (48)”
BackgroundRandomized benchmarking with confidence
Wallman, J. J., & Flammia, S. T. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/10/103032 · Cited by 164 · cited 1×
“For a fixed value of the infidelity r, the unitarity achieves its minimum for the depolarizing channel [24], where”
BackgroundCorrecting coherent errors with surface codes
Bravyi, S., Englbrecht, M., König, R., & Peard, N. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0106-y · Cited by 157
Quantum Error Correction Decoheres Noise
Beale, S. J., Wallman, J. J., Gutiérrez, M., Brown, K. R., & Laflamme, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.190501 · Cited by 127
Modeling coherent errors in quantum error correction
Greenbaum, D., & Dutton, Z. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9a06 · Cited by 125 · cited 3×
“The performance of stabilizer codes against fully coherent unitary noise has been previously studied in [17, 18, 19].”
BackgroundSufficient condition on noise correlations for scalable quantum computing
Preskill, J. P. (2013) · Quantum Information and Computation · doi:10.26421/qic13.3-4-1 · Cited by 103 · cited 1×
“In a more realistic noise model, the higher-weight terms in the Hamiltonian would have O(1) strength (independent of system size), but would decay sufficiently rapidly as the qubits separate that the effective single-qubit noise strength is also O(1) [27, 28].”
BackgroundSelf-citationMitigating coherent noise using Pauli conjugation
Cai, Z., Xu, X., & Benjamin, S. C. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0233-0 · Cited by 99 · cited 1×
“Other schemes for mitigating coherent noise have been proposed in [13, 14, 15, 16].”
BackgroundPerformance of quantum error correction with coherent errors
Huang, E., Doherty, A. C., & Flammia, S. T. (2019) · Physical Review A · doi:10.1103/physreva.99.022313 · Cited by 88
Errors and pseudothresholds for incoherent and coherent noise
Gutiérrez, M., Smith, C., Lulushi, L., Janardan, S., & Brown, K. R. (2016) · Physical Review A · doi:10.1103/physreva.94.042338 · Cited by 75 · cited 2×
“The problem has already been studied numerically [21, 22, 20, 11]; however, our methods for organizing the estimate of the logical channel suggest different approaches to numerically simulating the logical channel.”
BackgroundMethodSquare Lattice Self-Avoiding Walks and Polygons
Guttmann, A. J., & Conway, A. R. (2001) · Annals of Combinatorics · doi:10.1007/pl00013842 · Cited by 71 · cited 1×
“A logical string can be regarded as a self-avoiding walk on the square lattice whose endpoints are a distance L apart, but previously derived upper bounds on the number of self-avoiding walks with specified length [34, 35, 36] do not treat the case where the distance between the endpoints differs from the length of th…”
BackgroundFault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics
Chamberland, C., Iyer, P. S., & Poulin, D. (2018) · Quantum · doi:10.22331/q-2018-01-04-43 · Cited by 59
On two-dimensional self-avoiding random walks
Guttmann, A. J. (1984) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/17/2/030 · Cited by 58 · cited 1×
“A logical string can be regarded as a self-avoiding walk on the square lattice whose endpoints are a distance L apart, but previously derived upper bounds on the number of self-avoiding walks with specified length [34, 35, 36] do not treat the case where the distance between the endpoints differs from the length of th…”
BackgroundBounding the average gate fidelity of composite channels using the unitarity
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab1800 · Cited by 44
Hard decoding algorithm for optimizing thresholds under general Markovian noise
Chamberland, C., Wallman, J. J., Beale, S. J., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.042332 · Cited by 43 · cited 1×
“Other schemes for mitigating coherent noise have been proposed in [13, 14, 15, 16].”
BackgroundNapp, J. C., & Preskill, J. P. (2013) · Quantum Information and Computation · doi:10.26421/qic13.5-6-9 · Cited by 41
Self-citationStabilizer Slicing: Coherent Error Cancellations in Low-Density Parity-Check Stabilizer Codes
Debroy, D. M., Li, M., Newman, M., & Brown, K. R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.250502 · Cited by 41 · cited 1×
“Other schemes for mitigating coherent noise have been proposed in [13, 14, 15, 16].”
BackgroundA small quantum computer is needed to optimize fault-tolerant protocols
Iyer, P., & Poulin, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab73c · Cited by 34 · cited 4×
“For codes of fixed size our results may not be tight; the coherence of logical channels for finite code blocks has been studied elsewhere [21, 11, 17].”
BackgroundMethodInfluentialSuzuki, Y., Fujii, K., & Koashi, M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.190503 · Cited by 34
Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach
Fern, J., Kempe, J., Simic, S. N., & Sastry, S. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.871942 · Cited by 16
1 Generalized Performance of Concatenated Quantum Codes – a dynamical systems approach
Fern, J., Kempe, J., Simić, S. N., & Sastry, S. (2006) · Cited by 14
Efficiently characterizing the total error in quantum circuitsPreprint
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2016) · arXiv (Cornell University) · Cited by 5
Efficiently characterizing the total error in quantum circuits
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2017) · APS March Meeting Abstracts · Cited by 2
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
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.