Analysis of a Programmable Quantum Annealer as a Random Number Generator

• URL: http://arxiv.org/abs/2307.02573v4
• Date: Sat, 10 Feb 2024 02:12:17 GMT
• Title: Analysis of a Programmable Quantum Annealer as a Random Number Generator
• Authors: Elijah Pelofske
• Abstract summary: 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.
• Score: 1.0878040851638
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the $1$ microsecond annealing time measurements had a min-entropy of $0.824$.

Related papers

• How much secure randomness is in a quantum state? [0.0]
  How much cryptographically-secure randomness can be extracted from a quantum state? We consider a general adversarial model that allows for an adversary who has quantum side-information about both the source and the measurement device.
  arXiv  Detail & Related papers  (2024-10-21T19:16:56Z)
• 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)
• Quantum Random Number Generation with Partial Source Assumptions [26.983886835892363]
  Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers. However, real-world devices often suffer from imperfections that can undermine the integrity and privacy of generated randomness. We present a novel quantum random number generator and experimentally demonstrate it.
  arXiv  Detail & Related papers  (2023-12-06T08:08:11Z)
• 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)
• 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)
• 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)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Self-testing randomness from a nuclear spin system [0.9774183498779745]
  We present a proof-of-concept random number generator based on a nuclear spin system for the first time. The entropy of randomness in the experimental data is quantified by two dimension witness certification protocols.
  arXiv  Detail & Related papers  (2022-03-09T08:43:45Z)
• 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)
• Unpredictable and Uniform RNG based on time of arrival using InGaAs Detectors [0.14337588659482517]
  We have generated high-quality quantum random numbers from a weak coherent source at telecommunication wavelength. The entropy is based on time of arrival of quantum states within a predefined time interval. The detection of photons by the InGaAs single-photon detectors and high precision time measurement of 5 ps enables us to generate 16 random bits per arrival time.
  arXiv  Detail & Related papers  (2020-10-24T13:31:00Z)
• 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.