Quick Navigation
Topics
Superconducting Qubits
A new error-modeling of Hardy's paradox for superconducting qubits and its experimental verification
arXiv
Authors: Soumya Das, Goutam Paul
Year
2017
Paper ID
24524
Status
Preprint
Abstract Read
~2 min
Abstract Words
180
Citations
N/A
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. 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.
Why This Paper Matters
- This paper contributes to the Superconducting Qubits research area in the Quantum Articles archive.
- It adds a 2017 reference point for readers tracking recent quantum research.
- Hardy's paradox (equivalently, Hardy's non-locality or Hardy's test) [hrefhttps://link.aps.org/doi/10.1103/PhysRevLett.68.2981L.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.