Efficient parallelization of tensor network contraction for simulating quantum computation
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We develop an algorithmic framework for contracting tensor networks and demonstrate its power by classically simulating quantum computation of sizes previously deemed out of reach. Our main contribution, index slicing, is a method that efficiently parallelizes the contraction by breaking it down into much smaller and identically structured subtasks, which can then be executed in parallel without dependencies. We benchmark our algorithm on a class of random quantum circuits, achieving greater than 10 5 times acceleration over the original estimate of the simulation cost. We then demonstrate applications of the simulation framework for aiding the development of quantum algorithms and quantum error correction. As tensor networks are widely used in computational science, our simulation framework may find further applications.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Anomalous collapses of Nares Strait ice arches leads to enhanced export of Arctic sea ice
Moore, G. W. K., Howell, S. E. L., Brady, M., Xu, X., & McNeil, K. (2021) · Nature Communications · doi:10.1038/s41467-020-20314-w · Cited by 5,155
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405 · cited 1×
“Recent advances in quantum computing hardware have resulted in quantum processors with more than 50 qubits, and there have been multiple claims that quantum superiority has been achieved on different quantum devices, including superconducting systems 2 and photonic quantum devices 3 .”
BackgroundOrús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Matrix Product Density Operators: Simulation of Finite-Temperature and Dissipative Systems
Verstraete, F., García-Ripoll, J. J., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.207204 · Cited by 1,098
Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions
Jordan, J., Orús, R., Vidal, G., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.250602 · Cited by 710
Cited by
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Density Matrix Renormalization Group with Tensor Processing Units
Ganahl, M., Beall, J., Hauru, M., Lewis, A. G. M., Wojno, T., Yoo, J. H., Zou, Y., & Vidal, G. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010317 · Cited by 37
Equivalence checking of quantum circuits via intermediary matrix product operator
Sander, A., Burgholzer, L., & Wille, R. (2025) · Physical Review Research · doi:10.1103/3q71-y8cf · Cited by 3
Metadata
- Authors
- Huang, C., Zhang, F., Newman, M., Ni, X., Ding, D., Cai, J., Gao, X., Wang, T., Wu, F., Zhang, G., Ku, H.-S., Tian, Z., Wu, J., Xu, H., Yu, H., Yuan, B., Szegedy, M., Shi, Y., Zhao, H.-H., Deng, C., & Chen, J.
- Venue
- Nature Computational Science
- Published
- 2021-09-13
- Volume
- 1
- Issue
- 9
- Pages
- 578-587
- ISSN
- 2662-8457 (ISSN-L)
- OpenAlex
- W3201218676
- Cited by
- 74
- References
- 17
- FWCI
- 3.88
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Efficient parallelization of tensor network contraction for simulating quantum computation. https://app.cochat.ai/papers/10.1038/s43588-021-00119-7
- The paper
- Huang, C., Zhang, F., Newman, M., Ni, X., Ding, D., Cai, J., Gao, X., Wang, T., Wu, F., Zhang, G., Ku, H.-S., Tian, Z., Wu, J., Xu, H., Yu, H., Yuan, B., Szegedy, M., Shi, Y., Zhao, H.-H., . . . Chen, J. (2021). Efficient parallelization of tensor network contraction for simulating quantum computation. Nature Computational Science. https://doi.org/10.1038/s43588-021-00119-7
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.