Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2206.02324 · Physical Review A

Experimental implementation of Hardy-like quantum pigeonhole paradoxes

Shihao Ru, Cen-Xiao Huang, Xiao‐Min Hu, Chao Zhang, Feiran Wang, Ni Liu, Weidong Tang, Pei Zhang, Bi‐Heng Liu, Fuli Li

Published Feb 9, 2023• 3 citations
arXivHTMLPDF

Abstract

The general Hardy-like quantum pigeonhole paradoxes for n-qubit states were presented by Tang [W. Tang, Phys. Rev. A 105, 032457 (2022)]. It has been shown that each of such paradoxes can be associated with an uncolorable solution of a specific vertex-coloring problem induced from the projected-coloring graph (a kind of unconventional graph). The Hardy-like quantum pigeonhole paradoxes can even give rise to a higher suc- cess probability in demonstrating the conflict between quantum mechanics and local or noncontextual realism than the previous Hardy's paradoxes. Moreover, multiqubit states and high-dimensional states can exhibit paradoxes. In contrast to only one type of contradiction presented in the original quantum pigeonhole paradox, we discussed two kinds of three-qubit projected-coloring graph states as the minimal illustration in our work. An optical experiment to verify such a stronger paradox is performed. This quantum paradox provides innovative thoughts and methods for exploring new types of stronger multiparty quantum nonlocality. It may have potential applications in untrusted multiparty communications and device-independent random number generation.

DOI
10.1103/physreva.107.022207

Related papers

Hardy-like quantum pigeonhole paradox and the projected-coloring graph state

Weidong Tang

A Hardy-like version of the quantum pigeonhole paradox is proposed, which can also be considered as a special kind of Hardy's paradox. Besides an example induced from the minimal system, a general construction of this paradox from an $n$-qubit quantum state is also discussed. Moreover, by introducing the projected-coloring graph and the projected-coloring graph state, a pictorial representation of the Hardy-like quantum pigeonhole paradox can be presented. This Hardy-like version of the quantum pigeonhole paradox can be implemented more directly in experiment than the original one, since it does not require some sophisticated techniques such as weak measurements. In addition, from the angle of Hardy's paradox, some Hardy-like quantum pigeonhole paradoxes may be able to set a new record for the success probability of demonstrating Bell nonlocality.

arXiv:2103.08194•Physical Review A•Mar 31, 2022•5 citations

Generalized Hardy’s Paradox

Shuhan Jiang, Zhen‐Peng Xu, Hong-Yi Su +2 more

Here, we present the most general framework for n-particle Hardy's paradoxes, which include Hardy's original one and Cereceda's extension as special cases. Remarkably, for any n≥3, we demonstrate that there always exist generalized paradoxes (with the success probability as high as 1/2^{n-1}) that are stronger than the previous ones in showing the conflict of quantum mechanics with local realism. An experimental proposal to observe the stronger paradox is also presented for the case of three qubits. Furthermore, from these paradoxes we can construct the most general Hardy's inequalities, which enable us to detect Bell's nonlocality for more quantum states.

arXiv:1709.09812•Physical Review Letters•Jan 30, 2018•45 citations

Stronger Hardy-type paradox based on the Bell inequality and its experimental test

Mu Yang, Hui-Xian Meng, Jie Zhou +7 more

Local realistic models cannot completely describe all predictions of quantum mechanics. This is known as Bell's theorem that can be revealed either by violations of Bell inequality, or all-versus-nothing proof of nonlocality. Hardy's paradox is an important all-versus-nothing proof and is considered as ``the simplest form of Bell's theorem.'' In this work, we advance the study of Hardy's paradox based on Bell's inequality. Our formalism is essentially equivalent to the ``logical Bell inequality'' formalism developed by Abramsky and Hardy, but ours is more easily applied to experimental tests. Remarkably, we find that not only for a two-qubit two-setting case but also for a two-qubit four-setting case, we can construct stronger Hardy-type paradoxes based on Bell's inequality, whose successful probabilities can attain four times and seven times larger than the original one, respectively, thus providing more friendly tests for experiment. Meanwhile, we experimentally test the stronger Hardy-type paradoxes in a two-qubit system. Within the experimental errors, the experimental results coincide with the theoretical predictions.

arXiv:1809.04289•Physical Review A•Mar 5, 2019•26 citations

A New Error-Modeling of Hardy’s Paradox for Superconducting Qubits and Its Experimental Verification

