Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1912.11158 · Nature Physics

Device-independent randomness expansion with entangled photons

Lynden K. Shalm, Yanbao Zhang, Joshua C. Bienfang, Collin Schlager, Martin J. Stevens, Michael D. Mazurek, Carlos Abellán, Waldimar Amaya, Morgan W. Mitchell, Mohammad A. Alhejji, Honghao Fu, Joel Ornstein, Richard P. Mirin, Sae Woo Nam, Emanuel H. Knill

Published Jan 28, 2021• 111 citations
arXivHTMLPDF
DOI
10.1038/s41567-020-01153-4

Related papers

Device-independent randomness expansion against quantum side information

Wen‐Zhao Liu, Minghan Li, Sammy Ragy +9 more

arXiv:1912.11159•Nature Physics•Feb 11, 2021•151 citations

Source-device-independent randomness expansion using quantum random access codes

Yu-Qian Zhou, Qian-Kun Yao, Ya-Qi Dong +2 more

Quantum Information Processing•May 13, 2023•0 citations

Device-independent randomness certification using multiple copies of entangled states

Shyam Sundar Mahato, A. K. Pan

arXiv:2212.14341•Physics Letters A•Nov 4, 2022•8 citations

A Framework for Quantum-Secure Device-Independent Randomness Expansion

Peter J. Brown, Sammy Ragy, Roger Colbeck

A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security. A large amount of work to date has focussed on a particular protocol based on spot-checking devices using the CHSH inequality. Here we show how to derive randomness expansion rates for a wide range of protocols, with security against a quantum adversary. Our technique uses semidefinite programming and a recent improvement of the entropy accumulation theorem. To support the work and facilitate its use, we provide code that can generate lower bounds on the amount of randomness that can be output based on the measured quantities in the protocol. As an application, we give a protocol that robustly generates up to two bits of randomness per entangled qubit pair, which is twice that established in existing analyses of the spot-checking CHSH protocol in the low noise regime.

arXiv:1810.13346•IEEE Transactions on Information Theory•Dec 17, 2019•47 citations

Investigating device-independent quantum random number generation

Vardaan Mongia, Abhishek Kumar, Shashi Prabhakar +2 more

Physics Letters A•Oct 2, 2024•4 citations

A framework for quantum-secure device-independent randomness expansion

Peter J. Brown, Sammy Ragy, Roger Colbeck

A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security.A large amount of work to date has focussed on a particular protocol based on spot-checking devices using the CHSH inequality.Here we show how to derive randomness expansion rates for a wide range of protocols, with security against a quantum adversary.Our technique uses semidefinite programming and a recent improvement of the entropy accumulation theorem.To support the work and facilitate its use, we provide code that can generate lower bounds on the amount of randomness that can be output based on the measured quantities in the protocol.As an application, we give a protocol that robustly generates up to two bits of randomness per entangled qubit pair, which is twice that established in existing analyses of the spot-checking CHSH protocol in the low noise regime.

•May 1, 2020•13 citations
A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security. A large amount of work to date has focussed on a particular protocol based on spot-checking devices using the CHSH inequality. Here we show how to derive randomness expansion rates for a wide range of protocols, with security against a quantum adversary. Our technique uses semidefinite programming and a recent improvement of the entropy accumulation theorem. To support the work and facilitate its use, we provide code that can generate lower bounds on the amount of randomness that can be output based on the measured quantities in the protocol. As an application, we give a protocol that robustly generates up to two bits of randomness per entangled qubit pair, which is twice that established in existing analyses of the spot-checking CHSH protocol in the low noise regime.
A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security.A large amount of work to date has focussed on a particular protocol based on spot-checking devices using the CHSH inequality.Here we show how to derive randomness expansion rates for a wide range of protocols, with security against a quantum adversary.Our technique uses semidefinite programming and a recent improvement of the entropy accumulation theorem.To support the work and facilitate its use, we provide code that can generate lower bounds on the amount of randomness that can be output based on the measured quantities in the protocol.As an application, we give a protocol that robustly generates up to two bits of randomness per entangled qubit pair, which is twice that established in existing analyses of the spot-checking CHSH protocol in the low noise regime.