- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

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

Complexity and multifunctional variants of the quantum-to-quantum Bernoulli factories

Francesco Hoch, Taira Giordani, Gonzalo Carvacho, Nicolò Spagnolo, and Fabio Sciarrino*

  • *Contact author: fabio.sciarrino@uniroma1.it
PDF

Phys. Rev. Research 8, 033003 – Published 1 July, 2026

DOI: https://doi.org/10.1103/k8kd-58h8

Abstract

A Bernoulli factory is a model for randomness manipulation that transforms an initial Bernoulli random variable into another Bernoulli variable by applying a predetermined function relating the output bias to the input one. In literature, quantum-to-quantum Bernoulli factory schemes have been proposed, which encode both the input and output variables using qubit amplitudes. This fundamental concept can serve as a subroutine for quantum algorithms that involve Bayesian inference and Monte-Carlo methods, or that require data encryption, like in blind quantum computation. In this work, we present a characterization of the complexity of the quantum-to-quantum Bernoulli factory by providing a lower bound on the required number of qubits needed to implement the protocol, an upper bound on the success probability, and the quantum circuit that saturates the bounds. We also formalize and analyze two different variants of the original problem that address the possibility of increasing the number of input biases or the number of functions implemented by the quantum-to-quantum Bernoulli factory. The obtained results can be used as a framework for randomness manipulation via such an approach.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (39)

  1. M. S. Keane and G. L. O’Brien, A Bernoulli factory, ACM Trans. Model. Comput. Simul. 4, 213 (1994).
  2. R. P. Leme and J. Schneider, Multiparameter Bernoulli factories, Ann. Appl. Probab. 33, 3987 (2023).
  3. R. Niazadeh, R. P. Leme, and J. Schneider, Bernoulli factories for flow-based polytopes, SIAM J. Discrete Math. 38, 726 (2024).
  4. R. Niazadeh, R. P. Leme, and J. Schneider, Combinatorial Bernoulli factories, Bernoulli 29, 1246 (2023).
  5. J. M. Flegal and R. Herbei, Exact sampling for intractable probability distributions via a Bernoulli factory, Electron. J. Stat. 6, 10 (2012).
  6. D. Vats, F. B. Gonçalves, K. Łatuszyński, and G. O. Roberts, Efficient Bernoulli factory Markov chain Monte Carlo for intractable posteriors, Biometrika 109, 369 (2022).
  7. F. B. Gonçalves, K. Łatuszyński, and G. O. Roberts, Exact Monte Carlo likelihood-based inference for jump-diffusion processes, J. R. Stat. Soc. B 85, 732 (2023).
  8. R. Herbei and L. M. Berliner, Estimating ocean circulation: An MCMC approach with approximated likelihoods via the Bernoulli factory, J. Am. Stat. Assoc. 109, 944 (2014).
  9. J. Koskela, K. Łatuszyński, and D. Spanò, Bernoulli factories and duality in Wright–Fisher and Allen–Cahn models of population genetics, Theor. Popul. Biol. 156, 40 (2024).
  10. G. Morina, K. Łatuszyński, P. Nayar, and A. Wendland, From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains, Ann. Appl. Probab. 32, 327 (2022).
  11. V. Goyal and K. Sigman, On simulating a class of Bernstein polynomials, ACM Trans. Model. Comput. Simul. 22, 1 (2012).
  12. E. Mossel and Y. Peres, New coins from old: Computing with unknown bias, Combinatorica 25, 707 (2005).
  13. K. Łatuszyński, I. Kosmidis, O. Papaspiliopoulos, and G. O. Roberts, Simulating events of unknown probabilities via reverse time martingales, Random Struct. Algorithms 38, 441 (2011).
  14. S. Nacu and Y. Peres, Fast simulation of new coins from old, Ann. Appl. Probab. 15, 93 (2005).
  15. L. Mendo, An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series, Stochastic Processes Appl. 129, 4366 (2019).
  16. P. Flajolet, M. Pelletier, and M. Soria, On Buffon machines and numbers, in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2011).
  17. O. Holtz, F. Nazarov, and Y. Peres, New coins from old, smoothly, Constr. Approx. 33, 331 (2011).
  18. H. Dale, D. Jennings, and T. Rudolph, Provable quantum advantage in randomness processing, Nat. Commun. 6, 8203 (2015).
  19. H. Dale, Quantum coins and quantum sampling, Ph.D. thesis, Imperial College London, 2016.
  20. R. B. Patel, T. Rudolph, and G. J. Pryde, An experimental quantum Bernoulli factory, Sci. Adv. 5, eaau6668 (2019).
  21. X. Yuan, K. Liu, Y. Xu, W. Wang, Y. Ma, F. Zhang, Z. Yan, R. Vijay, L. Sun, and X. Ma, Experimental quantum randomness processing using superconducting qubits, Phys. Rev. Lett. 117, 010502 (2016).
  22. J. Jiang, J. Zhang, and X. Sun, Quantum-to-quantum Bernoulli factory problem, Phys. Rev. A 97, 032303 (2018).
  23. X. Zhan, K. Wang, L. Xiao, Z. Bian, and P. Xue, Experimental demonstration of quantum-to-quantum Bernoulli factory, Phys. Rev. A 102, 012605 (2020).
  24. Y. Liu, J. Jiang, P. Zhu, D. Wang, J. Ding, X. Qiang, A. Huang, P. Xu, J. Zhang, G. Tian, X. Fu, M. Deng, C. Wu, X. Sun, X. Yang, and J. Wu, General quantum Bernoulli factory: Framework analysis and experiments, Quantum Sci. Technol. 6, 045025 (2021).
  25. F. Hoch, T. Giordani, L. Castello, G. Carvacho, N. Spagnolo, F. Ceccarelli, C. Pentangelo, S. Piacentini, A. Crespi, R. Osellame, E. F. Galvão, and F. Sciarrino, Modular quantum-to-quantum Bernoulli factory in an integrated photonic processor, Nat. Photonics 19, 12 (2025).
  26. G. Rodari, F. Hoch, A. Suprano, T. Giordani, E. Negro, G. Carvacho, N. Spagnolo, E. F. Galvão, and F. Sciarrino, Polarization-encoded photonic quantum-to-quantum Bernoulli factory based on a quantum dot source, Sci. Adv. 10, eado6244 (2024).
  27. E. Kashefi and A. Pappa, Multiparty delegated quantum computing, Cryptography 1, 12 (2017).
  28. J. F. Fitzsimons and E. Kashefi, Unconditionally verifiable blind quantum computation, Phys. Rev. A 96, 012303 (2017).
  29. B. Polacchi, D. Leichtle, L. Limongi, G. Carvacho, G. Milani, N. Spagnolo, M. Kaplan, F. Sciarrino, and E. Kashefi, Multi-client distributed blind quantum computation with the Qline architecture, Nat. Commun. 14, 7743 (2023).
  30. A. Bärtschi and S. Eidenbenz, Deterministic preparation of Dicke states, in Fundamentals of Computation Theory, edited by G. L. Antoni, J. Jesper, and L. Christos (Springer International Publishing, Cham, Switzerland, 2019), pp. 126–139.
  31. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2009).
  32. Y. Gurevich and A. Blass, Quantum circuits with classical channels and the principle of deferred measurements, Theor. Comput. Sci. 920, 21 (2022).
  33. See Supplemental Material at http://link.aps.org/supplemental/10.1103/k8kd-58h8 for further demonstrations of the main results reported in the main text.
  34. W. T. V. William, H. Press, and S. A. Teukolsky, Numerical Recipes: The Art of Scientific Computing, 3rd ed. (Cambridge University Press, Cambridge, England, 2007).
  35. E. Fricain, A. Hartmann, W. T. Ross, and D. Timotin, An analytic approach to estimating the solutions of Bézout's polynomial identity, arXiv:2310.12734.
  36. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, Phys. Rev. A 52, 3457 (1995).
  37. M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary operator, Phys. Rev. Lett. 73, 58 (1994).
  38. E. Levy and O. M. Shalit, Dilation theory in finite dimensions: The possible, the impossible and the unknown, Rocky Mt. J. Math. 44, 203 (2014).
  39. T. J. Yoder, Building and bounding quantum Bernoulli factories, 2025, https://www.scottaaronson.com/6s899/tedyoder.pdf.

Outline

Information

Phys. Rev. Research 8, 033003– Published 1 July, 2026
  • Received 17 December 2025
  • Accepted 26 May 2026
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation