Filters








46 Hits in 4.0 sec

Minimum entangled state dimension required for pseudo-telepathy [article]

Gilles Brassard, Andre A. Methot, Alain Tapp
2004 arXiv   pre-print
A game exhibits pseudo-telepathy if there is a quantum strategy that makes Alice and Bob win the game for all possible questions, provided they share prior entanglement, whereas it would be impossible  ...  In this paper, we show that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least 3x3.  ...  Acknowledgements The authors are grateful to Anne Broadbent and Serge Massar for helpful comments.  ... 
arXiv:quant-ph/0412136v2 fatcat:b6a4ks7pznbn7c67zmf66z7nli

New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring

L. Mancinska, G. Scarpa, S. Severini
2013 IEEE Transactions on Information Theory  
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets.  ...  Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring.  ...  Acknowledgements The authors thank Jop Briët, Will Matthews, Fernando de Melo, David Roberson, Antonis Varvitsiotis, and Ronald de Wolf for helpful discussions.  ... 
doi:10.1109/tit.2013.2248031 fatcat:2rghvxfezrcllpqwgexb2k5qb4

Winning strategies for pseudo-telepathy games using single non-local box [article]

Samir Kunkri, Guruprasad Kar, Sibasish Ghosh, Anirban Roy
2006 arXiv   pre-print
Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension.  ...  It is also shown that the magic square pseudo-telepathy game of any size can be won by using just two ebits of entanglement -- for quantum strategy, and by a single NL-box -- for non-local strategy.  ...  IMPOSSIBLE COLOURING PSEUDO-TELEPATHY GAME IN 4-DIMENSION We now turn this Kochen-Specker theorem in to a pseudo-telepathy game as suggested by Brassard et al. [13] .  ... 
arXiv:quant-ph/0602064v2 fatcat:qprdgw3bd5gsderbwkfm7h445a

Quantum Pseudo-Telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp
2005 Foundations of physics  
In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.  ...  After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and no-so-recent work on the subject.  ...  We are also grateful to Harry Buhrman and Iordanis Kerenidis for sharing their thoughts on the matching game.  ... 
doi:10.1007/s10701-005-7353-4 fatcat:howbgv7uxncgfi5hnjovqsgmie

Multi-party Pseudo-Telepathy [chapter]

Gilles Brassard, Anne Broadbent, Alain Tapp
2003 Lecture Notes in Computer Science  
We speak of pseudo-telepathy when quantum entanglement serves to eliminate the classical need to communicate.  ...  In earlier examples of pseudo-telepathy, classical protocols could succeed with high probability unless the inputs were very large.  ...  We are also grateful to Harry Buhrman and Iordanis Kerenidis for sharing their thoughts on the matching game.  ... 
doi:10.1007/978-3-540-45078-8_1 fatcat:vo5sxft2urewbld7hmfntdobka

Classical, Quantum and Non-signalling Resources in Bipartite Games

Gilles Brassard, Anne Broadbent, Esther Hanggi, Andre Allan Methot, Stefan Wolf
2008 Second International Conference on Quantum, Nano and Micro Technologies (ICQNM 2008)  
We also show that every pseudo-telepathy game yields both a proof of the Bell-Kochen-Specker theorem and an instance of a two-prover interactive proof system that is classically sound, but that becomes  ...  We discuss relations between quantum winning strategies and orthogonality graphs.  ...  Acknowledgements We thank Stefano Tessaro, Ben Toner and Gregor Weihs for helpful discussions.  ... 
doi:10.1109/icqnm.2008.18 dblp:conf/icqnm/BrassardBHMW08 fatcat:bjgmee3ccfettj24lwhh7kgyb4

Ernst Specker and the Hidden Variables

Renato Renner, Stefan Wolf
2012 Elemente der Mathematik  
His research domain lies in the fields of cryptography, information theory, and quantum information processing.  ...  before he became an SNF Professor for Quantum Information at ETH. He is now Professor at the Università della Svizzera italiana, USI.  ...  After the talk, Ernst Specker came up to the speaker and said "Sie haben schon recht, dies ist dasjenige Resultat, welches mich am längstenüberleben wird."  ... 
doi:10.4171/em/201 fatcat:vtcvsykopvdozn6du55dp4hnhq

MINIMAL BELL–KOCHEN–SPECKER PROOFS WITH POVMs ON QUBITS

ANDRÉ ALLAN MÉTHOT
2007 International Journal of Quantum Information  
There are many different definitions of what a Bell-Kochen-Specker proof with POVMs might be.  ...  Here we present and discuss the minimal proof on qubits for three of these definitions and show that they are indeed minimal.  ...  Since we know that there is a strong link between the conventional BKS proofs and pseudo-telepathy [9, 10] , often wrongly called a Bell theorem without inequalities [11] , one might wonder why we cannot  ... 
doi:10.1142/s0219749907002426 fatcat:xsjv6ubq25eqxi7di2novguw6u

Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number

