Classical Verification of Quantum Computations

DOI10.1137/20M1371828zbMath1500.81019arXiv1804.01082OpenAlexW2796036215MaRDI QIDQ5096105

Urmila Mahadev

Publication date: 12 August 2022

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

cryptographyquantum computinginteractive proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Cryptography (94A60) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Quantum algorithm design: techniques and applications

Cites Work

• Unnamed Item
• Unnamed Item
• New bounds in some transference theorems in the geometry of numbers
• Learning with Rounding, Revisited
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Classical Homomorphic Encryption for Quantum Circuits
• Realizable Hamiltonians for universal adiabatic quantum computers
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
• Universal Blind Quantum Computation
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Classical Verification of Quantum Computations