Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Optimization of experimental quantum randomness expansion

Amelie Piveteau1, Alban Seguinard1, Piotr Mironowicz2,1,3,*, and Mohamed Bourennane1

  • *Contact author: piotr.mironowicz@gmail.com

Phys. Rev. Applied 24, 044096 – Published 30 October, 2025

DOI: https://doi.org/10.1103/hc3f-3pbw

Abstract

Quantum technologies provide many applications for information processing tasks that are impossible to realize within classical physics. These capabilities include such fundamental resources as generating secure, i.e., private and unpredictable random values. Yet, the problem of quantifying the amount of generated randomness is still not fully solved. This work presents a comprehensive analysis of the design and performance optimization of a quantum random number generator (QRNG) based on Bell inequality violations. We investigate key protocol parameters, including the smoothing parameter (ϵs), test round probability (γ), and switching delays, and their effects on the generation rate and quality of randomness. We identify optimal ranges for γ and pΩ (the protocol’s nonaborting probability) to balance the trade-off between randomness consumption and net randomness generation. We investigate the impact of the laser power on the overall generation rate. We explore the impact of switching delays on the system’s performance, providing strategies to mitigate these effects. The work provides practical guidelines for the efficient and secure design of QRNG systems and other cryptographic protocols.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (39)

  1. S. Pironio, A. Acín, S. Massar, A. B. de La Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, et al., Random numbers certified by Bell’s theorem, Nature 464, 1021 (2010).
  2. A. Acín and L. Masanes, Certified randomness in quantum physics, Nature 540, 213 (2016).
  3. Y. Liu, Q. Zhao, M.-H. Li, J.-Y. Guan, Y. Zhang, B. Bai, W. Zhang, W.-Z. Liu, C. Wu, X. Yuan, et al., Device-independent quantum random-number generation, Nature 562, 548 (2018).
  4. W.-Z. Liu, M.-H. Li, S. Ragy, S.-R. Zhao, B. Bai, Y. Liu, P. J. Brown, J. Zhang, R. Colbeck, J. Fan, Q. Zhang, and J.-W. Pan, Device-independent randomness expansion against quantum side information, Nat. Phys. 17, 448 (2021).
  5. D. Mayers and A. Yao, Self testing quantum apparatus, Quantum Inf. Comput. 4, 273 (2004).
  6. R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009).
  7. R. Renner, Security of quantum key distribution, Int. J. Quantum Inf. 6, 1 (2008).
  8. C. Portmann and R. Renner, Security in quantum cryptography, Rev. Mod. Phys. 94, 025008 (2022).
  9. R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner, and T. Vidick, Practical device-independent quantum cryptography via entropy accumulation, Nat. Commun. 9, 459 (2018).
  10. F. Dupuis, O. Fawzi, and R. Renner, Entropy accumulation, Commun. Math. Phys. 379, 867 (2020).
  11. J. S. Bell, On the Einstein Podolsky Rosen paradox, Phys. Phys. Fiz. 1, 195 (1964).
  12. N. Brunner, D. Cavalcanti, S. Pironio, V. Scarani, and S. Wehner, Bell nonlocality, Rev. Mod. Phys. 86, 419 (2014).
  13. B. S. Cirel’son, Quantum generalizations of Bell’s inequality, Lett. Math. Phys. 4, 93 (1980).
  14. P. Mironowicz and M. Pawłowski, Robustness of quantum-randomness expansion protocols in the presence of noise, Phys. Rev. A—At., Mol. Opt. Phys. 88, 032319 (2013).
  15. L. Wooltorton, P. Brown, and R. Colbeck, Tight analytic bound on the trade-off between device-independent randomness and nonlocality, Phys. Rev. Lett. 129, 150403 (2022).
  16. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett. 23, 880 (1969).
  17. A. J.-M. Seguinard, A. Piveteau, P. Mironowicz, and M. Bourennane, Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario, New J. Phys. 25, 113022 (2023).
  18. F. Dupuis and O. Fawzi, Entropy accumulation with improved second-order term, IEEE Trans. Inf. Theory 65, 7596 (2019).
  19. P. J. Brown, S. Ragy, and R. Colbeck, A framework for quantum-secure device-independent randomness expansion, IEEE Trans. Inf. Theory 66, 2964 (2019).
  20. P. Mironowicz and M. Bourennane, Finite-size security analysis for quantum protocol: A python framework using the entropy accumulation theorem with graphical interface, ArXiv:2506.18888.
  21. M. Navascués, S. Pironio, and A. Acín, Bounding the set of quantum correlations, Phys. Rev. Lett. 98, 010401 (2007).
  22. M. Navascués, S. Pironio, and A. Acín, A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations, New J. Phys. 10, 073013 (2008).
  23. P. Mironowicz, Semi-definite programming and quantum information, J. Phys. A: Math. Theor. 57, 163002 (2024).
  24. P. Mironowicz and M. Bourennane, When more light means less quantum: Modeling Bell inequality degradation from accidental counts, ArXiv:2507.20596.
  25. C. A. Miller and Y. Shi, Universal security for randomness expansion from the spot-checking protocol, SIAM J. Comput. 46, 1304 (2017).
  26. B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput. 17, 230 (1988).
  27. J. Håstad, R. Imagliazzo, L. Levin, and M. Luby, A pseudorandom generator from any one-way function, SIAM J. Comput. 28, 1364 (1999).
  28. R. Konig, R. Renner, and C. Schaffner, The operational meaning of min- and max-entropy, IEEE Trans. Inf. Theory 55, 4337 (2009).
  29. I. Issa and A. B. Wagner, Measuring secrecy by the probability of a successful guess, IEEE Trans. Inf. Theory 63, 3783 (2017).
  30. P. Brown, H. Fawzi, and O. Fawzi, Device-independent lower bounds on the conditional von Neumann entropy, Quantum 8, 1445 (2024).
  31. P. Wittek, Algorithm 950: Ncpol2sdpa—sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables, ACM Trans. Math. Softw. (TOMS) 41, 1 (2015).
  32. MOSEK Modeling Cookbook. 3.2.3 ed., 2021.
  33. L. Trevisan, Extractors and pseudorandom generators, J. ACM 48, 860 (2001).
  34. A. De, C. Portmann, T. Vidick, and R. Renner, Trevisan’s extractor in the presence of quantum side information, SIAM J. Comput. 41, 915 (2012).
  35. M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, Leftover hashing against quantum side information, IEEE Trans. Inf. Theory 57, 5524 (2011).
  36. L. K. Shalm, Y. Zhang, J. C. Bienfang, C. Schlager, M. J. Stevens, M. D. Mazurek, C. Abellán, W. Amaya, M. W. Mitchell, M. A. Alhejji, et al., Device-independent randomness expansion with entangled photons, Nat. Phys. 17, 452 (2021).
  37. W. Zhang, T. van Leent, K. Redeker, R. Garthoff, R. Schwonnek, F. Fertig, S. Eppelt, W. Rosenfeld, V. Scarani, C. C.-W. Lim, et al., A device-independent quantum key distribution system for distant users, Nature 607, 687 (2022).
  38. D. P. Nadlinger, P. Drmota, B. C. Nichol, G. Araneda, D. Main, R. Srinivas, D. M. Lucas, C. J. Ballance, K. Ivanov, E.-Z. Tan, et al., Experimental quantum key distribution certified by Bell’s theorem, Nature 607, 682 (2022).
  39. R. Bhavsar, S. Ragy, and R. Colbeck, Improved device-independent randomness expansion rates using two sided randomness, New J. Phys. 25, 093035 (2023).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation