Quantum Gambling Using Two Nonorthogonal States
arXiv:quant-ph/0010103 · doi:10.1103/PhysRevA.64.064302
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.
arXiv commentno essential correction, 4 pages, RevTex
References in corpus (10)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Noiseless Quantum Codes
- Quantum Computers and Dissipation
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Preserving coherence in quantum computation by pairing quantum bits
- Quantum Gambling
- Quantum Bit Regeneration
- How much information can be obtained by a quantum measurement?
Cited by in corpus (11)
- Quantum Key Distribution with High Loss: Toward Global Secure Communication
- Continuous-Variable Quantum Games
- Transverse Charge Densities
- Quantum games of asymmetric information
- Fair Loss-Tolerant Quantum Coin Flipping
- Helstrom Theorem by No-Signaling Condition
- Quantum coin tossing and bit-string generation in the presence of noise
- The Application of Asymmetric Entangled States in Quantum Game
- Quantum Gambling Using Three Nonorthogonal States
- Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement
- Quantization of Blackjack: Quantum Basic Strategy and Advantage