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

Springer eBooks

Hardy Paradox

Antonio Acín

Published Jan 1, 2009• 0 citations
Publisher
DOI
10.1007/978-3-540-70626-7_83

Related papers

Hardy's paradox

Robert B. Griffiths

Cambridge University Press eBooks•Nov 29, 2001•0 citations

Hardy's Paradox revisted

DG Collins, Sandu Popescu

•Jan 1, 2004•0 citations

Experimental test of generalized Hardy’s paradox

Yi-Han Luo, Hong-Yi Su, He-Liang Huang +7 more

arXiv:1808.04966•中国科学通报:英文版•Dec 1, 2018•21 citations

Can Parallel Lives Provide a Solution to Hardy’s Paradox?

İnanç Şahin

arXiv:2009.07633•Foundations of Physics•Feb 1, 2021•4 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

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
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.
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.