Soumya Das, Goutam Paul

Hardy’s paradox (equivalently, Hardy’s non-locality or Hardy’s test) [Phys. Rev. Lett. 68, 2981 (1992)] is used to show non-locality without inequalities, and it has been tested several times using optical circuits. We, for the first time, experimentally test Hardy’s paradox of non-locality in superconducting qubits. For practical verification of Hardy’s paradox, we argue that the error-modeling used in optical circuits is not useful for superconducting qubits. So, we propose a new error-modeling for Hardy’s paradox and a new method to estimate the lower bound on Hardy’s probability (i.e., the probability of a specific event in Hardy’s test) for superconducting qubits. Our results confirmed the theory that any non-maximally entangled state of two qubits violates Hardy’s equations; whereas, any maximally entangled state and product state of two qubits do not exhibit Hardy’s non-locality. Further, we point out the difficulties associated with the practical implementation of quantum protocols based on Hardy’s paradox and propose possible remedies. We also propose two performance measures for any two qubits of any quantum computer based on superconducting qubits.

arXiv:1712.04925•ACM Transactions on Quantum Computing•Jul 7, 2020•12 citations

Realigned Hardy’s paradox

Shuai Zhao, Qing Zhou, Si-Ran Zhao +7 more

Hardy’s paradox provides an “All-versus-Nothing” fashion to directly certify that quantum mechanics cannot be completely described by local realistic theory. However, when considering potential imperfections in experiments, like noisy entanglement source and low detection efficiency, the original Hardy’s paradox can only induce a rather small Hardy violation, and is difficult to reveal. To overcome this challenge, we have proposed a realigned Hardy’s paradox, which can dramatically improve the Hardy violation. Furthermore, we have generalized the realigned Hardy’s paradox to arbitrary even n dichotomic measurements. For n=2, 4 and 6 cases, the realigned Hardy’s paradox can achieve Hardy values approximate 0.4140, 0.7734 and 0.8875 respectively for qubit systems, compared with only 0.09 of the original Hardy’s paradox. Meanwhile, the structure of the realigned Hardy’s paradox is simpler and more robust, in the sense that there is only one Hardy condition. We anticipate that the realigned Hardy’s paradox can tolerate more experimental imperfections and help to stimulate more fascinating quantum information applications.

arXiv:2211.13642•Results in Physics•Nov 23, 2023•0 citations

Experimental test of Hardy's paradox on a five-qubit quantum computer

Soumya Das, Goutam Paul

We test Hardy's paradox of non-locality experimentally on the IBM five-qubit quantum computer for the first time. The quantum circuit is constructed on superconducting qubits corresponding to the original Hardy's test of non-locality. Results confirmed the theory that any non-maximally entangled state of two qubits violates Hardy's Equations, whereas any maximally entangled state and product state of two qubits do not exhibit Hardy's non-locality. We also point out the difficulties associated with the practical implementation of any Hardy's paradox based quantum protocol and propose three performance measures for any two qubits of any quantum computer.

