Classical verification of quantum computations with efficient verifier

DOI10.1007/978-3-030-64381-2_7zbMath1487.81039arXiv1912.00990OpenAlexW3097889110MaRDI QIDQ2119076

Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa

Publication date: 23 March 2022

Full work available at URL: https://arxiv.org/abs/1912.00990

Mathematics Subject Classification ID

Quantum computation (81P68) Critical points of functionals in context of PDEs (e.g., energy functionals) (35B38)

Related Items (7)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Constant-round blind classical verification of quantum sampling ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Succinct classical verification of quantum computation ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Secure quantum computation with classical communication ⋮ The round complexity of quantum zero-knowledge

This page was built for publication: Classical verification of quantum computations with efficient verifier