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:2010.05798 · Communications Physics

Unbounded randomness from uncharacterized sources

Marco Avesani, Hamid Tebyanian, Paolo Villoresi, Giuseppe Vallone

Published Nov 5, 2022• 19 citations
arXivHTMLPDF

Abstract

Abstract Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective measurements, and its amount is bounded by the quantum system’s dimension. Here, we propose a Source-Device-Independent protocol, based on Positive Operator Valued Measurement (POVM), which can arbitrarily increase the number of certified bits for any fixed dimension. Additionally, the proposed protocol doesn’t require an initial seed and active basis switching, simplifying its experimental implementation and increasing the generation rates. A tight lower-bound on the quantum conditional min-entropy is derived using only the POVM structure and the experimental expectation values, taking into account the quantum side-information. For symmetric POVM on the Bloch sphere, we derive closed-form analytical bounds. Finally, we experimentally demonstrate our method with a compact and simple photonic setup that employs polarization-encoded qubits and POVM up to 6 outcomes.

DOI
10.1038/s42005-022-01038-3

Related papers

Certified Randomness From Steering Using Sequential Measurements

Brian Coyle, Elham Kashefi, Matty J. Hoban

The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, i.e., we do not need to make assumptions about the devices used. Due to the work of Curchod et al. a single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness. However, the obtaining of this randomness is experimentally challenging as it requires a large number of measurements, both projective and general. Motivated by these difficulties in the device-independent setting, we instead consider the scenario of one-sided device independence where certain devices are trusted, and others are not; a scenario motivated by asymmetric experimental set-ups such as ion-photon networks. We show how certain aspects of previous works can be adapted to this scenario and provide theoretical bounds on the amount of randomness that can be certified. Furthermore, we give a protocol for unbounded randomness certification in this scenario, and provide numerical results demonstrating the protocol in the ideal case. Finally, we numerically test the possibility of implementing this scheme on near-term quantum technologies, by considering the performance of the protocol on several physical platforms.

arXiv:2008.00705•Cryptography•Dec 6, 2019•4 citations

Certified Randomness From Steering Using Sequential Measurements

Brian Coyle, Elham Kashefi, Matty J. Hoban

The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, ie, we do not need to make assumptions about the devices used. Due to the work of Curchod et al. a single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness. However, the obtaining of this randomness is experimentally challenging as it requires a large number of measurements, both projective and general. Motivated by these difficulties in the device-independent setting, we instead consider the scenario of one-sided device independence where certain devices are trusted, and others are not; a scenario motivated by asymmetric experimental set-ups such as ion-photon networks. We show how certain aspects of previous works can be adapted to this scenario and provide theoretical bounds on the amount of randomness that can be certified. Furthermore, we give a protocol for unbounded randomness certification in this scenario, and provide numerical results demonstrating the protocol in the ideal case. Finally, we numerically test the possibility of implementing this scheme on near-term quantum technologies, by considering the performance of the protocol on several physical platforms.

•Dec 6, 2019•3 citations

Squeezed-state semi-device-independent quantum randomness generation

Hamid Tebyanian

This paper investigates semi-device-independent quantum randomness generation with a trusted binary pure-state source and an untrusted binary detector whose side information is classical. We derive a closed-form Shannon-rate expression for this setting, depending only on the trusted Gram overlap of the two source states and the observed symmetric error probability. The key point is that the full binary-qubit POVM optimisation must include the two deterministic extreme points omitted by the projective-only treatment; including them gives a substantially lower, and correct, certified rate. The closed form is an unconditional upper bound on the certified asymptotic i.i.d.\ Shannon rate, and becomes tight on a numerically verified dual-feasibility region containing all operating points used in the paper. Outside this region the same expression remains an upper bound. We then apply the result to squeezed-coherent BPSK sources, showing how squeezing changes the trade-off between state distinguishability and certified randomness in the lossless and lossy regimes. Finally, we clarify the adversary model if the adversary is allowed to hold a detector-purification register that tags the outcome.

quant-pharXiv:2606.03898•Advanced Quantum Technologies•Jun 3, 2026•0 citations

Self-Testing Positive Operator-Valued Measurements and Certifying Randomness

Wenjie Wang, Mingjing Li, Fen-Zhuo Guo +2 more

In the device-independent scenario, positive operator-valued measurements (POVMs) can certify more randomness than projective measurements. This paper self-tests a three-outcome extremal qubit POVM in the X-Z plane of the Bloch sphere by achieving the maximal quantum violation of a newly constructed Bell expression C'3, adapted from the chained inequality C3. Using this POVM, approximately 1.58 bits of local randomness can be certified, which is the maximum amount of local randomness achievable by an extremal qubit POVM in this plane. Further modifications of C'3 produce C''3, enabling the self-testing of another three-outcome extremal qubit POVM. Together, these POVMs certify about 2.27 bits of global randomness. Both local and global randomness surpass the limitations certified from projective measurements. Additionally, the Navascués-Pironio-Acín hierarchy is employed to compare the lower bounds on global randomness certified by C3 and several other inequalities. As the extent of violation increases, C3 demonstrates superior performance in randomness certification.

arXiv:2412.11714•Dec 16, 2024•0 citations

Continuous-Variable Source-Independent Quantum Random Number Generation with General POVMs

Hongyi Zhou, Yu Han, Qiechun Chen +1 more

