A new error-modeling of Hardy's paradox for superconducting qubits and its experimental verification
arXiv:1712.04925 · doi:10.1145/3396239
Abstract
Hardy's paradox (equivalently, Hardy's non-locality or Hardy's test) [\href{https://link.aps.org/doi/10.1103/PhysRevLett.68.2981}{L. Hardy, Phys. Rev. Lett. \textbf{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.
References in corpus (10)
- A Quantum Engineer's Guide to Superconducting Qubits
- Quantum computing with trapped ions
- Validating quantum computers using randomized model circuits
- Device-independent quantum key distribution secure against collective attacks
- Research on Hidden Variable Theories: a review of recent progresses
- Suppression of photon shot noise dephasing in a tunable coupling superconducting qubit
- Light-matter entanglement over 50 km of optical fibre
- Hybrid quantum linear equation algorithm and its experimental test on IBM Quantum Experience
- Coherence in quantum error-correcting codes
- Experimental realization of quantum cheque using a five-qubit quantum computer