© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1511.05791 · New Journal of Physics

Increased certification of semi-device independent random numbers using many inputs and more post-processing

Piotr Mironowicz, Armin Tavakoli, Alley Hameedi, Breno Marques, Marcin Pawłowski, Mohamed Bourennane

Published Jun 3, 2016• 17 citations

Abstract

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the post-processing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today's computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.

DOI: 10.1088/1367-2630/18/6/065004

Related papers

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

Semi-device-independent randomness certification on discretized continuous-variable platforms

Moisés Alves, Vitor L. Sena, Santiago Zamora +4 more

Randomness is fundamental for secure communication and information processing. While continuous-variable optical systems offer an attractive platform for this task, certifying genuine quantum randomness in such setups remains challenging. We present a semi-device-independent scheme for randomness certification tailored to continuous-variable implementations, where the dimension assumption is operationally implemented by restricting state preparations to the two-level Fock subspace. Using standard homodyne and displacement-based measurements, we show that simple optical setups can achieve dimension-witness violations that certify positive min-entropy, even in the presence of realistic losses and misaligned reference frames. These results demonstrate that practical and scalable quantum randomness generation is achievable with minimal experimental complexity on continuous-variable platforms.

quant-pharXiv:2511.05672•Physical Review A•Nov 11, 2025•2 citations

Semi-device-independent randomness expansion with partially free random sources using 3→1 quantum random access code

Yuqian Zhou, Fei Gao, Dandan Li +2 more

We have proved that new randomness can be certified by partially free sources using $2\ensuremath{\rightarrow}1$ quantum random access code (QRAC) in the framework of semi-device-independent (SDI) protocols [Y.-Q. Zhou, H.-W. Li, Y.-K. Wang, D.-D. Li, F. Gao, and Q.-Y. Wen, Phys. Rev. A 92, 022331 (2015)]. To improve the effectiveness of the randomness generation, here we propose the SDI randomness expansion using $3\ensuremath{\rightarrow}1$ QRAC and obtain the corresponding classical and quantum bounds of the two-dimensional quantum witness. Moreover, we get the condition which should be satisfied by the partially free sources to successfully certify new randomness, and the analytic relationship between the certified randomness and the two-dimensional quantum witness violation.

Physical Review A•Sep 19, 2016•14 citations

Semi-Device-Independent Randomness Expansion Using n→1 Parity-Oblivious Quantum Random Access Codes

Xunan Wang, Xu Chen, Mengke Xu +2 more

Quantum mechanics enables the generation of genuine randomness through its intrinsic indeterminacy. In device-independent (DI) and semi-device-independent (SDI) frameworks, randomness generation protocols can further ensure that the output remains secure and unaffected by internal device imperfections, with certification grounded in violations of generalized Bell inequalities. In this work, we propose an SDI randomness expansion protocol using n→1 parity-oblivious quantum random access code (PO-QRAC), where the presence of true quantum randomness is certified through the violation of a two-dimensional quantum witness. For various values of n, we derive the corresponding maximal expected success probabilities. Notably, for n=4, the expected success probability obtained under our protocol exceeds the upper bound reported in prior work. Furthermore, we establish an analytic relationship between the certifiable min-entropy and the quantum witness value, and demonstrate that, for a fixed witness value, PO-QRAC–based protocols certify more randomness than those based on standard QRACs. Among all configurations satisfying the parity-obliviousness constraint, the protocol based on the 3→1 PO-QRAC achieves optimal randomness expansion performance.

Entropy•Jun 28, 2025•0 citations

Sequential semi-device-independent quantum randomness certification

Carles Roch i Carceller, Hanwool Lee, Jonatan Bohr Brask +2 more

Quantum measurements under realistic conditions reveal only partial information about a system. Yet, by performing sequential measurements on the same system, additional information can be accessed. We investigate this problem in the context of semi-device-independent randomness certification using sequential maximum-confidence measurements. We develop a general framework and versatile numerical methods to bound the amount of certifiable randomness in such scenarios. We further introduce a technique to compute min-tradeoff functions via semidefinite programming duality, thus making the framework suitable for bounding the certifiable randomness against adaptive attacking strategies through entropy accumulation. Our results establish sufficient criteria showing that maximum-confidence measurements enable the distribution and certification of randomness across a sequential measurement chain in single-party systems.

arXiv:2510.19445•Physical Review Research•Apr 25, 2026•0 citations

Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario

Tailan S. Sarubi, Moisés Alves, Vinícius F. Alves +4 more

We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.

quant-pharXiv:2608.08329•Aug 11, 2026•0 citations

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the post-processing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today's computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.

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.

Randomness is fundamental for secure communication and information processing. While continuous-variable optical systems offer an attractive platform for this task, certifying genuine quantum randomness in such setups remains challenging. We present a semi-device-independent scheme for randomness certification tailored to continuous-variable implementations, where the dimension assumption is operationally implemented by restricting state preparations to the two-level Fock subspace. Using standard homodyne and displacement-based measurements, we show that simple optical setups can achieve dimension-witness violations that certify positive min-entropy, even in the presence of realistic losses and misaligned reference frames. These results demonstrate that practical and scalable quantum randomness generation is achievable with minimal experimental complexity on continuous-variable platforms.

We have proved that new randomness can be certified by partially free sources using $2\ensuremath{\rightarrow}1$ quantum random access code (QRAC) in the framework of semi-device-independent (SDI) protocols [Y.-Q. Zhou, H.-W. Li, Y.-K. Wang, D.-D. Li, F. Gao, and Q.-Y. Wen, Phys. Rev. A 92, 022331 (2015)]. To improve the effectiveness of the randomness generation, here we propose the SDI randomness expansion using $3\ensuremath{\rightarrow}1$ QRAC and obtain the corresponding classical and quantum bounds of the two-dimensional quantum witness. Moreover, we get the condition which should be satisfied by the partially free sources to successfully certify new randomness, and the analytic relationship between the certified randomness and the two-dimensional quantum witness violation.

Quantum mechanics enables the generation of genuine randomness through its intrinsic indeterminacy. In device-independent (DI) and semi-device-independent (SDI) frameworks, randomness generation protocols can further ensure that the output remains secure and unaffected by internal device imperfections, with certification grounded in violations of generalized Bell inequalities. In this work, we propose an SDI randomness expansion protocol using n→1 parity-oblivious quantum random access code (PO-QRAC), where the presence of true quantum randomness is certified through the violation of a two-dimensional quantum witness. For various values of n, we derive the corresponding maximal expected success probabilities. Notably, for n=4, the expected success probability obtained under our protocol exceeds the upper bound reported in prior work. Furthermore, we establish an analytic relationship between the certifiable min-entropy and the quantum witness value, and demonstrate that, for a fixed witness value, PO-QRAC–based protocols certify more randomness than those based on standard QRACs. Among all configurations satisfying the parity-obliviousness constraint, the protocol based on the 3→1 PO-QRAC achieves optimal randomness expansion performance.

Quantum measurements under realistic conditions reveal only partial information about a system. Yet, by performing sequential measurements on the same system, additional information can be accessed. We investigate this problem in the context of semi-device-independent randomness certification using sequential maximum-confidence measurements. We develop a general framework and versatile numerical methods to bound the amount of certifiable randomness in such scenarios. We further introduce a technique to compute min-tradeoff functions via semidefinite programming duality, thus making the framework suitable for bounding the certifiable randomness against adaptive attacking strategies through entropy accumulation. Our results establish sufficient criteria showing that maximum-confidence measurements enable the distribution and certification of randomness across a sequential measurement chain in single-party systems.

We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.