Tensor-Network Simulations of the Surface Code under Realistic Noise
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The surface code is a many-body quantum system, and simulating it in generic conditions is computationally hard. While the surface code is believed to have a high threshold, the numerical simulations used to establish this threshold are based on simplified noise models. We present a tensor-network algorithm for simulating error correction with the surface code under arbitrary local noise. We use this algorithm to study the threshold and the subthreshold behavior of the amplitude damping and systematic rotation channels. We also compare these results to those obtained by making standard approximations to the noise models.
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
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
Computational complexity of projected entangled pair states
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140506 · Cited by 313
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178
Cited by
Correcting 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
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
A 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
Self-citationGeneral tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Logical Randomized Benchmarking
Combes, J., Granade, C., Ferrie, C., & Flammia, S. T. (2017) · arXiv · doi:10.48550/arxiv.1702.03688 · Cited by 20
Metadata
- Authors
- Darmawan, A. S., & Poulin, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2017-07-27
- Volume
- 119
- Issue
- 4
- Pages
- 040502-040502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2516904078
- Cited by
- 88
- References
- 3
- FWCI
- 5.08
- 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: Tensor-Network Simulations of the Surface Code under Realistic Noise. https://app.cochat.ai/papers/10.1103/physrevlett.119.040502
- The paper
- Darmawan, A. S., & Poulin, D. (2017). Tensor-Network Simulations of the Surface Code under Realistic Noise. Physical Review Letters. https://doi.org/10.1103/physrevlett.119.040502
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.