Does True Randomness Exist? Efficacy Testing IBM Quantum Computers via Statistical Randomness

• URL: http://arxiv.org/abs/2401.12250v1
• Date: Sat, 20 Jan 2024 17:53:30 GMT
• Title: Does True Randomness Exist? Efficacy Testing IBM Quantum Computers via Statistical Randomness
• Authors: Owen Root, Maria Becker
• Abstract summary: We introduce this testing method and utilize it to investigate the efficacy of nine IBM Quantum Computer systems. The testing method utilized four different quantum random number generator algorithms and a battery of eighteen statistical tests. Only a single quantum computer-algorithm combination was found to be statistically random, demonstrating the power of the testing method.
• Score: 0.1450405446885067
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to generate pseudo-random numbers. This ability of quantum computers has a variety of applications, one of which provides the basis for a method of efficacy testing Quantum Computers themselves. We introduce this testing method and utilize it to investigate the efficacy of nine IBM Quantum Computer systems. The testing method utilized four different quantum random number generator algorithms and a battery of eighteen statistical tests. Only a single quantum computer-algorithm combination was found to be statistically random, demonstrating the power of the testing method as well as indicating that further work is needed for these computers to reach their theoretical potential.

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)
• Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures [6.201566048090889]
  We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically) The theorem states that one cannot distinguish these two types of random numbers if the quantum random numbers are efficiently classically simulatable and the randomness measure used for the distinction is efficiently computable.
  arXiv  Detail & Related papers  (2023-09-20T07:50:30Z)
• Partial Loopholes Free Device Independent Quantum Random Number Generator Using IBM's Quantum Computers [0.24578723416255752]
  In this work, the violation of CHSH inequality has been used to propose a scheme by which one can generate device independent quantum random numbers. The performance of each quantum computer against the CHSH test has been plotted and characterized. This study will provide new directions for the development of self-testing and semi-self-testing random number generators using quantum computers.
  arXiv  Detail & Related papers  (2023-09-11T08:34:45Z)
• Quantum Computing and the Riemann Hypothesis [0.0]
  Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms. We show how to obtain functions as states in supersymmetric quantum mechanics.
  arXiv  Detail & Related papers  (2023-03-07T04:28:54Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Quantum Computing for Power Flow Algorithms: Testing on real Quantum Computers [0.0]
  This paper goes beyond quantum computing simulations and performs an experimental application of Quantum Computing for power systems on a real quantum computer. We use five different quantum computers, apply the HHL quantum algorithm, and examine the impact of current noisy quantum hardware on the accuracy and speed of an AC power flow algorithm.
  arXiv  Detail & Related papers  (2022-04-29T11:53:16Z)
• On the effects of biased quantum random numbers on the initialization of artificial neural networks [3.0736361776703562]
  A common property of quantum computers is that they can exhibit instances of true randomness as opposed to pseudo-randomness. Recent results suggest that benefits can indeed be achieved from the use of quantum random numbers.
  arXiv  Detail & Related papers  (2021-08-30T15:50:07Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• 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.