Separating non-interactive classical verification of quantum computation from falsifiable assumptions
From MaRDI portal
Cites work
- A distribution testing oracle separating QMA and QCMA
- Advances in Cryptology - CRYPTO 2003
- Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification
- Classical verification of quantum computations
- Classical verification of quantum computations in linear time
- Classical verification of quantum computations with efficient verifier
- Computationally-secure and composable remote state preparation
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Les probabilités dénombrables et leurs applications arithmétiques.
- Non-interactive classical verification of quantum computation
- On black-box separations of quantum digital signatures from pseudorandom states
- On lattices, learning with errors, random linear codes, and cryptography
- Probability-1
- Secure quantum computation with classical communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Sulla probabilità come limite della frequenza.
- Zur Theorie der Gesellschaftsspiele.
This page was built for publication: Separating non-interactive classical verification of quantum computation from falsifiable assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443372)