## Programming Telepathy: Implementing Quantum Non-locality Games (2008)

### Cached

### Download Links

Venue: | SBMF 2008 |

Citations: | 3 - 3 self |

### BibTeX

@MISC{Tafliovich08programmingtelepathy:,

author = {Anya Tafliovich and Eric C. R. Hehner},

title = {Programming Telepathy: Implementing Quantum Non-locality Games},

year = {2008}

}

### OpenURL

### Abstract

Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setting. To an observer who is unfamiliar with the laws of quantum mechanics it seems that the players employ some sort of telepathy; that is, they somehow exchange information without sharing a communication channel. This paper provides a formal framework for specifying, implementing, and analysing quantum non-locality games.

### Citations

1368 | Quantum Computation and Quantum Information - Nielsen, Chuang - 2000 |

601 | Quantum Cryptography: Public key distribution and coin tossing - Bennett, Brassard - 1984 |

506 |
On the Einstein-Podolsky-Rosen paradox
- Bell
- 1964
(Show Context)
Citation Context ...tum non-locality has been studied extensively first by physicists and lately by researchers in the fields of quantum information and quantum communication complexity. Since the work of Bell in 1964 ([=-=Bell 1964-=-]), researchers have been trying to provide an intuitive explanation of the genuinely non-classical behaviour produced by quantum mechanics. Today, quantum pseudotelepathy games are considered one of ... |

393 | Quantum computation and quantum information, Cambridge University Press, 2000. 14 Masaki Nakanishi, Kiyoharu Hamaguchi, and Toshinobu Kashiwabara, Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a b - Nielsen, Chuang - 2000 |

340 |
Rapid solution of problems by quantum computation
- Deutsch, Jozsa
- 1992
(Show Context)
Citation Context .... The strategy S is winning if P ∧ S ⇒ W 3.2. Deutsch-Jozsa game The Deutsch-Jozsa pseudo telepathy game [Brassard et al. 1999, Brassard et al. 2005] is based on a well-known Deutsch-Jozsa algorithm [=-=Deutsch and Jozsa 1992-=-]. A formal analysis of the algorithm is presented in [Tafliovich and Hehner 2006, Tafliovich 2004]. The setting of the game is as follows. Alice and Bob are separated several light years apart and ar... |

149 | A categorical semantics of quantum protocols
- Abramsky
- 2004
(Show Context)
Citation Context ..., Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, =-=Abramsky and Coecke 2004-=-, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well ... |

110 | 2004): Towards a quantum programming language
- Selinger
(Show Context)
Citation Context ...and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, =-=Selinger 2004-=-], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Panangaden 2004, D’Hondt and P... |

104 |
A Practical Theory of Programming
- Hehner
- 1993
(Show Context)
Citation Context ...analysis on quantum non-locality is based on quantum predicative programming ([Tafliovich and Hehner 2006, Tafliovich 2004]), a recent generalization of the well-established predicative programming ([=-=Hehner 1993-=-, Hehner 2004]). It supports the style of program development in which each programming step is proved correct as it is made. We inherit the advantages of the theory, such as its generality, simple tr... |

62 | P.Zuliani: Quantum programming
- Sanders
(Show Context)
Citation Context ...s of these non-classical phenomena (e.g. [Galliard et al. 2003, Brassard et al. 2004, Brassard et al. 2005, Brassard et al. 2006]).sFormal approaches to quantum programming include the language qGCL [=-=Sanders and Zuliani 2000-=-, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [A... |

49 | A lambda calculus for quantum computation - Tonder |

47 | A functional quantum programming language
- Altenkirch, Grattage
(Show Context)
Citation Context ...e field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, =-=Altenkirch and Grattage 2005-=-, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Panangaden 2004, D’Hondt and Panangaden 2005], [Danos et al. 2005], and [Gay and Nagarajan 2005]. A detailed discussion of the work re... |

47 | E.C.R.: Predicative Programming
- Hehner
- 1984
(Show Context)
Citation Context ...uantum non-locality is based on quantum predicative programming ([Tafliovich and Hehner 2006, Tafliovich 2004]), a recent generalization of the well-established predicative programming ([Hehner 1993, =-=Hehner 2004-=-]). It supports the style of program development in which each programming step is proved correct as it is made. We inherit the advantages of the theory, such as its generality, simple treatment of re... |

40 | Cost of exactly simulating quantum entanglement with classical communication,” Phys
- Brassard, Cleve, et al.
- 1999
(Show Context)
Citation Context ...ell as outputs for each player. The strategy S is a program, i.e. an implemented specification. The strategy S is winning if P ∧ S ⇒ W 3.2. Deutsch-Jozsa game The Deutsch-Jozsa pseudo telepathy game [=-=Brassard et al. 1999-=-, Brassard et al. 2005] is based on a well-known Deutsch-Jozsa algorithm [Deutsch and Jozsa 1992]. A formal analysis of the algorithm is presented in [Tafliovich and Hehner 2006, Tafliovich 2004]. The... |

39 | Communicating quantum processes
- Gay, Nagarajan
- 2005
(Show Context)
Citation Context ...ek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Panangaden 2004, D’Hondt and Panangaden 2005], [Danos et al. 2005], and [=-=Gay and Nagarajan 2005-=-]. A detailed discussion of the work related to quantum predicative programming is presented in [Tafliovich and Hehner 2006]. Some researchers address the subject of formalizing quantum non-locality m... |

