A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Maximally entangled states in pseudo-telepathy games
[article]
2015
arXiv
pre-print
Preserved Fulltext
Our results also imply that any pseudo-telepathy weak projection game yields a device-independent certification of a maximally entangled state. ...
Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. ...
Additionally, we have characterized pseudo-telepathy games which admit perfect strategies with a maximally entangled state. ...
arXiv:1506.07080v1
fatcat:bgj2cnslqndm3dtd5m3k2vptby
PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES
2007
International Journal of Quantum Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
number of questions required in a bipartite pseudo-telepathy game, is 3 × 3. ...
First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal ...
This violation can be obtained the tensor product of two maximally entangled states of two qubits [14] , which is equivalent to the maximally entangled state of two 4-dimensional systems; therefore, this ...
doi:10.1142/s021974990700289x
fatcat:ped7ad247bftnacohigk2wz3cm
Pseudo-telepathy: input cardinality and Bell-type inequalities
[article]
2006
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
number of questions required in a bipartite pseudo-telepathy game, is 3x3. ...
First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal ...
This violation can be obtained the tensor product of two maximally entangled states of two qubits [14] , which is equivalent to the maximally entangled state of two 4-dimensional systems; therefore, this ...
arXiv:quant-ph/0610175v1
fatcat:6mvl47pojzgipfsvk7sq3abi3y
Minimum entangled state dimension required for pseudo-telepathy
[article]
2004
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
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. ...
Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. ...
The optimal pseudo-telepathy game, in terms of the total dimension of the required entangled state, is a three-player game of dimension 2 × 2 × 2. Proof. ...
arXiv:quant-ph/0412136v2
fatcat:b6a4ks7pznbn7c67zmf66z7nli
On the power of non-local boxes
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Here, we show that the non-local box can in fact do much more: through the simulation of the magic square pseudo-telepathy game and the Mermin-GHZ pseudo-telepathy game, we show that the non-local box ...
In particular, we show quantum correlations whose simulation requires an exponential amount of non-local boxes, in the number of maximally entangled qubit pairs. ...
This work is supported in part by Canada's NSERC. ...
doi:10.1016/j.tcs.2005.08.035
fatcat:gbnywqdo7bcwfdbfegixsu5qpq
The impossibility of pseudotelepathy without quantum entanglement
2003
IEEE International Symposium on Information Theory, 2003. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This means that for fulfilling this particular distributed task, quantum entanglement can completely replace communication. This phenomenon has been called pseudo-telepathy. ...
It is known that this task can be fulfilled without failure and without communication if Alice and Bob share 4 maximally entangled quantum bits. ...
Introduction
Pseudo-Telepathy Games Pseudo-telepathy is a phenomenon showing that for achieving certain welldefined distributed tasks, communication can be replaced by measuring shared quantum states ...
doi:10.1109/isit.2003.1228474
fatcat:ty6mjrjjtzd47ogphstyyl2ai4
Quantum Pseudo-Telepathy
2005
Foundations of physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors. ...
Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. ...
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
On local-hidden-variable no-go theorems
2006
Canadian journal of physics (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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. ...
An example of a pseudo-telepathy game We present here the pseudo-telepathy game generally known as the Magic Square game [17] . ...
doi:10.1139/p06-036
fatcat:fkrhwvj56raabeauyowrqcjp7e
Multi-party Pseudo-Telepathy
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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
New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
2013
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1207.1111v1 fatcat:dcomk4ik6na35med2cwkouz6duOther Versions
Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring. ...
We further show that from any graph with separation between these two quantities, one can construct a classical channel for which entanglement assistance increases the one-shot zero-error capacity. ...
In Theorem 20 in the appendix, we show that projective KS sets correspond precisely to a class of pseudo-telepathy games that quantum players can win using projective measurements on maximally entangled ...
doi:10.1109/tit.2013.2248031
fatcat:2rghvxfezrcllpqwgexb2k5qb4
Enhancing Pseudo-Telepathy in the Magic Square Game
2013
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show the benefits of our method using the quantum pseudo-telepathy Magic Square game with noise. Our strategy is to move the pseudo-telepathy region to higher noise values. ...
As an example of usage of this optimization scheme we present the quantum pseudo-telepathy magic square game. We obtained results showing an improvement in the players' success rate in the game. ...
Finally, they perform a measurement on the ancillary qubits, leaving their starting qubits in a less noisy state. ...
doi:10.1371/journal.pone.0064694
pmid:23762246
pmcid:PMC3675112
fatcat:6pypdebkyzduvaz7cudw3yjzgu
Winning strategies for pseudo-telepathy games using single non-local box
[article]
2006
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
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. ...
Quantum pseudo-telepathy game is something which can not be won in the classical world without communication but can be won in the quantum world using entangled state without any use of classical communication ...
arXiv:quant-ph/0602064v2
fatcat:qprdgw3bd5gsderbwkfm7h445a
Can quantum mechanics help distributed computing?
[article]
2008
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements Thanks to Idit Keidar for inviting us to write this survey which, we hope, will create awareness of quantum computation in the community. ...
More formally, a pseudo-telepathy game is a distributed k-player game where the players can agree on a strategy and can share entanglement. ...
Pseudo-telepathy The term pseudo-telepathy originates from the authors of [17] (although it does not appear in the paper). ...
arXiv:0810.5317v1
fatcat:ek6qzmv25nesjc2mwphsnewft4
Graph-theoretical Bounds on the Entangled Value of Non-local Games
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. ...
The upper bound uses the famous Lov\'asz theta number and is efficiently computable; the lower one is based on the quantum independence number, which is a quantity used in the study of entanglement-assisted ...
Let G be a pseudo-telepathy game with a 0-1 valued predicate λ, admitting a quantum strategy consisting of a maximally entangled state |ψ and pairwise commuting projectors. ...
arXiv:1404.3640v1
fatcat:ajdwahhplrdezhbqsbt37bfyzi
Entanglement swapping, light cones and elements of reality
2007
Physics Letters A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
are in the same light cone, i.e. belong to a single participant. ...
Our conclusion is that, in both cases, the proposed experiments are not convincing proofs against local realism. ...
This work is supported in part by Canada's Nserc. ...
doi:10.1016/j.physleta.2006.12.023
fatcat:5lghn7cyqzfurjgygq62xnuvim
« Previous
Showing results 1 — 15 out of 148 results