Statistical Analysis on Random Quantum Sampling by Sycamore and Zuchongzhi Quantum Processors

• URL: http://arxiv.org/abs/2204.05875v1
• Date: Tue, 12 Apr 2022 15:12:37 GMT
• Title: Statistical Analysis on Random Quantum Sampling by Sycamore and Zuchongzhi Quantum Processors
• Authors: Sangchul Oh and Sabre Kais
• Abstract summary: We analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Some Zuchongzhi's bit-strings pass the random number tests while both Sycamore and Zuchongzhi show similar patterns in heatmaps of bit-strings.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Random quantum sampling, a task to sample bit-strings from a random quantum circuit, is considered one of suitable benchmark tasks to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum sampling was performed on the Sycamore quantum processor with 53 qubits [Nature 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Using the Marchenko-Pastur law and the Wasssertein distances, we find that quantum random sampling of Zuchongzhi is more closer to classical uniform random sampling than those of Sycamore. Some Zuchongzhi's bit-strings pass the random number tests while both Sycamore and Zuchongzhi show similar patterns in heatmaps of bit-strings. It is shown that statistical properties of both random quantum samples change little as the depth of random quantum circuits increases. Our findings raise a question about computational reliability of noisy quantum processors that could produce statistically different outputs for the same random quantum sampling task.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness [0.0]
  We prove the natural robustness of quantum statistical queries for learning quantum processes. We adapt a learning algorithm for constant-depth quantum circuits to the quantum statistical query setting. We show the hardness of the quantum threshold search problem from quantum statistical queries.
  arXiv  Detail & Related papers  (2024-05-20T14:55:20Z)
• Counting collisions in random circuit sampling for benchmarking quantum computers [0.7252027234425332]
  We show that counting the number of collisions when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer. We show that this quantity, if properly normalized, can be used as a "collision anomaly" benchmark or as a "collision volume" test.
  arXiv  Detail & Related papers  (2023-12-07T11:12:30Z)
• Verifiable measurement-based quantum random sampling with trapped ions [0.7978498178655667]
  Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage is through quantum random sampling performed on quantum computing devices. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation.
  arXiv  Detail & Related papers  (2023-07-26T18:00:03Z)
• Analysis of a Programmable Quantum Annealer as a Random Number Generator [1.0878040851638]
  We present experimental random number results from a D-Wave 2000Q quantum annealer. The results show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences.
  arXiv  Detail & Related papers  (2023-07-05T18:15:06Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Race for Quantum Advantage using Random Circuit Sampling [0.0]
  We compare bit strings sampled from classical computers using tensor network simulation. All Kalachev et al.'s samples pass the NIST random number tests.
  arXiv  Detail & Related papers  (2022-11-23T19:33:48Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Quantum Random Number Generation using a Solid-State Single-Photon Source [89.24951036534168]
  Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. We demonstrate QRNG with a quantum emitter in hexagonal boron nitride. Our results open a new avenue to the fabrication of on-chip deterministic random number generators.
  arXiv  Detail & Related papers  (2020-01-28T22:47:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.