Quantum Supremacy Circuit Simulation on Sunway TaihuLight
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum computers often sharply decreases as the circuit depth increases. Thus, an ideal quantum circuit simulator on classical computers, especially on high-performance computers, is needed for benchmarking and validation. We design a large-scale simulator of universal random quantum circuits, often called “quantum supremacy circuits”, and implement it on Sunway TaihuLight. The simulator can be used to accomplish the following two tasks: 1) Computing a complete output state-vector; 2) Calculating one or a few amplitudes. We target the simulation of 49-qubit circuits. For task 1), we successfully simulate such a circuit of depth 39, and for task 2) we reach the 55-depth level. To the best of our knowledge, both of the simulation results reach the largest depth for 49-qubit quantum supremacy circuits.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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 · cited 3×
“A universal random quantum circuit has a 2D grid architecture [5].”
BackgroundInfluentialSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv · doi:10.48550/arxiv.1612.05903 · Cited by 218
64-qubit quantum circuit simulation
Chen, Z.-Y., Zhou, Q., Xue, C., Yang, X., Guo, G.-C., & Guo, G.-P. (2018) · Science Bulletin · doi:10.1016/j.scib.2018.06.007 · Cited by 136
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
Cited by
Deep Residual Learning for Image Recognition: A Survey
Shafiq, M., & Gu, Z. (2022) · Applied Sciences · doi:10.3390/app12188972 · Cited by 1,023
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Quantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
Probabilistic simulation of quantum circuits using a deep-learning architecture
Carrasquilla, J., Luo, D., Pérez, F., Milsted, A., Clark, B. K., Volkovs, M., & Aolita, L. (2021) · Physical Review A · doi:10.1103/physreva.104.032610 · Cited by 53
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
Metadata
- Authors
- Li, R., Wu, B., Ying, M., Sun, X., & Yang, G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2020-04-01
- Volume
- 31
- Issue
- 4
- Pages
- 805-816
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W2981129109
- Cited by
- 70
- References
- 7
- FWCI
- 4.26
- 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
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.