Efficient Verification of Pure Quantum States in the Adversarial Scenario
Huangjun Zhu, Masahito Hayashi

TL;DR
This paper introduces a general framework and a practical recipe for verifying pure quantum states efficiently in adversarial scenarios, significantly advancing quantum verification methods.
Contribution
It establishes a comprehensive framework for adversarial quantum state verification and provides a universal recipe to adapt nonadversarial protocols for adversarial settings.
Findings
Verification protocols achieve near-equal efficiency in adversarial and nonadversarial scenarios.
Many quantum states can be verified using local projective measurements with high efficiency.
The framework reduces resource costs for adversarial quantum state verification.
Abstract
Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary pure states can be verified in the adversarial scenario with almost the same efficiency as in the nonadversarial scenario. Many important quantum states can be verified in the adversarial scenario using local projective measurements with unprecedented high efficiencies.
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.
