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:1107.6029 · Communications in Mathematical Physics

Unifying Typical Entanglement and Coin Tossing: on Randomization in Probabilistic Theories

Markus P. Müller, Oscar Dahlsten, Vlatko Vedral

Published Oct 29, 2012• 28 citations
arXivHTMLPDF
DOI
10.1007/s00220-012-1605-x

Related papers

Correlations and Entanglement in Probability Theory

Enrico G. Beltrametti, Slawomir Bugajski

arXiv:quant-ph/0211083•International Journal of Theoretical Physics•Jul 1, 2005•9 citations

Quantum random walks do not need a coin toss

Apoorva Patel, K. S. Raghunathan, Pranaw Rungta

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement between the coin and the position degrees of freedom from the algorithm, and the results match those obtained with a quantum coin toss instruction.

arXiv:quant-ph/0405128•Physical Review A•Mar 29, 2005•67 citations

On the (Im-)Possibility of Extending Coin Toss

Dennis Hofheinz, Jörn Müller‐Quade, Dominique Unruh

We consider the task of extending a given coin toss. By this, we mean the two-party task of using a single instance of a given coin toss protocol in order to interactively generate more random coins. A bit more formally, our goal is to generate n common random coins from a single use of an ideal functionality that gives $$m<n$$ common random coins to both parties. In the framework of universal composability, we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security, the existence of a protocol for coin toss extension depends on the number m of random coins that can be obtained “for free.” For the case of stand-alone security, i.e., a simulation-based security definition without an environment, we present a protocol for statistically secure coin toss extension. Our protocol works for superlogarithmic m, which is optimal as we show the impossibility of statistically secure coin toss extension for smaller m. Combining our results with already known results, we obtain a (nearly) complete characterization under which circumstances coin toss extension is possible.

Journal of Cryptology•Apr 26, 2018•0 citations

The Probability of Entanglement

William Arveson

arXiv:0712.4163•Communications in Mathematical Physics•Oct 15, 2008•11 citations

Probability and Entanglement in Quantum Mechanics

James M. Espinosa

Bulletin of the American Physical Society•Mar 23, 2007•0 citations

Quantum random walk of a Bose-Einstein condensate in momentum space

Gil S. Summy, Sandro Wimberger

Each step in a quantum random walk is typically understood to have two basic components: a ``coin toss'' which produces a random superposition of two states, and a displacement which moves each component of the superposition by different amounts. Here we suggest the realization of a walk in momentum space with a spinor Bose-Einstein condensate subject to a quantum ratchet realized with a pulsed, off-resonant optical lattice. By an appropriate choice of the lattice detuning, we show how the atomic momentum can be entangled with the internal spin states of the atoms. For the coin toss, we propose to use a microwave pulse to mix these internal states. We present experimental results showing an optimized quantum ratchet, and through a series of simulations, demonstrate how our proposal gives extraordinary control of the quantum walk. This should allow for the investigation of possible biases, and classical-to-quantum dynamics in the presence of natural and engineered noise.

arXiv:1602.07612•Physical Review A•Feb 24, 2016•39 citations
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement between the coin and the position degrees of freedom from the algorithm, and the results match those obtained with a quantum coin toss instruction.
We consider the task of extending a given coin toss. By this, we mean the two-party task of using a single instance of a given coin toss protocol in order to interactively generate more random coins. A bit more formally, our goal is to generate n common random coins from a single use of an ideal functionality that gives m<nm<nm<n common random coins to both parties. In the framework of universal composability, we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security, the existence of a protocol for coin toss extension depends on the number m of random coins that can be obtained “for free.” For the case of stand-alone security, i.e., a simulation-based security definition without an environment, we present a protocol for statistically secure coin toss extension. Our protocol works for superlogarithmic m, which is optimal as we show the impossibility of statistically secure coin toss extension for smaller m. Combining our results with already known results, we obtain a (nearly) complete characterization under which circumstances coin toss extension is possible.
Each step in a quantum random walk is typically understood to have two basic components: a ``coin toss'' which produces a random superposition of two states, and a displacement which moves each component of the superposition by different amounts. Here we suggest the realization of a walk in momentum space with a spinor Bose-Einstein condensate subject to a quantum ratchet realized with a pulsed, off-resonant optical lattice. By an appropriate choice of the lattice detuning, we show how the atomic momentum can be entangled with the internal spin states of the atoms. For the coin toss, we propose to use a microwave pulse to mix these internal states. We present experimental results showing an optimized quantum ratchet, and through a series of simulations, demonstrate how our proposal gives extraordinary control of the quantum walk. This should allow for the investigation of possible biases, and classical-to-quantum dynamics in the presence of natural and engineered noise.