Quantum verification of NP problems with single photons and linear optics
Aonan Zhang, Hao Zhan, Junjie Liao, Kaimin Zheng, Tao Jiang, Minghao, Mi, Penghui Yao, Lijian Zhang

TL;DR
This paper demonstrates a quantum verification protocol for NP problems, specifically SAT, using single photons and linear optics, showcasing potential for scalable optical quantum computing and quantum advantage.
Contribution
It presents the first implementation of a quantum SAT verification machine with single photons and linear optics, enabling efficient verification of satisfiable and unsatisfiable instances.
Findings
Successfully verified SAT instances with optical setup
Achieved a clear completeness-soundness gap despite imperfections
Protocol is scalable and requires only unentangled photons and linear operations
Abstract
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the satisfiability of potentially conflict constraints (SAT). According to the well-founded exponential time hypothesis, verifying an SAT instance of size requires generally the complete solution in an -bit proof. In contrast, quantum verification algorithms, which encode the solution into quantum bits rather than classical bit strings, can perform the verification task with quadratically reduced information about the solution in qubits. Here we realize the quantum verification machine of SAT with single photons and linear optics. By using tunable optical setups, we efficiently verify satisfiable and unsatisfiable SAT instances…
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.