36 |
Quantum mysteries revisited
- Mermin
- 1990
(Show Context)
Citation Context ...n == � x : 0, ..2 k · (y ′ A = x) × (y′ B == (y ′ A = y′ B ) = x) math Similarly, analyzing the amplitudes in the second case, we get: 3.3. Mermin’s game P1 ∧ S ⇒ (y ′ A �= y′ B ) In a Mermin’s game [=-=Mermin 1990-=-] there are three players. Each player i receives a bit xi as input and outputs a bit yi. The promise is that the sum of the inputs is even. The players win the game if the parity of the sum of the ou... |

27 | Quantum weakest preconditions - D’Hondt, Panangaden - 2006 |

26 | Quantum cryptography: Public key distribution and coin tossing - Bennet, Brassard - 1984 |

21 | A categorical quantum logic
- Abramsky, Duncan
- 2006
(Show Context)
Citation Context ...lgebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, =-=Abramsky and Duncan 2006-=-, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Pa... |

21 | A process algebraic approach to concurrent and distributed computation: operational semantics
- Lalire, Jorrand
(Show Context)
Citation Context ...al. 2006]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, =-=Lalire and Jorrand 2004-=-, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of ... |

18 | Quantum pseudo-telepathy
- Brassard, Broadbent, et al.
(Show Context)
Citation Context ... |101〉 + |110〉)/2 (y0y1y2) ′ | 2 + (x0 + x1 + x2 = 2)× |(|001〉 + |010〉 + |100〉 + |111〉)/2 (y0y1y2) ′ | 2 == y ′ 0 + y′ 1 + y′ 2 = (x0 + x1 + x2)/2 mod 2 3.4. Parity Games application In parity games [=-=Brassard et al. 2003-=-, Brassard et al. 2005, Buhrman et al. 2003] there are at least three players. Each player i is given a number αi : 0, ..2 l , or, equivalently, an l-bit binary string. The promise is that � i : 0, ..... |

17 |
A limit on nonlocality in any world in which communication complexity is not trivial
- Brassard, Buhrman, et al.
(Show Context)
Citation Context ...antum pseudotelepathy games are considered one of the best and easiest to understand examples of these non-classical phenomena (e.g. [Galliard et al. 2003, Brassard et al. 2004, Brassard et al. 2005, =-=Brassard et al. 2006-=-]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, Lalire a... |

17 | Quantum typing - Valiron - 2004 |

16 | Toward a quantum process algebra
- Jorrand, Lalire
- 2004
(Show Context)
Citation Context ...ches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, =-=Jorrand and Lalire 2004-=-], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, ... |

