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

Elsevier eBooks

DYNAMIC QUANTUM BERNOULLI RANDOM WALKS

Nadine Guillotin‐Plantard, René Schott

Published Jan 1, 2006• 1 citation
Publisher
DOI
10.1016/b978-044452735-6/50044-0

Related papers

SOME PROPERTIES OF QUANTUM BERNOULLI RANDOM WALKS

Philippe Biane

QP-PQ, quantum probability and white noise analysis•Oct 1, 1991•9 citations

Open quantum random walk in terms of quantum Bernoulli noise

Caishi Wang, Ce Wang, Suling Ren +1 more

Quantum Information Processing•Jan 23, 2018•12 citations

Quantum Random Walks

Swarnadeep Majumder, Austen Couvertier

•Apr 27, 2018•1 citation

Complexity and multi-functional variants of the Quantum-to-Quantum Bernoulli Factories

Francesco Hoch, Taira Giordani, Gonzalo Carvacho +2 more

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 characterisation 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 formalise and analyse 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.

quant-pharXiv:2512.10810•Physical Review Research•Dec 12, 2025•0 citations

DYNAMIC QUANTUM BERNOULLI RANDOM WALKS

Nadine Guillotin‐Plantard, René Schott

Quantum Bernoulli random walks can be realized as random walks on the dual of SU(2). We use this realization in order to study a model of dynamic quantum Bernoulli random walk with time-dependent transitions. For the corresponding dynamic random walk on the dual of SU(2), we prove several limit theorems (local limit theorem, central limit theorem, law of large numbers, large deviation principle). In addition, we characterize a large class of transient dynamic random walks.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Jun 1, 2008•0 citations

Quantum random walks

Luigi Accardi, G. S. Watson

Lecture notes in mathematics•Jan 1, 1989•23 citations
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 characterisation 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 formalise and analyse 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.