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:2607.27025

Quantum random-number generator with non-demolition measurements: semi-device-independent implementation

Paolo Solinas, Giovanni Chesi

quant-phSubmitted Jul 29, 2026• Announced Jul 30, 2026• 0 citations• Revised Aug 6, 2026 (v2)
v1 · Jul 29, 2026v2 · Aug 6, 2026
arXivHTMLPDF

Abstract

We propose and analyze a novel quantum random-number generator based on a tripartite quantum system in which two subsystems act as detectors. Within a quantum non-demolition measurement scheme, one detector is used to certify the presence of genuine quantum effects in the system's evolution, while the second generates random numbers from a distribution that can be optimized to maximize their entropy. Using one two-level system and two three-level systems, we generate random numbers from a nearly uniform three-outcome distribution, yielding close-to-maximal entropy and therefore near-optimal randomness generation. A key feature of the protocol is that randomness generation and certification occur simultaneously. Moreover, certification does not rely on spacelike separation between detectors, removing a major constraint of device-independent approaches. This property enables practical implementation and facilitates the miniaturization of the device, making the protocol a promising candidate for scalable quantum technologies.

Comments
14 pages, 2 figures

Related papers

Semi-device independent randomness generation based on quantum state’s indistinguishability

Hamid Tebyanian, Mujtaba Zahidy, Marco Avesani +3 more

Abstract Semi-device independent (Semi-DI) quantum random number generators (QRNGs) gained attention for security applications, offering an excellent trade-off between security and generation rate. This paper presents a proof-of-principle time-bin encoding semi-DI QRNG experiments based on a prepare-and-measure scheme. The protocol requires two simple assumptions and a measurable condition: an upper-bound on the prepared pulses’ energy. We lower-bound the conditional min-entropy from the energy-bound and the input–output correlation, determining the amount of genuine randomness that can be certified. Moreover, we present a generalized optimization problem for bounding the min-entropy in the case of multiple input and outcomes, in the form of a semidefinite program. The protocol is tested with a simple experimental setup, capable of realizing two configurations for the ternary time-bin encoding scheme. The experimental setup is easy-to-implement and comprises commercially available off-the-shelf components at the telecom wavelength, granting a secure and certifiable entropy source. The combination of ease-of-implementation, scalability, high security level and output-entropy, make our system a promising candidate for commercial QRNGs.

arXiv:2104.11137•Quantum Science and Technology•Aug 23, 2021•38 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

Semi-device-independent randomness certification using n→1 quantum random access codes

Hong-Wei Li, Marcin Pawłowski, Zhen−Qiang Yin +2 more

We study random-number-expansion protocols based on the $n\ensuremath{\rightarrow}1$ quantum random access codes (QRACs). We consider them in the semi-device-independent scenario where the inner workings of the devices are unknown to us but we can certify the dimensions of the systems being communicated. This approach does not require the use of entanglement and makes the physical realization of these protocols much easier than in the standard device-independent scenario. In our work, we propose a protocol for randomness expansion, compute min-entropy for the semi-device-independent protocol, and investigate $n\ensuremath{\rightarrow}1$ QRACs with a view to their use in randomness-expansion protocols. We also calculate the dependence of the effectiveness of the randomness generation on $n$ and find it optimal for $n=3$, and provide the explanation for this fact.

arXiv:1109.5259•Physical Review A•May 11, 2012•111 citations

Certification of randomness without seed randomness

Shubhayan Sarkar

The security of any cryptographic scheme relies on access to random number generators. Device-independently certified random number generators provide maximum security as one can discard the presence of an intruder by considering only the statistics generated by these devices. Any of the known device-independent schemes to certify randomness require an initial feed of randomness into the devices, which can be called seed randomness. In this work, we propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness. For our purpose, we utilise the framework of quantum networks with no inputs and two independent sources shared among two parties with one of them being trusted. Along with it, we also certify the maximally entangled state and the Bell basis measurement with the untrusted party which is then used to certify the randomness generated from the untrusted device.

arXiv:2307.11492•Jul 21, 2023•0 citations

Novel Certification Method for Quantum Random Number Generators

Maksim Iavich, Tamari Kuchukhidze, Sergiy O. Gnatyuk +1 more

Random numbers have many uses, but finding true randomness is incredibly difficult. Therefore, quantum mechanics is used, using the essentially unpredictable behavior of a photon, to generate truly random numbers that form the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the performance of our device and the quality of the random bits generated. Self-testing as well as device independent quantum random number generation methods are analyzed in the paper. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. The method is very important for computer science, because it combines the best features from selftesting and device independent methods. It can be used, when the random numbers’ entropy depends on the device and when it does not. In the related researches, these approaches are offered to be used separately, depending on the random number generator. The offered novel certification technology can be properly used, when the device is compromised or spoiled. The technology can successfully detect unintended irregularities, operational problems, abnormalities and problems in the randomization process. The offered mythology assists to eliminate problems related to physical devices. The offered system has the higher certification randomness security and is faster than self-testing approaches. The method is rather efficient because it implements the different certification approaches in the parallel threads. The offered techniques make the offered research must more efficient than the other existing approaches. The corresponding programming simulation is implemented by means of the simulation techniques.

International Journal of Computer Network and Information Security•Jun 8, 2021•7 citations

Semi-Device-Independent Quantum Random Number Generator Resistant to General Attacks

Zhenguo Lu, Jundong Wu, Yu Zhang +4 more

Quantum random number generators (QRNGs) produce true random numbers based on the inherent randomness of quantum theory, rendering them a foundational segment of quantum cryptography. Distinguished from trusted-device QRNGs whose security depends on characterized devices, semi-device-independent (semi-DI) QRNGs permit partial devices to be defective or even maliciously manipulated, which achieves a good trade-off between generation rate and security. In this paper, we propose a semi-DI QRNG that resists general attacks while accounting for finite-size effects. The protocol requires no rigorous characterization of the source and measurement devices other than limiting the energy of the emitted states, significantly reducing the demands on practical QRNG systems. Leveraging the tight Kato inequality for correlated variables, we show that our protocol generates more randomness than it consumes. Furthermore, we demonstrate the scheme on a continuous-variable system with ternary inputs of states. Heterodyne detection is employed to enable phase compensation through data postprocessing, alleviating the stringent requirement on system stability. The system operates at 100 MHz, achieving a net random number generation rate of 1.165 Mbps at 5.3x10^9 rounds. Our work offers a promising approach to achieve both the robust security and high generation rate with a simple experimental setup.

quant-pharXiv:2602.06362•Feb 9, 2026•0 citations
We propose and analyze a novel quantum random-number generator based on a tripartite quantum system in which two subsystems act as detectors. Within a quantum non-demolition measurement scheme, one detector is used to certify the presence of genuine quantum effects in the system's evolution, while the second generates random numbers from a distribution that can be optimized to maximize their entropy. Using one two-level system and two three-level systems, we generate random numbers from a nearly uniform three-outcome distribution, yielding close-to-maximal entropy and therefore near-optimal randomness generation. A key feature of the protocol is that randomness generation and certification occur simultaneously. Moreover, certification does not rely on spacelike separation between detectors, removing a major constraint of device-independent approaches. This property enables practical implementation and facilitates the miniaturization of the device, making the protocol a promising candidate for scalable quantum technologies.
Abstract Semi-device independent (Semi-DI) quantum random number generators (QRNGs) gained attention for security applications, offering an excellent trade-off between security and generation rate. This paper presents a proof-of-principle time-bin encoding semi-DI QRNG experiments based on a prepare-and-measure scheme. The protocol requires two simple assumptions and a measurable condition: an upper-bound on the prepared pulses’ energy. We lower-bound the conditional min-entropy from the energy-bound and the input–output correlation, determining the amount of genuine randomness that can be certified. Moreover, we present a generalized optimization problem for bounding the min-entropy in the case of multiple input and outcomes, in the form of a semidefinite program. The protocol is tested with a simple experimental setup, capable of realizing two configurations for the ternary time-bin encoding scheme. The experimental setup is easy-to-implement and comprises commercially available off-the-shelf components at the telecom wavelength, granting a secure and certifiable entropy source. The combination of ease-of-implementation, scalability, high security level and output-entropy, make our system a promising candidate for commercial QRNGs.
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.
We study random-number-expansion protocols based on the $n\ensuremath{\rightarrow}1$ quantum random access codes (QRACs). We consider them in the semi-device-independent scenario where the inner workings of the devices are unknown to us but we can certify the dimensions of the systems being communicated. This approach does not require the use of entanglement and makes the physical realization of these protocols much easier than in the standard device-independent scenario. In our work, we propose a protocol for randomness expansion, compute min-entropy for the semi-device-independent protocol, and investigate $n\ensuremath{\rightarrow}1$ QRACs with a view to their use in randomness-expansion protocols. We also calculate the dependence of the effectiveness of the randomness generation on nnn and find it optimal for n=3n=3n=3, and provide the explanation for this fact.
The security of any cryptographic scheme relies on access to random number generators. Device-independently certified random number generators provide maximum security as one can discard the presence of an intruder by considering only the statistics generated by these devices. Any of the known device-independent schemes to certify randomness require an initial feed of randomness into the devices, which can be called seed randomness. In this work, we propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness. For our purpose, we utilise the framework of quantum networks with no inputs and two independent sources shared among two parties with one of them being trusted. Along with it, we also certify the maximally entangled state and the Bell basis measurement with the untrusted party which is then used to certify the randomness generated from the untrusted device.
Random numbers have many uses, but finding true randomness is incredibly difficult. Therefore, quantum mechanics is used, using the essentially unpredictable behavior of a photon, to generate truly random numbers that form the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the performance of our device and the quality of the random bits generated. Self-testing as well as device independent quantum random number generation methods are analyzed in the paper. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. The method is very important for computer science, because it combines the best features from selftesting and device independent methods. It can be used, when the random numbers’ entropy depends on the device and when it does not. In the related researches, these approaches are offered to be used separately, depending on the random number generator. The offered novel certification technology can be properly used, when the device is compromised or spoiled. The technology can successfully detect unintended irregularities, operational problems, abnormalities and problems in the randomization process. The offered mythology assists to eliminate problems related to physical devices. The offered system has the higher certification randomness security and is faster than self-testing approaches. The method is rather efficient because it implements the different certification approaches in the parallel threads. The offered techniques make the offered research must more efficient than the other existing approaches. The corresponding programming simulation is implemented by means of the simulation techniques.
Quantum random number generators (QRNGs) produce true random numbers based on the inherent randomness of quantum theory, rendering them a foundational segment of quantum cryptography. Distinguished from trusted-device QRNGs whose security depends on characterized devices, semi-device-independent (semi-DI) QRNGs permit partial devices to be defective or even maliciously manipulated, which achieves a good trade-off between generation rate and security. In this paper, we propose a semi-DI QRNG that resists general attacks while accounting for finite-size effects. The protocol requires no rigorous characterization of the source and measurement devices other than limiting the energy of the emitted states, significantly reducing the demands on practical QRNG systems. Leveraging the tight Kato inequality for correlated variables, we show that our protocol generates more randomness than it consumes. Furthermore, we demonstrate the scheme on a continuous-variable system with ternary inputs of states. Heterodyne detection is employed to enable phase compensation through data postprocessing, alleviating the stringent requirement on system stability. The system operates at 100 MHz, achieving a net random number generation rate of 1.165 Mbps at 5.3x10^9 rounds. Our work offers a promising approach to achieve both the robust security and high generation rate with a simple experimental setup.