Giannicola Scarpa, Simone Severini
2012 IEEE Transactions on Information Theory  
Finally, as a corollary of our results and a result by Avis, Hasegawa, Kikuchi, and Sasaki on the quantum chromatic number, we give a family of Kochen-Specker sets of growing dimension.  ...  Our main tools are Kochen-Specker sets, collections of vectors with a traditionally important role in the study of noncontextuality of physical theories, and more recently in the quantification of quantum  ...  The authors thank Ronald de Wolf for useful discussions and for reading preliminary versions of the paper.  ... 
doi:10.1109/tit.2011.2178018 fatcat:ao7fhmi2kfhdjlpxbxrbzkzzum

Minimal Bell-Kochen-Specker proofs with POVMs on qubits [article]

A. A. Methot
2005 arXiv   pre-print
There are many different definitions of what a Bell-Kochen-Specker proof with POVMs might be.  ...  Here we present and discuss the minimal proof on qubits for three of these definitions and show that they are indeed minimal.  ...  Since we know that there is a strong link between the conventional BKS proofs and pseudo-telepathy [9, 10] , often wrongly called a Bell theorem without inequalities [11] , one might wonder why we cannot  ... 
arXiv:quant-ph/0509199v1 fatcat:6bf6zcrywfaxtev6ftb73wjnmy

Quantum voting and its physical interpretation [article]

Woong-seon Yoo
2019 arXiv   pre-print
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory.  ...  We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present Gedankenexperiment of voting and Bell-like inequalities of voting.  ...  By no cloning theorem, the cloning operator does not exist, hence there is no dictator. Another proof can be stated with the Kochen-Specker set [7, 14] .  ... 
arXiv:1912.05356v1 fatcat:kydaughqnfcsna7z64hn7iekoi

On local-hidden-variable no-go theorems

A A Méthot
2006 Canadian journal of physics (Print)  
We will define Bell inequalities, Bell inequalities without inequalities and pseudo-telepathy. A discussion of the similarities and differences will follow.  ...  The strongest attack against quantum mechanics came in 1935 in the form of a paper by Einstein, Podolsky and Rosen.  ...  Acknowledgements The author would like to thank Gilles Brassard for many invaluable discussions on the subject and Anne Broadbent and Richard MacKenzie for very helpful comments.  ... 
doi:10.1139/p06-036 fatcat:fkrhwvj56raabeauyowrqcjp7e

Improving Zero-Error Classical Communication with Entanglement

Toby S. Cubitt, Debbie Leung, William Matthews, Andreas Winter
2010 Physical Review Letters  
In particular, we show how to construct such a channel based on any proof of the Bell-Kochen-Specker theorem.  ...  This is a new example of the use of quantum effects to improve the performance of a classical task. We investigate the connection between this phenomenon and that of "pseudo-telepathy" games.  ...  The BKS theorem tells us that such sets (of finite size in the proof of Kochen and Specker) exist for all d ≥ 3. Theorem 2.  ... 
doi:10.1103/physrevlett.104.230503 pmid:20867220 fatcat:vc2pdmzb5jhirjb6ulcclthn2q

On Orthogonal Vector Edge Coloring [article]

Ana Silva, Allen Ibiapina
2019 arXiv   pre-print
This notion has close ties with the notions of Lovász Theta Function, quantum chromatic number, and many other problems, and even though this and related metrics have been extensively studied over the  ...  In this article, we discuss this version and its relation with other insteresting known facts, and pose a question about the orthogonal chromatic index of cubic graphs.  ...  Examples where the inequality is strict are not easy to find, and up to our knowledge, all the known examples are related to quantum mechanics and pseudo-telepathy games.  ... 
arXiv:1909.01918v1 fatcat:tzodeeydyjg3zd4ip6j2e23gqu

Alice and Bob get away with it: A playlet

Anthony Sudbery
2007 American Journal of Physics  
Alice and Bob use Aravind's version of a Bell-Kochen-Specker paradox to fend off awkward questions about what exactly they were doing in Amsterdam last week.  ...  They ask if a story can be constructed around Aravind's recent version [4] of the Bell-Kochen-Specker theorem [5, 6] .  ...  This and similar applications of quantum entanglement have become known as "pseudo-telepathy.  ... 
doi:10.1119/1.2750380 fatcat:mpflpvejzzf7fdnqkwlgumtfka
« Previous Showing results 1 — 15 out of 46 results