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

Nature Physics

A quantum coin toss

David Abergel

Published Jan 1, 2018• 0 citations
Publisher
DOI
10.1038/nphys4342

Related papers

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Lecture notes in computer science•Jan 1, 2009•93 citations

Randomness of the tossed coin

Tomasz Kapitaniak

Physics Today•Oct 31, 2012•0 citations

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Journal of Cryptology•Feb 20, 2015•35 citations

Quantum Chance

Nicolas Gisin

Springer eBooks•Jan 1, 2014•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•71 citations

Quantum Probabilities

Maximilian Schlosshauer

The frontiers collection•Jan 1, 2011•0 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.