Race for Quantum Advantage using Random Circuit Sampling

• URL: http://arxiv.org/abs/2211.13267v1
• Date: Wed, 23 Nov 2022 19:33:48 GMT
• Title: Race for Quantum Advantage using Random Circuit Sampling
• Authors: Sangchul Oh, Sabre Kais
• Abstract summary: We compare bit strings sampled from classical computers using tensor network simulation. All Kalachev et al.'s samples pass the NIST random number tests.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Random circuit sampling, the task to sample bit strings from a random unitary operator, has been performed to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it has been claimed that classical computers using tensor network simulation could catch on current noisy quantum processors for random circuit sampling. While the linear cross entropy benchmark fidelity is used to certify all these claims, it may not capture in detail statistical properties of outputs. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [arXiv:2112.15083 (2021)] and from the Sycamore and Zuchongzhi quantum processors. It is shown that all Kalachev et al.'s samples pass the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuzhongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically close to the Sycamore samples than Pan et al.'s while the three datasets have similar values of the linear cross entropy fidelity. Our finding implies that further study is needed to certify or beat the claims of quantum advantage for random circuit sampling.

Related papers

• 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)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• 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)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Statistical Analysis on Random Quantum Sampling by Sycamore and Zuchongzhi Quantum Processors [0.0]
  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.
  arXiv  Detail & Related papers  (2022-04-12T15:12:37Z)
• Classical Sampling of Random Quantum Circuits with Bounded Fidelity [0.5735035463793007]
  We present a classical sampling algorithm for producing the probability distribution of any given random quantum circuit. We classically produced 1 million samples with the fidelity bounded by 0.2%, based on the 20-cycle circuit of the Sycamore 53-qubit quantum chip. We estimate that for the Zuchongzhi 56-qubit 20-cycle circuit one can produce 1M samples with fidelity 0.066% using the Selene supercomputer.
  arXiv  Detail & Related papers  (2021-12-30T14:51:39Z)
• Simulating the Sycamore quantum supremacy circuits [7.15956388718641]
  We propose a general tensor network method for simulating quantum circuits. As an application, we study the sampling problem of Google's Sycamore circuits.
  arXiv  Detail & Related papers  (2021-03-04T14:55:15Z)

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.