CoChat

Efficient parallelization of tensor network contraction for simulating quantum computation

Open access
Huang, Cupjin, Zhang, Fang, Newman, Michael, Ni, Xiaotong, Ding, Dawei, Cai, Junjie, Gao, Xun, Wang, Tenghui, Wu, Feng, Zhang, Gengyan, Ku, Hsiang-Sheng, Tian, Zhengxiong, Wu, Junyin, Xu, Haihong, Yu, Huanjun, Yuan, Bo, Szegedy, Mario, Shi, Yaoyun, Zhao, Hui-Hai, Deng, Chunqing, Chen, Jianxin · 2021 · Nature Computational Science
Cited by 74

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s43588-021-00119-7

Cites

17 of 17 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 17 references

Cited by

See all 74

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.