Maximal global device-independent randomness from projective measurements in every dimension

• URL: http://arxiv.org/abs/2606.21369v2
• Date: Wed, 24 Jun 2026 14:50:28 GMT
• Title: Maximal global device-independent randomness from projective measurements in every dimension
• Abstract summary: Device-independent random number generation (DIQRNG) is the most secure form of generating private randomness using quantum physical processes.<n>We provide explicit protocols reaching $2log(d)$ bits based on mutually unbiased bases.
• Score: 1.1419092834574525
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Device-independent random number generation (DIQRNG) is the most secure form of generating private randomness using quantum physical processes. Its strength lies in producing numbers that are impossible to predict by any eavesdropper restricted by the laws of quantum theory. Moreover, security is proven solely from observed measurement statistics, without the need to characterise or trust the devices used in random number generation. Implementing DIQRNG is, however, costly, as it requires high-quality entangled systems. It is therefore important to make the best use of available resources. In this work, we show that using projective measurements -- which are most readily implementable experimentally -- one can certify $2\log(d)$ bits of device-independent randomness from a bipartite system of local dimension $d$ for every $d \ge 2$, thus reaching the theoretically maximum possible rate of DIQRNG. We provide explicit protocols reaching $2\log(d)$ bits based on mutually unbiased bases. Furthermore, we compute numerical bounds on the rate for the case of imperfect implementations, showing that our protocols are robust to experimental noise.

Related papers

• Continuous-Variable Source-Independent Quantum Random Number Generation with General POVMs [9.797328475012575]
  Continuous-variable source-independent quantum random number generators offer the highest generation rates among semi-device-independent protocols.<n>We propose a rigorous security proof framework that accommodates general, infinite-dimensional positive-operator-valued measures.<n>We experimentally validate our protocol on an optical platform using vacuum and weak coherent states, achieving a maximum secure randomness extraction of 1.11 bits per sample.
  arXiv  Detail & Related papers  (2026-06-30T01:48:49Z)
• Semi-Device-Independent Quantum Random Number Generator Resistant to General Attacks [6.918556765582295]
  Quantum random number generators (QRNGs) produce true random numbers based on the inherent randomness of quantum theory.<n>In this paper, we propose a semi-DI QRNG that resists general attacks while accounting for finite-size effects.<n>Our work offers a promising approach to achieve both the robust security and high generation rate with a simple experimental setup.
  arXiv  Detail & Related papers  (2026-02-06T03:47:12Z)
• Maximal device-independent randomness in every dimension [1.1650821883155187]
  Device-independent quantum random number generation is a framework that makes use of the intrinsic randomness of quantum processes. In this paper we demonstrate that this bound can be achieved for all dimensions $d$ by providing a family of explicit protocols.
  arXiv  Detail & Related papers  (2024-09-27T17:03:11Z)
• Improvements on Device Independent and Semi-Device Independent Protocols of Randomness Expansion [0.0]
  Device Independent (DI) and Semi-Device Independent (semi-DI) protocols of randomness expansion are discussed. We introduce enhanced DI and semi-DI protocols that surpass existing ones in terms of output randomness rate, security, or in some instances, both. A notable contribution is the introduction of randomness expansion protocols that recycle input randomness, significantly enhancing finite round randomness rates for DI protocols based on the CHSH inequality violation.
  arXiv  Detail & Related papers  (2023-11-22T17:03:04Z)
• 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)
• 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)
• 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)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model [50.38446482252857]
  This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator) We first consider $gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space $mathcalS$ and action space $mathcalA$. We prove that a plain model-based planning algorithm suffices to achieve minimax-optimal sample complexity given any target accuracy level.
  arXiv  Detail & Related papers  (2020-05-26T17:53:18Z)
• Semi-Device-Independent Random Number Generation with Flexible Assumptions [0.0]
  We propose a new framework for semi-device-independent randomness certification using a source of trusted vacuum in the form of a signal shutter. We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.
  arXiv  Detail & Related papers  (2020-02-27T18:05:17Z)

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.