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

Scientific Reports

Tighter bound of quantum randomness certification for independent-devices scenario

Xin-Wei Fei, Zhen−Qiang Yin, Wei Huang, Bingjie Xu, Shuang Wang, Wei Chen, Yun-Guang Han, Guang‐Can Guo, Zheng‐Fu Han

Published Nov 1, 2017• 6 citations
Publisher

Abstract

Quantum random number generation attracts considerable attention, since its randomness inherently originates in quantum mechanics, but not mathematical assumptions. Randomness certification, e.g. entropy estimation, becomes a key issue in the context of quantum random number generation protocol. We study a self-testing protocol based on dimension witness, with the assumption of independent devices. It addresses the random number extraction problem in a practical prepare-and-measure scenario with uncharacterized devices. However, the lower bound of min-entropy as a function of dimension witness is not tight in existing works. We present a tighter bound of analytic form, by introducing the Lagrangian multiplier method to closely analyze the optimization problem on average guessing probability. Through simulation, it turns out that a significantly higher random number generation rate can be achieved in practice.

DOI
10.1038/s41598-017-15318-4

Related papers

Optimality of quantum randomness certification with independent devices

Xin-Wei Fei, Zhen−Qiang Yin, Chaohan Cui +7 more

Quantum random number generators (QRNGs) play an increasingly important role in cryptography systems. Specifically, QRNG performed in prepare-and-measure scenarios with independent devices has attracted intensive study, since it can be intrinsically loss tolerant and its assumptions on devices seem to be quite natural. However, the estimations of min-entropy given in previous works are not optimal. As a result, the performance of quantum randomness certification in practice is still severely depressed. Here, we present a novel method to estimate the min-entropy through developing a reduced device model and proving its equivalence to the original one. Benefitting from this reduction, we can solve the min-entropy estimation problem using mixed integer programming effectively. Furthermore, we derive an optimal bound of analytic form in the case that constraints are made up of symmetric observed probabilities. Simulation results show that our work gives an optimal solution in this case and brings a significant performance improvement compared to previous works.

Journal of the Optical Society of America B•Aug 17, 2018•3 citations

More randomness from a prepare-and-measure scenario with independent devices

Yun-Guang Han, Zhen−Qiang Yin, Hong-Wei Li +4 more

How to generate genuine quantum randomness from untrusted devices is an important problem in quantum information processing. Inspired by previous work on a self-testing quantum random number generator [T. Lunghi et al., Phys. Rev. Lett. 114, 150501 (2015)], we present a method to generate quantum randomness from a prepare-and-measure scenario with independent devices. In existing protocols, the quantum randomness depends only on a witness value (e.g., Clauser-Horne-Shimony-Holt value), which is calculated with the observed probabilities. Differently, here all the observed probabilities are directly used to calculate the min-entropy in our method. Through numerical simulation, we find that the min-entropy of our proposed scheme is higher than that in the previous work when a typical untrusted Bennett-Brassard 1984 (BB84) setup is used. Consequently, thanks to the proposed method, more genuine quantum random numbers may be obtained than before.

arXiv:1604.01915•Physical Review A•Mar 22, 2016•9 citations

Bounds on semi-device-independent quantum random-number expansion capabilities

Vaisakh Mannalath, Anirban Pathak

The randomness expansion capabilities of semi-device-independent (SDI) prepare and measure protocols are analyzed under the sole assumption that the Hilbert state dimension is known. It is explicitly proved that the maximum certifiable entropy that can be obtained through this set of protocols is $\ensuremath{-}{log}_{2}[\frac{1}{2}(1+\frac{1}{\sqrt{3}})]$ and the same is independent of the dimension witnesses used to certify the protocol. The minimum number of preparation and measurement settings required to achieve this entropy is also proven. An SDI protocol that generates the maximum output entropy with the least amount of input setting is provided. An analytical relationship between the entropy generated and the witness value is obtained. It is also established that certifiable entropy can be generated as soon as the dimension witness crosses the classical bound, making the protocol noise-robust and useful in practical applications.

arXiv:2111.14082•Physical Review A•Feb 23, 2022•8 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

Device-independent Shannon entropy certification

Robert Okuła, Piotr Mironowicz

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.

arXiv:2505.05395•New Journal of Physics•Nov 1, 2025•1 citation

Deterministic randomness extraction for quantum random number generation with partial trust

Pablo Tikas Pueyo, Tomás Fernández Martos, Gabriel Senno