15 |
Operational semantics for a formal tensorial calculus
- Arrighi, Dowek
- 2004
(Show Context)
Citation Context ... Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [=-=Arrighi and Dowek 2004-=-, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Panangaden 2004, D’Hondt and Panangaden 2005], [Danos et al. 2005], and [Gay and... |

13 | Distributed quantum computing: A distributed Shor algorithm. http://arxiv.org/quant-ph/0403146
- Yimsiriwattana, Jr
- 2004
(Show Context)
Citation Context ...d a formal framework for specifying, implementing, and analyzing quantum pseudo-telepathy games. Current research focuses on formal reasoning about complexity of distributed quantum algorithms (e.g. [=-=Yimsiriwattana and Jr 2004-=-]). Research in the immediate future will focus on simple proofs and analysis of programs involving communication, both via quantum channels and exhibiting the LOCC (local operations, classical commun... |

12 | The impossibility of pseudo-telepathy without quantum entanglement
- Galliard, Wolf, et al.
- 2003
(Show Context)
Citation Context ...y non-classical behaviour produced by quantum mechanics. Today, quantum pseudotelepathy games are considered one of the best and easiest to understand examples of these non-classical phenomena (e.g. [=-=Galliard et al. 2003-=-, Brassard et al. 2004, Brassard et al. 2005, Brassard et al. 2006]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process... |

10 |
A process algebra for reasoning about quantum security
- Adão, Mateus
- 2007
(Show Context)
Citation Context ...al. 2005, Brassard et al. 2006]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [=-=Adao and Mateus 2007-=-, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004],... |

10 | The logic of entanglement - Coecke |

8 |
High-level methods for quantum computation and information
- Abramsky
- 2004
(Show Context)
Citation Context ...0, Zuliani 2004, Zuliani 2005], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [=-=Abramsky 2004-=-, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, ... |

8 | Recasting Mermin’s multi-player game into the framework of pseudo-telepathy”, Quantum Information and Computation, to appear. Preprint available at http://arxiv.org/abs/quant-ph/0408052 - Brassard, Broadbent, et al. |

7 | Distributed measurement-based quantum computation - Danos, D’Hondt, et al. - 2005 |

5 | Reasoning about quantum knowledge - D’Hondt, Panangaden |

5 | Quantum Programming
- Tafliovich
- 2004
(Show Context)
Citation Context ....g. implementability) and implementations (e.g. time and space complexity). In this work the analysis on quantum non-locality is based on quantum predicative programming ([Tafliovich and Hehner 2006, =-=Tafliovich 2004-=-]), a recent generalization of the well-established predicative programming ([Hehner 1993, Hehner 2004]). It supports the style of program development in which each programming step is proved correct ... |

4 | Minimum entangled state dimension required for pseudotelepathy, arXiv:quant-ph/0412136
- Brassard, Méthot, et al.
- 2004
(Show Context)
Citation Context ...our produced by quantum mechanics. Today, quantum pseudotelepathy games are considered one of the best and easiest to understand examples of these non-classical phenomena (e.g. [Galliard et al. 2003, =-=Brassard et al. 2004-=-, Brassard et al. 2005, Brassard et al. 2006]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, Zuliani 2005], process algebraic approaches ... |

4 |
Combinatorics and quantum nonlocality
- Buhrman, Høyer, et al.
(Show Context)
Citation Context ...+ x2 = 2)× |(|001〉 + |010〉 + |100〉 + |111〉)/2 (y0y1y2) ′ | 2 == y ′ 0 + y′ 1 + y′ 2 = (x0 + x1 + x2)/2 mod 2 3.4. Parity Games application In parity games [Brassard et al. 2003, Brassard et al. 2005, =-=Buhrman et al. 2003-=-] there are at least three players. Each player i is given a number αi : 0, ..2 l , or, equivalently, an l-bit binary string. The promise is that � i : 0, ..n · αi is divisible by 2 l . Each player ou... |

4 | Linear-algebraic λ-calculus - Arrighi, Dowek - 501 |

4 | Pauli measurements are universal - Danos, Kashefi - 2005 |

3 |
The logic of entanglement. quant-ph/0402014
- Coecke
- 2004
(Show Context)
Citation Context ...5], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and =-=Coecke 2004-=-, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, Arrighi and Dowek 2005, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well ... |

3 | Compiling quantum programs, Acta Informatica 41 - Zuliani - 2005 |

3 | Multi-party pseudo-telepathy, in - Brassard, Broadbent, et al. |

2 |
Quantum programming with mixed states, in
- Zuliani
(Show Context)
Citation Context ... [Galliard et al. 2003, Brassard et al. 2004, Brassard et al. 2005, Brassard et al. 2006]).sFormal approaches to quantum programming include the language qGCL [Sanders and Zuliani 2000, Zuliani 2004, =-=Zuliani 2005-=-], process algebraic approaches developed in [Adao and Mateus 2007, Lalire and Jorrand 2004, Jorrand and Lalire 2004], tools developed in the field of category theory by [Abramsky 2004, Abramsky and C... |

2 | A probability perspective, Formal Aspects of Computing (2009 - Hehner |

1 |
G.: Linear-algebraic lambda-calculus
- Arrighi, Dowek
- 2005
(Show Context)
Citation Context ...], tools developed in the field of category theory by [Abramsky 2004, Abramsky and Coecke 2004, Abramsky and Duncan 2006, Coecke 2004, Selinger 2004], functional languages of [Arrighi and Dowek 2004, =-=Arrighi and Dowek 2005-=-, Altenkirch and Grattage 2005, Valiron 2004, van Tonder 2004], as well as work of [D’Hondt and Panangaden 2004, D’Hondt and Panangaden 2005], [Danos et al. 2005], and [Gay and Nagarajan 2005]. A deta... |

1 | Available free atwww.cs.utoronto.ca/ ∼ hehner/ aPToP - edn - 2007 |

1 |
a Practical Theory of Programming. First edn
- Hehner
- 1993
(Show Context)
Citation Context ...d space complexity). In this work the analysis on quantum non-locality is based on quantum predicative programming ([1, 2]), a recent generalization of the well-established predicatives2 programming (=-=[3,4]-=-). It supports the style of program development in which each programming step is proved correct as it is made. We inherit the advantages of the theory, such as its generality, simple treatment of rec... |

1 | Programming with quantum communication - Tafliovich, Hehner - 2009 |