Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors
Abstract
Random quantum circuit sampling, a task to sample bit strings from a random quantum circuit, is considered a suitable benchmark task to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum circuit sampling was performed on the Sycamore quantum processor with 53 qubits [Nature (London) 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare the statistical properties of the outputs of the random quantum circuit sampling by the Sycamore and Zuchongzhi processors. Using the Marchenko-Pastur law of random matrices of bit strings and the Wasssertein distances between bit strings, we find that the statistical properties of Sycamore bit strings are quite different from those of Zuchongzhi bit strings, while both processors score similar values of linear cross-entropy fidelity for random circuit sampling. Some bit strings sampled by the Zuchongzhi processor pass the NIST random number tests while both Sycamore and Zuchongzhi processors show similar patterns in the heat maps of bit strings. Zuchongzhi bit strings are much closer to classical uniform random bits than those of Sycamore. It is shown that the statistical properties of bit strings of both random quantum circuitsmore »
- Authors:
-
- Purdue Univ., West Lafayette, IN (United States)
- Publication Date:
- Research Org.:
- National Quantum Information Science (QIS) Research Centers (United States)
- Sponsoring Org.:
- USDOE Office of Science (SC); National Science Foundation (NSF)
- OSTI Identifier:
- 1982757
- Grant/Contract Number:
- 1955907
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Physical Review A
- Additional Journal Information:
- Journal Volume: 106; Journal Issue: 3; Journal ID: ISSN 2469-9926
- Publisher:
- American Physical Society (APS)
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Optics; Physics; Quantum benchmarking; Quantum computation; Quantum simulation; Superconducting qubits
Citation Formats
Oh, Sangchul, and Kais, Sabre. Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors. United States: N. p., 2022.
Web. doi:10.1103/physreva.106.032433.
Oh, Sangchul, & Kais, Sabre. Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors. United States. https://doi.org/10.1103/physreva.106.032433
Oh, Sangchul, and Kais, Sabre. Wed .
"Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors". United States. https://doi.org/10.1103/physreva.106.032433. https://www.osti.gov/servlets/purl/1982757.
@article{osti_1982757,
title = {Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors},
author = {Oh, Sangchul and Kais, Sabre},
abstractNote = {Random quantum circuit sampling, a task to sample bit strings from a random quantum circuit, is considered a suitable benchmark task to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum circuit sampling was performed on the Sycamore quantum processor with 53 qubits [Nature (London) 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare the statistical properties of the outputs of the random quantum circuit sampling by the Sycamore and Zuchongzhi processors. Using the Marchenko-Pastur law of random matrices of bit strings and the Wasssertein distances between bit strings, we find that the statistical properties of Sycamore bit strings are quite different from those of Zuchongzhi bit strings, while both processors score similar values of linear cross-entropy fidelity for random circuit sampling. Some bit strings sampled by the Zuchongzhi processor pass the NIST random number tests while both Sycamore and Zuchongzhi processors show similar patterns in the heat maps of bit strings. Zuchongzhi bit strings are much closer to classical uniform random bits than those of Sycamore. It is shown that the statistical properties of bit strings of both random quantum circuits change little as the depth of the random quantum circuits increases. Our findings raise a question about the computational reliability of noisy quantum processors because two quantum processors with similar noise levels and similar qubit structures produced statistically different outputs for the same random quantum circuit sampling.},
doi = {10.1103/physreva.106.032433},
journal = {Physical Review A},
number = 3,
volume = 106,
place = {United States},
year = {Wed Sep 28 00:00:00 EDT 2022},
month = {Wed Sep 28 00:00:00 EDT 2022}
}
Works referenced in this record:
Quantum computational advantage using photons
journal, December 2020
- Zhong, Han-Sen; Wang, Hui; Deng, Yu-Hao
- Science, Vol. 370, Issue 6523
Statistical Properties of Bit Strings Sampled from Sycamore Random Quantum Circuits
journal, August 2022
- Oh, Sangchul; Kais, Sabre
- The Journal of Physical Chemistry Letters, Vol. 13, Issue 32
Quantum supremacy using a programmable superconducting processor
dataset, January 2019
- Martinis, John; Boixo, Sergio; Neven, Hartmut
- Dryad
Quantum random number generators
journal, February 2017
- Herrero-Collantes, Miguel; Garcia-Escartin, Juan Carlos
- Reviews of Modern Physics, Vol. 89, Issue 1
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
journal, October 1997
- Shor, Peter W.
- SIAM Journal on Computing, Vol. 26, Issue 5
Quantum Algorithm for Linear Systems of Equations
journal, October 2009
- Harrow, Aram W.; Hassidim, Avinatan; Lloyd, Seth
- Physical Review Letters, Vol. 103, Issue 15
Characterizing quantum supremacy in near-term devices
journal, April 2018
- Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.
- Nature Physics, Vol. 14, Issue 6
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
journal, October 2021
- Zhong, Han-Sen; Deng, Yu-Hao; Qin, Jian
- Physical Review Letters, Vol. 127, Issue 18
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
journal, October 2021
- Wu, Yulin; Bao, Wan-Su; Cao, Sirui
- Physical Review Letters, Vol. 127, Issue 18
Diffusion MRI noise mapping using random matrix theory: Diffusion MRI Noise Mapping
journal, November 2015
- Veraart, Jelle; Fieremans, Els; Novikov, Dmitry S.
- Magnetic Resonance in Medicine, Vol. 76, Issue 5
Simulating physics with computers
journal, June 1982
- Feynman, Richard P.
- International Journal of Theoretical Physics, Vol. 21, Issue 6-7
Random Matrix Theory and Financial Correlations
journal, July 2000
- Laloux, Laurent; Cizeau, Pierre; Potters, Marc
- International Journal of Theoretical and Applied Finance, Vol. 03, Issue 03
Quantum certification and benchmarking
journal, June 2020
- Eisert, Jens; Hangleiter, Dominik; Walk, Nathan
- Nature Reviews Physics, Vol. 2, Issue 7
Predicting protein–ligand affinity with a random matrix framework
journal, November 2016
- Lee, Alpha A.; Brenner, Michael P.; Colwell, Lucy J.
- Proceedings of the National Academy of Sciences, Vol. 113, Issue 48
Distribution of Eigenvalues for some sets of Random Matrices
journal, April 1967
- Marčenko, V. A.; Pastur, L. A.
- Mathematics of the USSR-Sbornik, Vol. 1, Issue 4
Noise Dressing of Financial Correlation Matrices
journal, August 1999
- Laloux, Laurent; Cizeau, Pierre; Bouchaud, Jean-Philippe
- Physical Review Letters, Vol. 83, Issue 7
Quantum supremacy using a programmable superconducting processor
journal, October 2019
- Arute, Frank; Arya, Kunal; Babbush, Ryan
- Nature, Vol. 574, Issue 7779
A Random Matrix Theory Approach to Denoise Single-Cell Data
journal, June 2020
- Aparicio, Luis; Bordyuh, Mykola; Blumberg, Andrew J.
- Patterns, Vol. 1, Issue 3