Quantum interactive oracle proofs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6866338 (Why is no real title available?)
- scientific article; zbMATH DE number 7561521 (Why is no real title available?)
- A toolbox for barriers on interactive oracle proofs
- Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification
- Commitments to quantum states
- Constant-round interactive proofs for delegating computation
- Entanglement in Interactive Proof Systems with Binary Answers
- Interactive oracle proofs
- NLTS Hamiltonians from good quantum codes
- Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably
- Probabilistic checking of proofs
- Product-state approximations to quantum ground states
- Proof verification and the hardness of approximation problems
- Quantum advantage from any non-local game
- Succinct classical verification of quantum computation
- The PCP theorem by gap amplification
- The detectability lemma and quantum gap amplification
- Verification of quantum computation: an overview of existing approaches
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Zero-knowledge proof systems for GMA
This page was built for publication: Quantum interactive oracle proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233220)