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.
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.
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.
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 non-locality provides a proof of the incompatibility between quantum mechanics and local realism without using Bell inequalities. While this argument has been extensively studied for two- and three-qubit systems, a detailed analysis of the four-qubit case is still lacking. In this work, we investigate Hardy’s non-locality for a four-qubit system within the standard two-setting framework. We explicitly construct the entangled state satisfying the Hardy conditions and determine the measurement settings that maximize the success probability. • We present an explicit analytical construction of a four-qubit Hardy state together with the corresponding projective measurement settings. • The maximum Hardy success probability for four qubits is found to be 0.143, exceeding the values obtained in the two- and three-qubit cases. • The resulting state is non-maximally entangled and exhibits genuine multipartite quantum correlations.
Violation of Mermin inequalities is tested on the five-qubit IBM quantum computer. For three, four, and five parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum circuits on superconducting qubits. Measurements on different bases are included as additional final gates in the circuits. The experimental results obtained using the quantum computer show violation of all Mermin inequalities, with a clear degradation of the results in the five-qubit case. Though this quantum computer is not competitive to test Mermin inequalities as compared to other techniques when applied to a few qubits, it does offer the opportunity to explore multipartite entanglement for four and five qubits beyond the reach of other alternative technologies.
Bell's theorem states that the quantum mechanical description of physical quantities cannot be fully explained by local realistic theories, laying a solid basis for various quantum information applications. Hardy's paradox is celebrated as the simplest form of Bell's theorem concerning its "All versus Nothing" approach to test local realism. However, due to experimental imperfections, existing tests of Hardy's paradox require additional assumptions of the experimental systems, and these assumptions constitute potential loopholes for faithfully testing local realistic theories. Here, we experimentally demonstrate Hardy's nonlocality through a photonic entanglement source. By achieving a detection efficiency of 82.2%, a quantum state fidelity of 99.10%, and applying high-speed quantum random number generators for the measurement setting switching, the experiment is implemented in a loophole-free manner. During 6 h of running, a strong violation of P_{Hardy}=4.646×10^{-4} up to 5 standard deviations is observed with 4.32×10^{9} trials. A null hypothesis test shows that the results can be explained by local realistic theories with an upper bound probability of 10^{-16348}. These testing results provide affirmative evidence against local realism, and establish an advancing benchmark for quantum information applications based on Hardy's paradox.
Nonlocality can be studied through different approaches, such as Bell's inequalities, and it can be found in numerous quantum states, including GHZ states or graph states. Hardy's paradox, or Hardy-type nonlocality, provides a way to investigate nonlocality for entangled states of particles without using inequalities. Previous studies of Hardy's nonlocality have mostly focused on the fully entangled systems, while other entanglement configurations remain less explored. In this work, the system under investigation consists of four particles arranged in a cyclic entanglement configuration, where each particle forms entangled pairs with two neighbors, while non-neighboring particles remain unentangled. We found that this entanglement structure offers a larger set of conditions that lead to the contradiction with the LHV model, compared to the fully entangled systems. This enhancement can be attributed to the presence of multiple excluded states and correlations, in which the measurement result of a particle only influences the result of its paired partners. We implement quantum circuits compatible with the cyclic entanglement structure, and through simulation, the correlation patterns and the states of interest are identified. We further execute the proposed circuits on IBM Brisbane, a practical backend; however, the results show considerable deviations from the simulation counterparts.