Parallel self-testing of EPR pairs under computational assumptions
Honghao Fu, Daochen Wang, Qi Zhao

TL;DR
This paper presents a parallel self-testing protocol for multiple EPR pairs in a single quantum device under computational assumptions, enabling efficient certification of quantum states and measurements with classical communication.
Contribution
It extends previous work to parallel self-testing of multiple EPR pairs in a single device, under computational assumptions, with applications in quantum cryptography and cloud quantum computing.
Findings
Achieves high success probability with polynomial resources
Any device failing the test is close to honest in the appropriate sense
Enables certification of multiple qubits with only classical communication
Abstract
Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to force untrusted quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under computational assumptions. In this work, we generalize their results to give the first parallel self-test of EPR pairs and measurements on them in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to by an honest quantum device using poly resources. Moreover, we show that any quantum device that fails our protocol with probability at most must be poly-close to being honest…
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.
