Experimental implementation of Hardy-like quantum pigeonhole paradoxes

Abstract

We present the general Hardy-like quantum pigeonhole paradoxes for \textit{n}-particle states, and find that each of such paradoxes can be simply associated to an un-colorable solution of a specific vertex-coloring problem induced from the projected-coloring graph (a kind of unconventional graph). Besides, as a special kind of Hardy's paradox, several kinds of Hardy-like quantum pigeonhole paradoxes can even give rise to higher success probability in demonstrating the conflict between quantum mechanics and local or noncontextual realism than the previous Hardy's paradoxes. Moreover, not only multi-qubit states, but high-dimensional states can exhibit the paradoxes. In contrast to only one type of contradiction presented in the original quantum pigeonhole paradox, two kinds of three-qubit projected-coloring graph states as the minimal illustration are discussed in our work, and an optical experiment to verify such stronger paradox is performed. This quantum paradox provides innovative thoughts and methods in exploring new types of stronger multi-party quantum nonlocality and may have potential applications in multi-party untrusted communications and device-independent random number generation.

11 pages, 5 figures

References in corpus (8)

• The Quantum Internet
• Towards a global quantum network
• A classification of entanglement in three-qubit systems
• Pre- and Post-selection paradoxes and contextuality in quantum mechanics
• Pre- and post-selection, weak values, and contextuality
• Greenberger-Horne-Zeilinger paradoxes from qudit graph states
• Hardy-like Quantum Pigeonhole Paradox and the Projected-Coloring Graph State
• Construction of State-independent Proofs for Quantum Contextuality