TY - GEN
T1 - Quantum Advantage from Any Non-local Game
AU - Kalai, Yael
AU - Lombardi, Alex
AU - Vaikuntanathan, Vinod
AU - Yang, Lisa
N1 - Publisher Copyright: © 2023 Owner/Author.
PY - 2023/6/2
Y1 - 2023/6/2
N2 - We show a general method of compiling any k-prover non-local game into a single-prover (computationally sound) interactive game maintaining the same quantum completeness and classical soundness guarantees, up to a negligible additive factor in a security parameter. Our compiler uses any quantum homomorphic encryption scheme (Mahadev, FOCS 2018; Brakerski, CRYPTO 2018) satisfying a natural form of correctness with respect to auxiliary quantum input. The homomorphic encryption scheme is used as a cryptographic mechanism to simulate the effect of spatial separation, and is required to evaluate k-1 prover strategies out of k on encrypted queries. In conjunction with the rich literature on (entangled) multi-prover non-local games starting from the celebrated CHSH game (Clauser, Horne, Shimony and Holt, Physical Review Letters 1969), our compiler gives a broad and rich framework for constructing protocols that classically verify quantum advantage.
AB - We show a general method of compiling any k-prover non-local game into a single-prover (computationally sound) interactive game maintaining the same quantum completeness and classical soundness guarantees, up to a negligible additive factor in a security parameter. Our compiler uses any quantum homomorphic encryption scheme (Mahadev, FOCS 2018; Brakerski, CRYPTO 2018) satisfying a natural form of correctness with respect to auxiliary quantum input. The homomorphic encryption scheme is used as a cryptographic mechanism to simulate the effect of spatial separation, and is required to evaluate k-1 prover strategies out of k on encrypted queries. In conjunction with the rich literature on (entangled) multi-prover non-local games starting from the celebrated CHSH game (Clauser, Horne, Shimony and Holt, Physical Review Letters 1969), our compiler gives a broad and rich framework for constructing protocols that classically verify quantum advantage.
KW - Quantum computational advantage
KW - cryptographic protocols
KW - non-local games
KW - quantum homomorphic encryption
UR - http://www.scopus.com/inward/record.url?scp=85163064185&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85163064185&partnerID=8YFLogxK
U2 - 10.1145/3564246.3585164
DO - 10.1145/3564246.3585164
M3 - Conference contribution
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 1617
EP - 1628
BT - STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing
A2 - Saha, Barna
A2 - Servedio, Rocco A.
PB - Association for Computing Machinery
T2 - 55th Annual ACM Symposium on Theory of Computing, STOC 2023
Y2 - 20 June 2023 through 23 June 2023
ER -