On the effects of biased quantum random numbers on the initialization of artificial neural networks

• URL: http://arxiv.org/abs/2108.13329v2
• Date: Tue, 19 Dec 2023 20:22:20 GMT
• Title: On the effects of biased quantum random numbers on the initialization of artificial neural networks
• Authors: Raoul Heese, Moritz Wolter, Sascha M\"ucke, Lukas Franken, Nico Piatkowski
• Abstract summary: 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.
• Score: 3.0736361776703562
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent advances in practical quantum computing have led to a variety of cloud-based quantum computing platforms that allow researchers to evaluate their algorithms on noisy intermediate-scale quantum (NISQ) devices. A common property of quantum computers is that they can exhibit instances of true randomness as opposed to pseudo-randomness obtained from classical systems. Investigating the effects of such true quantum randomness in the context of machine learning is appealing, and recent results vaguely suggest that benefits can indeed be achieved from the use of quantum random numbers. To shed some more light on this topic, we empirically study the effects of hardware-biased quantum random numbers on the initialization of artificial neural network weights in numerical experiments. We find no statistically significant difference in comparison with unbiased quantum random numbers as well as biased and unbiased random numbers from a classical pseudo-random number generator. The quantum random numbers for our experiments are obtained from real quantum hardware.

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)
• Does True Randomness Exist? Efficacy Testing IBM Quantum Computers via Statistical Randomness [0.1450405446885067]
  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.
  arXiv  Detail & Related papers  (2024-01-20T17:53:30Z)
• The hardness of quantum spin dynamics [1.1999555634662633]
  We show that sampling from the output distribution generated by a wide class of quantum spin Hamiltonians is a hard problem for classical computers. We estimate that an instance involving about 200 spins will be challenging for classical devices but feasible for intermediate-scale quantum computers with fault-tolerant qubits.
  arXiv  Detail & Related papers  (2023-12-12T19:00:03Z)
• 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 data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• The Effects of Quantum Randomness on a System Exhibiting Computational Creativity [0.0]
  We present experimental results on the effects of using quantum or 'truly' random numbers, as opposed to pseudorandom numbers, in a system that exhibits computational creativity. The results indicate that using quantum random numbers too often or too seldom in the composing process does not have any positive effect on the output generated. There is a'sweet spot' of using quantum random numbers 15% of the time that results in fewer statistical outliers.
  arXiv  Detail & Related papers  (2020-08-22T04:34:17Z)
• 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.