Self-testing GHZ state via a Hardy-type paradox
Smritikana Patra, Soumyajit Pal, Ranendu Adhikary

TL;DR
This paper introduces a self-testing protocol for the GHZ state using a Hardy-type paradox, demonstrating maximal Hardy success probability as an extremal quantum correlation and analyzing robustness against imperfections.
Contribution
It presents a novel Hardy-based self-testing method for GHZ states, linking Hardy's paradox with Bell inequalities and exploring robustness and higher-party extensions.
Findings
Maximal Hardy success probability corresponds to an extremal quantum correlation.
The correlation achieving maximal Hardy violation also maximizes Mermin inequality violation.
The protocol is robust against experimental imperfections.
Abstract
Self-testing is a correlation-based framework that enables the certification of both the underlying quantum state and the implemented measurements without imposing any assumptions on the internal structure of the devices. In this work, we introduce a self-testing protocol for the Greenberger-Horne-Zeilinger (GHZ) state based on a natural generalization of Hardy's nonlocality argument. Within this framework, we prove that the correlation achieving the maximal Hardy success probability constitutes an extremal point of the quantum correlation set and, moreover, that this point is \emph{exposed}. To address experimentally relevant imperfections, we further develop a robust self-testing analysis tailored to the Hardy construction. Additionally, we show that, in this scenario, the quantum correlation that attains the maximal violation of the Hardy-type paradox coincides with the correlation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
