Non-interactive classical verification of quantum computation

DOI10.1007/978-3-030-64381-2_6zbMath1487.81033arXiv1911.08101OpenAlexW3117113271MaRDI QIDQ2119074

Shih-Han Hung, Andrew M. Childs, Gorjan Alagic, Alex Bredariol Grilo

Publication date: 23 March 2022

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

Mathematics Subject Classification ID

Quantum computation (81P68) Derivative securities (option pricing, hedging, etc.) (91G20) Quantum channels, fidelity (81P47)

Related Items (11)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Multi-theorem designated-verifier NIZK for QMA ⋮ Constant-round blind classical verification of quantum sampling ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Succinct classical verification of quantum computation ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ 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 ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

This page was built for publication: Non-interactive classical verification of quantum computation