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:2503.19759 · Nature Reviews Physics

Applications of certified randomness

Omar Amer, Shouvanik Chakrabarti, Kaushik Chakraborty, Shaltiel Eloul, Niraj Kumar, Charles Lim, Minzhao Liu, Pradeep Niroula, Yash Satsangi, Ruslan Shaydulin, Marco Pistoia

Published Jul 7, 2025• 3 citations
arXivHTMLPDF
DOI
10.1038/s42254-025-00845-1

Related papers

Certified randomness in quantum physics

Antonio Acín, Lluís Masanes

arXiv:1708.00265•Nature•Dec 1, 2016•301 citations

Certified Randomness with Optimal Rate

Siddhartha Jain, Saachi Mutreja, Bhaskar Roberts

The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle model (QROM). This improves the result of Coladangelo et al., who certified weakly random strings unconditionally in the QROM, and answers a question posed by Aaronson and Hung. We also define and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript. We show an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages.

quant-pharXiv:2609.38945•Oct 1, 2026•0 citations

Universal randomness

Виктор Степанович Доценко

Uspekhi Fizicheskih Nauk•Jan 1, 2011•2 citations

On the equivalence between classically verifiable position verification and certified randomness

Fatih Kaleoglu, Minzhao Liu, David Cui +4 more

Gate-based quantum computers can accelerate computational tasks beyond classical capabilities. Random circuit sampling is a task that has experimentally demonstrated algorithmic quantum advantage on near-term devices, but its practical utility has been limited. Recently, certified randomness generation based on random circuits was demonstrated on a trapped-ion quantum computer, advancing near-term applications. In this work, we connect single-device certified randomness to classically verifiable position verification, a classical communication primitive that avoids long-distance quantum communication challenges. We present a generic compiler that converts any such certified randomness protocol into a secure classically verifiable position verification scheme, extend it to multi-round protocols, and show its equivalence to a relaxed certified randomness variant. Our near-term instantiation based on random circuit sampling demonstrates classically verifiable position verification as a practical application for near-term devices. This article establishes a connection between single-device certified randomness and classically verifiable position verification. Through this connection, it shows that the latter can be implemented using noisy intermediate-scale quantum devices.

Nature Communications•Apr 15, 2026•0 citations

Certified quantum randomness

Pironio

Conference on Lasers and Electro-Optics•Jan 1, 2012•0 citations

All entangled states can generate certified randomness

Xing Chen

Random number has many applications, it plays an important role in quantum information processing. It's not difficult to generate true random numbers, the main difficulty is how to certify the random numbers generated by untrusted devices. In [Nature(London) 464, 1021 (2010)], the authors provided us a way to generate certified random number by Bell's theorem. In their scheme, we can use the nonlocal behavior of entangled states to generate certified randomness. But there are entangled states, which admit a local hidden variable model, could not be used in their scheme. We show in our paper that the nonlocal correlations in every entangled state can be used to generate certified randomness, and we use Werner states as an example to show how to quantify the output randomness.

arXiv:1706.03528•Jun 12, 2017•0 citations
The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle model (QROM). This improves the result of Coladangelo et al., who certified weakly random strings unconditionally in the QROM, and answers a question posed by Aaronson and Hung. We also define and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript. We show an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages.
Gate-based quantum computers can accelerate computational tasks beyond classical capabilities. Random circuit sampling is a task that has experimentally demonstrated algorithmic quantum advantage on near-term devices, but its practical utility has been limited. Recently, certified randomness generation based on random circuits was demonstrated on a trapped-ion quantum computer, advancing near-term applications. In this work, we connect single-device certified randomness to classically verifiable position verification, a classical communication primitive that avoids long-distance quantum communication challenges. We present a generic compiler that converts any such certified randomness protocol into a secure classically verifiable position verification scheme, extend it to multi-round protocols, and show its equivalence to a relaxed certified randomness variant. Our near-term instantiation based on random circuit sampling demonstrates classically verifiable position verification as a practical application for near-term devices. This article establishes a connection between single-device certified randomness and classically verifiable position verification. Through this connection, it shows that the latter can be implemented using noisy intermediate-scale quantum devices.
Random number has many applications, it plays an important role in quantum information processing. It's not difficult to generate true random numbers, the main difficulty is how to certify the random numbers generated by untrusted devices. In [Nature(London) 464, 1021 (2010)], the authors provided us a way to generate certified random number by Bell's theorem. In their scheme, we can use the nonlocal behavior of entangled states to generate certified randomness. But there are entangled states, which admit a local hidden variable model, could not be used in their scheme. We show in our paper that the nonlocal correlations in every entangled state can be used to generate certified randomness, and we use Werner states as an example to show how to quantify the output randomness.