Unconditional verification of quantum computation with classical light
Yuki Takeuchi, Akihiro Mizutani

TL;DR
This paper introduces a classical-light-based verification protocol for quantum computation, eliminating the need for quantum communication and enabling efficient, unconditional verification of quantum computer outputs.
Contribution
It proposes a novel verification method that uses classical light, removing the requirement for quantum communication between verifier and quantum computer.
Findings
Verification protocol using classical light is feasible.
Unconditional detection of malicious quantum behavior is achieved.
Protocol simplifies quantum verification processes.
Abstract
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate quantum communication to unconditionally detect any malicious behavior of the quantum computer solving any promise problem in . In this paper, we remove the necessity of the communication of qubits by proposing a "physically classical" verification protocol in which the verifier just sends coherent light to the quantum computer.
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
