Traceable random numbers from a nonlocal quantum advantage

• URL: http://arxiv.org/abs/2411.05247v1
• Date: Fri, 08 Nov 2024 00:08:17 GMT
• Title: Traceable random numbers from a nonlocal quantum advantage
• Authors: Gautam A. Kavuri, Jasper Palfree, Dileep V. Reddy, Yanbao Zhang, Joshua C. Bienfang, Michael D. Mazurek, Mohammad A. Alhejji, Aliza U. Siddiqui, Joseph M. Cavanagh, Aagam Dalal, Carlos Abellán, Waldimar Amaya, Morgan W. Mitchell, Katherine E. Stange, Paul D. Beale, Luís T. A. N. Brandão, Harold Booth, René Peralta, Sae Woo Nam, Richard P. Mirin, Martin J. Stevens, Emanuel Knill, Lynden K. Shalm,
• Abstract summary: We demonstrate a fully traceable random number generation protocol based on device-independent techniques. This protocol is at the heart of a public traceable and certifiable quantum randomness beacon that we have launched.
• Score: 1.4038831918280454
• License:
• Abstract: The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations-the generation processes cannot be fully traced, audited, and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here, for the first time, we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol is at the heart of a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7434 out of 7454 attempts -- a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error times actual success probability bounded by $2^{-64}$. The generation of certifiable and traceable randomness represents one of the first public services that operates with an entanglement-derived advantage over comparable classical approaches.

Related papers

• Certification of randomness without seed randomness [0.0]
  Device-independently certified random number generators provide maximum security. We propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness.
  arXiv  Detail & Related papers  (2023-07-21T10:52:44Z)
• Certification of unbounded randomness without nonlocality [0.0]
  We provide a scheme to certify unbounded randomness in a semi-device-independent way based on the maximal violation of Leggett-Garg inequalities. The scheme is independent of the choice of the quantum state, and consequently even "quantum" noise could be utilized to self-test quantum measurements.
  arXiv  Detail & Related papers  (2023-07-03T20:11:08Z)
• A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
  We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits. limitations on computing power can restrict an end-user's ability to perform such verification.
  arXiv  Detail & Related papers  (2023-05-18T12:13:48Z)
• 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)
• Source-independent quantum random number generator against tailored detector blinding attacks [6.86599501487994]
  We propose a quantum random number generation protocol that addresses source vulnerability and ferocious detector blinding attacks. We experimentally demonstrate the ability of our protocol to generate random numbers for two-dimensional measurement with a generation speed of 0.1 bit per pulse.
  arXiv  Detail & Related papers  (2022-04-26T08:47:37Z)
• Certified Random Number Generation from Quantum Steering [1.0820909926464386]
  Certified randomness protocols have been developed which remove the need for trust in devices by taking advantage of nonlocality. Here, we use a photonic platform to implement our protocol, which operates in the quantum steering scenario. We demonstrate an approach for a steering-based generator of public or private randomness, and the first generation of certified random bits, with the detection loophole closed.
  arXiv  Detail & Related papers  (2021-11-18T03:49:43Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Scalable quantum random number generator for cryptography based on the random flip-flop approach [1.2578844450585998]
  We present a quantum random number generator (QRNG) which makes use of a photoelectric effect in single-photon avalanche diodes (SPADs) as a source of randomness. For the first time we investigate this method in detail and find that, out of two main imperfections, bias is due only to hardware imperfections.
  arXiv  Detail & Related papers  (2021-02-24T11:00:22Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Using Randomness to decide among Locality, Realism and Ergodicity [91.3755431537592]
  An experiment is proposed to find out, or at least to get an indication about, which one is false. The results of such experiment would be important not only to the foundations of Quantum Mechanics.
  arXiv  Detail & Related papers  (2020-01-06T19:26:32Z)

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.