Succinct classical verification of quantum computation
From MaRDI portal
Publication:6104334
DOI10.1007/978-3-031-15979-4_7zbMath1527.81030arXiv2206.14929MaRDI QIDQ6104334
James Bartusek, Vinod Vaikuntanathan, Fermi Ma, Giulio Malavolta, Lisa Yang, Yael Tauman Kalai, Thomas Vidick, Alex Lombardi
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.14929
Quantum computation (81P68) Polylogarithms and relations with (K)-theory (11G55) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- Classical proofs of quantum knowledge
- Non-interactive classical verification of quantum computation
- Classical verification of quantum computations with efficient verifier
- Constant-round blind classical verification of quantum sampling
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Lossy trapdoor functions and their applications
- A Framework for Efficient and Composable Oblivious Transfer
- The knowledge complexity of interactive proof-systems
- Quantum Complexity Theory
- Verifying quantum computations at scale: A cryptographic leash on quantum devices
- How to use indistinguishability obfuscation
- Computationally Binding Quantum Commitments