It is a well-known fact in classical information theory that no deterministic procedure can extract close-to-ideal randomness from an arbitrary entropy source. On the other hand, if additional knowledge about the source is available -- e.g., that it is a sequence of independent Bernoulli trials -- then deterministic extractors do exist. For quantum entropy sources, where in addition to classical random variables we consider quantum side information, the use of extra knowledge about their structure was pioneered in a recent publication [C. Foreman and L. Masanes, Quantum 9, 1654 (2025)]. In that work, the authors provide deterministic extractors for device-independent randomness generation with memoryless devices achieving a sufficiently high CHSH score. In this work, we port their construction to the prepare-and-measure scenario. Specifically, we prove that the considered functions are also extractors for memoryless devices in settings with partial trust, either in the state preparation or in the measurement, as well as in a semi-device-independent setting under an overlap assumption on the prepared quantum states. Within this last setting, we simulate the resulting randomness generation protocol on a novel and experimentally relevant family of behaviors, observing positive key rates already for $7\times 10^3$ rounds.

quant-pharXiv:2512.08900•Dec 10, 2025•0 citations
Quantum random number generation attracts considerable attention, since its randomness inherently originates in quantum mechanics, but not mathematical assumptions. Randomness certification, e.g. entropy estimation, becomes a key issue in the context of quantum random number generation protocol. We study a self-testing protocol based on dimension witness, with the assumption of independent devices. It addresses the random number extraction problem in a practical prepare-and-measure scenario with uncharacterized devices. However, the lower bound of min-entropy as a function of dimension witness is not tight in existing works. We present a tighter bound of analytic form, by introducing the Lagrangian multiplier method to closely analyze the optimization problem on average guessing probability. Through simulation, it turns out that a significantly higher random number generation rate can be achieved in practice.
Quantum random number generators (QRNGs) play an increasingly important role in cryptography systems. Specifically, QRNG performed in prepare-and-measure scenarios with independent devices has attracted intensive study, since it can be intrinsically loss tolerant and its assumptions on devices seem to be quite natural. However, the estimations of min-entropy given in previous works are not optimal. As a result, the performance of quantum randomness certification in practice is still severely depressed. Here, we present a novel method to estimate the min-entropy through developing a reduced device model and proving its equivalence to the original one. Benefitting from this reduction, we can solve the min-entropy estimation problem using mixed integer programming effectively. Furthermore, we derive an optimal bound of analytic form in the case that constraints are made up of symmetric observed probabilities. Simulation results show that our work gives an optimal solution in this case and brings a significant performance improvement compared to previous works.
How to generate genuine quantum randomness from untrusted devices is an important problem in quantum information processing. Inspired by previous work on a self-testing quantum random number generator [T. Lunghi et al., Phys. Rev. Lett. 114, 150501 (2015)], we present a method to generate quantum randomness from a prepare-and-measure scenario with independent devices. In existing protocols, the quantum randomness depends only on a witness value (e.g., Clauser-Horne-Shimony-Holt value), which is calculated with the observed probabilities. Differently, here all the observed probabilities are directly used to calculate the min-entropy in our method. Through numerical simulation, we find that the min-entropy of our proposed scheme is higher than that in the previous work when a typical untrusted Bennett-Brassard 1984 (BB84) setup is used. Consequently, thanks to the proposed method, more genuine quantum random numbers may be obtained than before.
The randomness expansion capabilities of semi-device-independent (SDI) prepare and measure protocols are analyzed under the sole assumption that the Hilbert state dimension is known. It is explicitly proved that the maximum certifiable entropy that can be obtained through this set of protocols is $\ensuremath{-}{log}_{2}[\frac{1}{2}(1+\frac{1}{\sqrt{3}})]$ and the same is independent of the dimension witnesses used to certify the protocol. The minimum number of preparation and measurement settings required to achieve this entropy is also proven. An SDI protocol that generates the maximum output entropy with the least amount of input setting is provided. An analytical relationship between the entropy generated and the witness value is obtained. It is also established that certifiable entropy can be generated as soon as the dimension witness crosses the classical bound, making the protocol noise-robust and useful in practical applications.
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.
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.
It is a well-known fact in classical information theory that no deterministic procedure can extract close-to-ideal randomness from an arbitrary entropy source. On the other hand, if additional knowledge about the source is available -- e.g., that it is a sequence of independent Bernoulli trials -- then deterministic extractors do exist. For quantum entropy sources, where in addition to classical random variables we consider quantum side information, the use of extra knowledge about their structure was pioneered in a recent publication [C. Foreman and L. Masanes, Quantum 9, 1654 (2025)]. In that work, the authors provide deterministic extractors for device-independent randomness generation with memoryless devices achieving a sufficiently high CHSH score. In this work, we port their construction to the prepare-and-measure scenario. Specifically, we prove that the considered functions are also extractors for memoryless devices in settings with partial trust, either in the state preparation or in the measurement, as well as in a semi-device-independent setting under an overlap assumption on the prepared quantum states. Within this last setting, we simulate the resulting randomness generation protocol on a novel and experimentally relevant family of behaviors, observing positive key rates already for 7×1037\times 10^37×103 rounds.