Deterministic all-versus-nothing proofs of Bell nonlocality based on non-stabilizer states
arXiv:2201.01886 · doi:10.1088/1367-2630/acdd8b
Abstract
The all-versus-nothing proof of Bell nonlocality is a kind of mainstream demonstration of Bell's theorem without inequalities. Two kinds of such proofs, called the deterministic all-versus-nothing proof and the probabilistic all-versus-nothing proof, are both widely investigated. So far, all previous deterministic all-versus-nothing proofs of Bell nonlocality are constructed based on stabilizer states. To break with this tradition, some deterministic all-versus-nothing proofs induced from non-stabilizer states are firstly presented in this work. These results not only can greatly enrich the family of the demonstration of Bell nonlocality without inequalities, but also may provide us some useful resources in certain quantum information processing.
arXiv comment16 pages and 4 figures
References in corpus (16)
- Bell nonlocality
- Observation of three-photon Greenberger-Horne-Zeilinger entanglement
- Non-locality and Communication Complexity
- Substituting Quantum Entanglement for Communication
- Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation
- Bell's theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger and W states
- Long-Distance Measurement-Device-Independent Multiparty Quantum Communication
- Guess your neighbour's input: a multipartite non-local game with no quantum advantage
- A resource theory of superposition
- Bell's theorem without inequalities and without probabilities for two observers
- "All-versus-nothing" nonlocality test of quantum mechanics by two-photon hyperentanglement
- Greenberger-Horne-Zeilinger paradoxes for many qudits
- Multi-setting Greenberger-Horne-Zeilinger Paradoxes
- Experimental Test of Irreducible Four-Qubit Greenberger-Horne-Zeilinger Paradox
- Greenberger-Horne-Zeilinger argument of nonlocality without inequalities for mixed states
- Hardy-like Quantum Pigeonhole Paradox and the Projected-Coloring Graph State