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/0001008

Optical Realization of Quantum Gambling Machine

Yongsheng Zhang, Chuan‐Feng Li, Wanli Li, Yun‐Feng Huang, Guang‐Can Guo

Published Jan 6, 2000• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0001008

Related papers

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

Quantum gambling based on Nash-equilibrium

Pei Zhang, Xiaoqi Zhou, Yunlong Wang +6 more

Abstract The problem of establishing a fair bet between spatially separated gambler and casino can only be solved in the classical regime by relying on a trusted third party. By combining Nash-equilibrium theory with quantum game theory, we show that a secure, remote, two-party game can be played using a quantum gambling machine which has no classical counterpart. Specifically, by modifying the Nash-equilibrium point we can construct games with arbitrary amount of bias, including a game that is demonstrably fair to both parties. We also report a proof-of-principle experimental demonstration using linear optics.

arXiv:1408.6593•npj Quantum Information•Jun 6, 2017•13 citations

Quantum gambling using two nonorthogonal states

Won Young Hwang, Doyeol Ahn, Sung Woo Hwang

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:quant-ph/0010103•Physical Review A•Nov 9, 2001•22 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

Joint remote state preparation

Nguyen Ba An, Jaewan Kim

Alice, Bob and Charlie are three remote parties. Alice and Bob share the classical knowledge of a secret qubit state. We consider the following question: 'how can Alice and Bob jointly prepare the qubit state for Charlie?' Two different protocols are proposed for such a joint remote state preparation. The first protocol uses a single GHZ state while the second one uses a pair of EPR states as the quantum channel whose entanglement is not necessarily maximal.

Journal of Physics B Atomic Molecular and Optical Physics•Apr 22, 2008•181 citations

Remote state preparation and measurement of single photon

Arun Kumar Pati

Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one classical bit Alice can remotely prepare a photon (from special ensemble) of her choice at Bob's laboratory. In remote state measurement Alice asks Bob to simulate any single particle measurement statistics on an arbitrary photon. In this talk we will present these ideas and discuss the latest developments and future open problems.

arXiv:quant-ph/0212164•Dec 31, 2002•1 citation
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.
Abstract The problem of establishing a fair bet between spatially separated gambler and casino can only be solved in the classical regime by relying on a trusted third party. By combining Nash-equilibrium theory with quantum game theory, we show that a secure, remote, two-party game can be played using a quantum gambling machine which has no classical counterpart. Specifically, by modifying the Nash-equilibrium point we can construct games with arbitrary amount of bias, including a game that is demonstrably fair to both parties. We also report a proof-of-principle experimental demonstration using linear optics.
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.
Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one classical bit Alice can remotely prepare a photon (from special ensemble) of her choice at Bob's laboratory. In remote state measurement Alice asks Bob to simulate any single particle measurement statistics on an arbitrary photon. In this talk we will present these ideas and discuss the latest developments and future open problems.