•Dec 13, 2017•8 citations
The general Hardy-like quantum pigeonhole paradoxes for n-qubit states were presented by Tang [W. Tang, Phys. Rev. A 105, 032457 (2022)]. It has been shown that each of such paradoxes can be associated with an uncolorable solution of a specific vertex-coloring problem induced from the projected-coloring graph (a kind of unconventional graph). The Hardy-like quantum pigeonhole paradoxes can even give rise to a higher suc- cess probability in demonstrating the conflict between quantum mechanics and local or noncontextual realism than the previous Hardy's paradoxes. Moreover, multiqubit states and high-dimensional states can exhibit paradoxes. In contrast to only one type of contradiction presented in the original quantum pigeonhole paradox, we discussed two kinds of three-qubit projected-coloring graph states as the minimal illustration in our work. An optical experiment to verify such a stronger paradox is performed. This quantum paradox provides innovative thoughts and methods for exploring new types of stronger multiparty quantum nonlocality. It may have potential applications in untrusted multiparty communications and device-independent random number generation.
A Hardy-like version of the quantum pigeonhole paradox is proposed, which can also be considered as a special kind of Hardy's paradox. Besides an example induced from the minimal system, a general construction of this paradox from an nnn-qubit quantum state is also discussed. Moreover, by introducing the projected-coloring graph and the projected-coloring graph state, a pictorial representation of the Hardy-like quantum pigeonhole paradox can be presented. This Hardy-like version of the quantum pigeonhole paradox can be implemented more directly in experiment than the original one, since it does not require some sophisticated techniques such as weak measurements. In addition, from the angle of Hardy's paradox, some Hardy-like quantum pigeonhole paradoxes may be able to set a new record for the success probability of demonstrating Bell nonlocality.
Here, we present the most general framework for n-particle Hardy's paradoxes, which include Hardy's original one and Cereceda's extension as special cases. Remarkably, for any n≥3, we demonstrate that there always exist generalized paradoxes (with the success probability as high as 1/2^{n-1}) that are stronger than the previous ones in showing the conflict of quantum mechanics with local realism. An experimental proposal to observe the stronger paradox is also presented for the case of three qubits. Furthermore, from these paradoxes we can construct the most general Hardy's inequalities, which enable us to detect Bell's nonlocality for more quantum states.
Local realistic models cannot completely describe all predictions of quantum mechanics. This is known as Bell's theorem that can be revealed either by violations of Bell inequality, or all-versus-nothing proof of nonlocality. Hardy's paradox is an important all-versus-nothing proof and is considered as ``the simplest form of Bell's theorem.'' In this work, we advance the study of Hardy's paradox based on Bell's inequality. Our formalism is essentially equivalent to the ``logical Bell inequality'' formalism developed by Abramsky and Hardy, but ours is more easily applied to experimental tests. Remarkably, we find that not only for a two-qubit two-setting case but also for a two-qubit four-setting case, we can construct stronger Hardy-type paradoxes based on Bell's inequality, whose successful probabilities can attain four times and seven times larger than the original one, respectively, thus providing more friendly tests for experiment. Meanwhile, we experimentally test the stronger Hardy-type paradoxes in a two-qubit system. Within the experimental errors, the experimental results coincide with the theoretical predictions.
Hardy’s paradox (equivalently, Hardy’s non-locality or Hardy’s test) [Phys. Rev. Lett. 68, 2981 (1992)] is used to show non-locality without inequalities, and it has been tested several times using optical circuits. We, for the first time, experimentally test Hardy’s paradox of non-locality in superconducting qubits. For practical verification of Hardy’s paradox, we argue that the error-modeling used in optical circuits is not useful for superconducting qubits. So, we propose a new error-modeling for Hardy’s paradox and a new method to estimate the lower bound on Hardy’s probability (i.e., the probability of a specific event in Hardy’s test) for superconducting qubits. Our results confirmed the theory that any non-maximally entangled state of two qubits violates Hardy’s equations; whereas, any maximally entangled state and product state of two qubits do not exhibit Hardy’s non-locality. Further, we point out the difficulties associated with the practical implementation of quantum protocols based on Hardy’s paradox and propose possible remedies. We also propose two performance measures for any two qubits of any quantum computer based on superconducting qubits.
Hardy’s paradox provides an “All-versus-Nothing” fashion to directly certify that quantum mechanics cannot be completely described by local realistic theory. However, when considering potential imperfections in experiments, like noisy entanglement source and low detection efficiency, the original Hardy’s paradox can only induce a rather small Hardy violation, and is difficult to reveal. To overcome this challenge, we have proposed a realigned Hardy’s paradox, which can dramatically improve the Hardy violation. Furthermore, we have generalized the realigned Hardy’s paradox to arbitrary even n dichotomic measurements. For n=2, 4 and 6 cases, the realigned Hardy’s paradox can achieve Hardy values approximate 0.4140, 0.7734 and 0.8875 respectively for qubit systems, compared with only 0.09 of the original Hardy’s paradox. Meanwhile, the structure of the realigned Hardy’s paradox is simpler and more robust, in the sense that there is only one Hardy condition. We anticipate that the realigned Hardy’s paradox can tolerate more experimental imperfections and help to stimulate more fascinating quantum information applications.
We test Hardy's paradox of non-locality experimentally on the IBM five-qubit quantum computer for the first time. The quantum circuit is constructed on superconducting qubits corresponding to the original Hardy's test of non-locality. Results confirmed the theory that any non-maximally entangled state of two qubits violates Hardy's Equations, whereas any maximally entangled state and product state of two qubits do not exhibit Hardy's non-locality. We also point out the difficulties associated with the practical implementation of any Hardy's paradox based quantum protocol and propose three performance measures for any two qubits of any quantum computer.