Device-independent Shannon entropy certification
arXiv:2505.05395 · doi:10.1088/1367-2630/ae20b2
Abstract
Quantum technologies promise information processing and communication technology advancements, including random number generation (RNG). Using Bell inequalities, a user of a quantum RNG hardware can certify that the values provided by an untrusted device are truly random. This problem has been extensively studied for von Neumann and min-entropy as a measure of randomness. However, in this paper, we analyze the feasibility of such verification for Shannon entropy. We investigate how the usability of various Bell inequalities differs depending on the presence of noise. Moreover, we present the benefit of certification for Shannon compared to min-entropy, as well as the tight analytical lower bound for Shannon entropy in randomness certification.
16 pages, 12 figures
References in corpus (30)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Cryptography
- Quantum cryptography: Public key distribution and coin tossing
- Advances in Quantum Cryptography
- Device-independent security of quantum cryptography against collective attacks
- Random Numbers Certified by Bell's Theorem
- Quantum Random Number Generators
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Bounding the set of quantum correlations
- Private Randomness Expansion With Untrusted Devices
- Quantum Randomness Certified by the Uncertainty Principle
- Security of practical private randomness generation
- More Randomness from the Same Data
- Optimal randomness certification in the quantum steering and prepare-and-measure scenarios
- Device-independent Randomness Expansion with Entangled Photons
- A bias free true random number generator
- Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
- Properties making a chaotic system a good Pseudo Random Number Generator
- Experimental Realization of Device-Independent Quantum Randomness Expansion
- Causality and Cirel'son bounds
- Experimental fast quantum random number generation using high-dimensional entanglement with entropy monitoring
- Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems
- Robustness of quantum randomness expansion protocols in the presence of noise
- Quantum Random Number Generator using Photon-Number Path Entanglement
- Provably-secure quantum randomness expansion with uncharacterised homodyne detection
- Quantum to Classical Randomness Extractors
- Randomness versus nonlocality in the Mermin-Bell experiment with three parties
- Rolling the dice for better deep learning performance: A study of randomness techniques in deep neural networks
- Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
- Generalized measurements on qubits in quantum randomness certification and expansion