Generation of True Quantum Random Numbers with On-Demand Probability Distributions via Single-Photon Quantum Walks

• URL: http://arxiv.org/abs/2403.02614v1
• Date: Tue, 5 Mar 2024 03:05:19 GMT
• Title: Generation of True Quantum Random Numbers with On-Demand Probability Distributions via Single-Photon Quantum Walks
• Authors: Chaoying Meng, Miao Cai, Yufang Yang, Haodong Wu, Zhixiang Li, Yaping Ruan, Yong Zhang, Han Zhang, Keyu Xia, Franco Nori
• Abstract summary: We show that single-photon quantum walks can generate multi-bit random numbers with on-demand probability distributions. Our theoretical and experimental results exhibit high fidelity for various selected distributions.
• Score: 5.201119608184586
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Random numbers are at the heart of diverse fields, ranging from simulations of stochastic processes to classical and quantum cryptography. The requirement for true randomness in these applications has motivated various proposals for generating random numbers based on the inherent randomness of quantum systems. The generation of true random numbers with arbitrarily defined probability distributions is highly desirable for applications, but it is very challenging. Here we show that single-photon quantum walks can generate multi-bit random numbers with on-demand probability distributions, when the required ``coin'' parameters are found with the gradient descent (GD) algorithm. Our theoretical and experimental results exhibit high fidelity for various selected distributions. This GD-enhanced single-photon system provides a convenient way for building flexible and reliable quantum random number generators. Multi-bit random numbers are a necessary resource for high-dimensional quantum key distribution.

Related papers

• Non Deterministic Pseudorandom Generator for Quantum Key Distribution [0.0]
  Quantum Key Distribution thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. This paper proposes a pseudorandom generator based on post quantum primitives.
  arXiv  Detail & Related papers  (2023-11-06T11:03: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 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)
• 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)
• Multi-bit quantum random number generator from path-entangled single photons [2.095553036791944]
  Measurement outcomes on quantum systems exhibit inherent randomness and are fundamentally nondeterministic. We present a scheme for the generation of multi-bit random numbers using path-entangled single photons.
  arXiv  Detail & Related papers  (2022-02-22T14:37:17Z)
• Generating Haar-uniform Randomness using Stochastic Quantum Walks on a Photonic Chip [14.111146438141967]
  The Haar measure of randomness is a useful tool with wide applications such as boson sampling. Recently, a theoretical protocol was proposed to combine quantum control theory and driven quantum walks to generate Haar-uniform random operations. Here, we implement a two-dimensional quantum walk on the integrated photonic chip and demonstrate that the average of all distribution profiles converges to the even distribution when the evolution length increases, suggesting the 1-padar-uniform randomness.
  arXiv  Detail & Related papers  (2021-12-13T10:35:37Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Single photon randomness originating from the symmetry of dipole emission and the unpredictability of spontaneous emission [55.41644538483948]
  Quantum random number generation is a key ingredient for quantum cryptography and fundamental quantum optics. We experimentally demonstrate quantum random number generation based on the spontaneous emission process. The scheme can be extended to random number generation by coherent single photons with potential applications in solid-state based quantum communication at room temperature.
  arXiv  Detail & Related papers  (2021-02-18T14:07:20Z)
• 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.