Self-testing of a single quantum device under computational assumptions
summary
Constructs a protocol that self-tests an EPR pair and the device’s measurements for a single monolithic quantum device under the computational assumption that it cannot solve Learning with Errors during the run. It combines cryptographic tools from Mahadev with a remote state preparation subprotocol run in parallel, then requests a CNOT to turn certain product-state cases into Bell pairs; blindness forces consistent behavior across cases. Protocol is proven correct but has weak numerical robustness; it enables DIQKD variants.
AI-written summary · about
chapters (6)
- 0:00Introduction
- 1:17Device independence
- 3:15Noncommunication assumption
- 10:42Previous work
- 14:40First step
- 19:59Conclusion
related talks
44mDevice-Independent Protocols From Computational Assumptions
42mTests for "Quantumness"
36mFrom Photonic Quantum Cloud Computing to Interactive Proofs
39mBlind and Verifiable Quantum Computation
21mQuantum Internet in a Nutshell
32mQEC demonstrations leveraging dynamic circuits
55mFew Single-Qubit Measurements Suffice to Certify Any Quantum State
45mClassical Verification of Quantum Computational Advantage