Minimum full nonlocality, all versus nothing nonlocality, and quantum
pseudo telepathy
- URL: http://arxiv.org/abs/2311.17735v1
- Date: Wed, 29 Nov 2023 15:38:38 GMT
- Title: Minimum full nonlocality, all versus nothing nonlocality, and quantum
pseudo telepathy
- Authors: Ad\'an Cabello
- Abstract summary: We show that the simplest bipartite FN/AVN/PT is equivalent to a specific type of Kochen-Specker (KS) set.
This scenario is small enough to allow observation of qutrit-qutrit FN/AVN/PT and to connect the Bell and KS theorems in one experiment.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Full nonlocality (FN) is the strongest form of nonlocality and plays a
crucial role in quantum information and computation. It has been recently shown
that FN, all versus nothing (AVN) nonlocality, and pseudo telepathy (PT) are
equivalent, and this has led to advance in the long-standing open problem of
what is the simplest form of bipartite FN/AVN/PT. It has been shown that
bipartite FN/AVN/PT is impossible in Bell scenarios with small input and output
cardinalities and that existing tools cannot help answer whether it is possible
in larger scenarios. Here, we prove that FN/AVN/PT is equivalent to a specific
type of Kochen-Specker (KS) set and, by exploring all known KS sets with small
cardinality, we show that, arguably, (i) the simplest bipartite FN/AVN/PT is
the correlation in Phys. Rev. Lett. 87, 010403 (2001), and (ii) the simplest
bipartite FN/AVN/PT in the simplest bipartite quantum system that allows for
FN/AVN/PT, which is a pair of qutrits, happens when Alice (Bob) has 9 (7)
measurements of 3 outcomes. This scenario is small enough to allow observation
of qutrit-qutrit FN/AVN/PT and to connect the Bell and KS theorems in one
experiment.
Related papers
- Optimal quantum violations of n-locality inequalities with conditional
dependence on inputs [0.0]
Bell experiment in the network gives rise to a form of quantum nonlocality which is conceptually different from traditional multipartite Bell nonlocality.
We introduce an elegant sum-of-squares approach that enables the optimization in quantum theory without specifying the dimension of the quantum system.
arXiv Detail & Related papers (2023-11-08T11:51:04Z) - Impossibility of bipartite full nonlocality, all-versus-nothing proofs,
and pseudo-telepathy in small Bell scenarios [3.1981483719988235]
We show that according to quantum mechanics, nature does not allow for FN/AVN/PT in the (3,3;3,2) Bell scenario.
We also study (3,3;3,3) and found no example of FN/AVN/PT.
arXiv Detail & Related papers (2023-10-16T17:28:29Z) - Small sets of genuinely nonlocal GHZ states in multipartite systems [0.0]
A set of multipartite quantum states are called (distinguishability-based) genuinely nonlocal if they are locally indistinguishable across any bipartition of the subsystems.
In this work, we consider the problem of constructing small genuinely nonlocal sets consisting of generalized GHZ states in multipartite systems.
arXiv Detail & Related papers (2023-08-14T14:27:51Z) - Bell inequalities with overlapping measurements [52.81011822909395]
We study Bell inequalities where measurements of different parties can have overlap.
This allows to accommodate problems in quantum information.
The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
arXiv Detail & Related papers (2023-03-03T18:11:05Z) - Nonlocality under Computational Assumptions [51.020610614131186]
A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations.
We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
arXiv Detail & Related papers (2023-03-03T16:53:30Z) - Towards a minimal example of quantum nonlocality without inputs [0.41942958779358674]
In the network scenario, it is possible to demonstrate quantum nonlocality without the need for measurements inputs.
We present examples involving output cardinalities of $3-3-3$ and $3-3-2$.
arXiv Detail & Related papers (2022-07-18T11:50:56Z) - Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof.
We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
arXiv Detail & Related papers (2022-03-30T18:00:00Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Single-photon nonlocality in quantum networks [55.41644538483948]
We show that the nonlocality of single-photon entangled states can nevertheless be revealed in a quantum network made only of beamsplitters and photodetectors.
Our results show that single-photon entanglement may constitute a promising solution to generate genuine network-nonlocal correlations useful for Bell-based quantum information protocols.
arXiv Detail & Related papers (2021-08-03T20:13:24Z) - Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [0.0]
We show that noisy N-partite GHZ quantum states as well as the 3-partite W quantum state can produce such correlations.
This proves, if the operational predictions of quantum theory are correct, that Nature's nonlocality must be boundlessly multipartite in any causal GPT.
arXiv Detail & Related papers (2021-05-19T20:05:55Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.