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:quant-ph/0010103 · Physical Review A

Quantum gambling using two nonorthogonal states

Won Young Hwang, Doyeol Ahn, Sung Woo Hwang

Published Nov 9, 2001• 22 citations
arXivHTMLPDF

Abstract

We give a (remote) quantum-gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of making guesses on identities of quantum states that are in one of two given nonorthogonal states: if Bob makes a correct (an incorrect) guess on the identity of a quantum state that Alice has sent, he wins (loses). It is shown that the proposed scheme is secure against the nonentanglement attack. It can also be shown heuristically that the scheme is secure in the case of the entanglement attack.

DOI
10.1103/physreva.64.064302

Related papers

Quantum gambling using three nonorthogonal states

Won-Young Hwang, Keiji Matsumoto

We provide a quantum gambling protocol using three (symmetric) nonorthogonal states. The bias of the proposed protocol is less than that of previous ones, making it more practical. We show that the proposed scheme is secure against nonentanglement attacks. The security of the proposed scheme against entanglement attacks is shown heuristically.

arXiv:quant-ph/0203148•Physical Review A•Nov 19, 2002•12 citations

Optical Realization of Quantum Gambling Machine

Yongsheng Zhang, Chuan‐Feng Li, Wanli Li +2 more

Quantum gambling --- a secure remote two-party protocol which has no classical counterpart --- is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to Bob and is split into two parts. The security is confirmed by quantum interference between Alice's path and one part of Bob's path. It is shown that a practical quantum gambling machine can be feasible by this way.

arXiv:quant-ph/0001008•Jan 6, 2000•3 citations

Optical realization of quantum gambling machine

Pei Zhang, Y. S. Zhang, Yun‐Feng Huang +3 more

Quantum gambling, a secure remote two-party protocol which has no classical counterpart, is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to Bob and is split into two parts. The security is confirmed by quantum interference between Alice's path and one part of Bob's path. A quantum gambling machine is demonstrated to be feasible by this way.

Europhysics Letters (EPL)•Apr 18, 2008•10 citations

Optimal Strategies for Winning Certain Coset-Guessing Quantum Games

Michael Schleppy, Emina Soljanin, Nicolas Swanson

In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.

arXiv:2410.08160•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•0 citations

Optimal Guessing Strategies in a Quantum Card Game

Chih‐Lung Chou, Li‐Yi Hsu

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice's card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob's best strategy for guessing Alice's card is to measure his two cards collectively.

arXiv:quant-ph/0206167•Jun 24, 2002•0 citations

Quantum Gambling

Lior Goldenberg, Lev Vaidman A, Stephen J. Wiesner

We present a two-party protocol for ``quantum gambling,'' a new task closely related to coin tossing. The protocol allows two remote parties to play a gambling game such that in a certain limit it becomes a fair game. No unconditionally secure classical method is known to accomplish this task.

arXiv:quant-ph/9808001•Physical Review Letters•Apr 19, 1999•114 citations
We give a (remote) quantum-gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of making guesses on identities of quantum states that are in one of two given nonorthogonal states: if Bob makes a correct (an incorrect) guess on the identity of a quantum state that Alice has sent, he wins (loses). It is shown that the proposed scheme is secure against the nonentanglement attack. It can also be shown heuristically that the scheme is secure in the case of the entanglement attack.
In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.