Continuous-variable source-independent quantum random number generators offer the highest generation rates among semi-device-independent protocols. In reality, the protocol design is limited due to permissible measurement configurations. In this work, we propose a rigorous security proof framework that accommodates general, infinite-dimensional positive-operator-valued measures. Building upon the numerical security proof framework, we evaluate the randomness lower bound by maximizing the eavesdropper's guessing probability. Specifically, we transform the inherently infinite-dimensional semidefinite program in Fock space into a tractable finite-dimensional one, rigorously proving that latter provides a strict upper bound to the guessing probability of the original infinite-dimensional problem. Our framework showcases its capability by certifying secure randomness using unbalanced homodyne detection with only a single quadrature measurement, thereby bypassing the traditional requirement of measuring two conjugate quadratures such as $X$ and $P$. 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 and an ultra-high generation rate of 1.776 Gbps. This work provides a flexible design for practical, high-speed quantum random number generators.

quant-pharXiv:2606.31027•Jul 1, 2026•0 citations

More Than One-bit Quantum Randomness Certification and Expansion

Amélie Piveteau, Alban Seguinard, Marcus Grünfeld +4 more

One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 citations
Abstract Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective measurements, and its amount is bounded by the quantum system’s dimension. Here, we propose a Source-Device-Independent protocol, based on Positive Operator Valued Measurement (POVM), which can arbitrarily increase the number of certified bits for any fixed dimension. Additionally, the proposed protocol doesn’t require an initial seed and active basis switching, simplifying its experimental implementation and increasing the generation rates. A tight lower-bound on the quantum conditional min-entropy is derived using only the POVM structure and the experimental expectation values, taking into account the quantum side-information. For symmetric POVM on the Bloch sphere, we derive closed-form analytical bounds. Finally, we experimentally demonstrate our method with a compact and simple photonic setup that employs polarization-encoded qubits and POVM up to 6 outcomes.
The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, i.e., we do not need to make assumptions about the devices used. Due to the work of Curchod et al. a single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness. However, the obtaining of this randomness is experimentally challenging as it requires a large number of measurements, both projective and general. Motivated by these difficulties in the device-independent setting, we instead consider the scenario of one-sided device independence where certain devices are trusted, and others are not; a scenario motivated by asymmetric experimental set-ups such as ion-photon networks. We show how certain aspects of previous works can be adapted to this scenario and provide theoretical bounds on the amount of randomness that can be certified. Furthermore, we give a protocol for unbounded randomness certification in this scenario, and provide numerical results demonstrating the protocol in the ideal case. Finally, we numerically test the possibility of implementing this scheme on near-term quantum technologies, by considering the performance of the protocol on several physical platforms.
The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, ie, we do not need to make assumptions about the devices used. Due to the work of Curchod et al. a single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness. However, the obtaining of this randomness is experimentally challenging as it requires a large number of measurements, both projective and general. Motivated by these difficulties in the device-independent setting, we instead consider the scenario of one-sided device independence where certain devices are trusted, and others are not; a scenario motivated by asymmetric experimental set-ups such as ion-photon networks. We show how certain aspects of previous works can be adapted to this scenario and provide theoretical bounds on the amount of randomness that can be certified. Furthermore, we give a protocol for unbounded randomness certification in this scenario, and provide numerical results demonstrating the protocol in the ideal case. Finally, we numerically test the possibility of implementing this scheme on near-term quantum technologies, by considering the performance of the protocol on several physical platforms.
This paper investigates semi-device-independent quantum randomness generation with a trusted binary pure-state source and an untrusted binary detector whose side information is classical. We derive a closed-form Shannon-rate expression for this setting, depending only on the trusted Gram overlap of the two source states and the observed symmetric error probability. The key point is that the full binary-qubit POVM optimisation must include the two deterministic extreme points omitted by the projective-only treatment; including them gives a substantially lower, and correct, certified rate. The closed form is an unconditional upper bound on the certified asymptotic i.i.d.\ Shannon rate, and becomes tight on a numerically verified dual-feasibility region containing all operating points used in the paper. Outside this region the same expression remains an upper bound. We then apply the result to squeezed-coherent BPSK sources, showing how squeezing changes the trade-off between state distinguishability and certified randomness in the lossless and lossy regimes. Finally, we clarify the adversary model if the adversary is allowed to hold a detector-purification register that tags the outcome.
In the device-independent scenario, positive operator-valued measurements (POVMs) can certify more randomness than projective measurements. This paper self-tests a three-outcome extremal qubit POVM in the X-Z plane of the Bloch sphere by achieving the maximal quantum violation of a newly constructed Bell expression C'3, adapted from the chained inequality C3. Using this POVM, approximately 1.58 bits of local randomness can be certified, which is the maximum amount of local randomness achievable by an extremal qubit POVM in this plane. Further modifications of C'3 produce C''3, enabling the self-testing of another three-outcome extremal qubit POVM. Together, these POVMs certify about 2.27 bits of global randomness. Both local and global randomness surpass the limitations certified from projective measurements. Additionally, the Navascués-Pironio-Acín hierarchy is employed to compare the lower bounds on global randomness certified by C3 and several other inequalities. As the extent of violation increases, C3 demonstrates superior performance in randomness certification.
Continuous-variable source-independent quantum random number generators offer the highest generation rates among semi-device-independent protocols. In reality, the protocol design is limited due to permissible measurement configurations. In this work, we propose a rigorous security proof framework that accommodates general, infinite-dimensional positive-operator-valued measures. Building upon the numerical security proof framework, we evaluate the randomness lower bound by maximizing the eavesdropper's guessing probability. Specifically, we transform the inherently infinite-dimensional semidefinite program in Fock space into a tractable finite-dimensional one, rigorously proving that latter provides a strict upper bound to the guessing probability of the original infinite-dimensional problem. Our framework showcases its capability by certifying secure randomness using unbalanced homodyne detection with only a single quadrature measurement, thereby bypassing the traditional requirement of measuring two conjugate quadratures such as XXX and PPP. 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 and an ultra-high generation rate of 1.776 Gbps. This work provides a flexible design for practical, high-speed quantum random number generators.
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.