https://github.com/strilanc/quantum-pseudo-telepathy
Code demonstrating the quantum process used to consistently win a game that can only be won 8 times out of 9 classically.
https://github.com/strilanc/quantum-pseudo-telepathy
Last synced: 8 months ago
JSON representation
Code demonstrating the quantum process used to consistently win a game that can only be won 8 times out of 9 classically.
- Host: GitHub
- URL: https://github.com/strilanc/quantum-pseudo-telepathy
- Owner: Strilanc
- License: other
- Created: 2013-09-14T01:21:36.000Z (over 12 years ago)
- Default Branch: master
- Last Pushed: 2013-11-19T20:20:06.000Z (over 12 years ago)
- Last Synced: 2024-04-14T23:21:35.947Z (about 2 years ago)
- Language: C#
- Size: 438 KB
- Stars: 9
- Watchers: 5
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: License.txt
Awesome Lists containing this project
README
Quantum-Pseudo-Telepathy
========================
Code demonstrating the quantum process used to consistently win a game that can only be won 8 times out of 9 classically.
The code just simulates the quantum circuits that Alice and Bob use to win the game. The general approach is explained in [this blog post](http://twistedoakstudios.com/blog/Post6536_implementing-quantum-pseudo-telepathy).
Reference diagrams:
Win/Lose/Fail-to-follow-rules outcomes of the coordination game being played:

Circuits used for each row and column:

Gates used by circuits:



