Quantum vs. classical proofs and subset verification
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485488 (Why is no real title available?)
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum computations: algorithms and error correction
- Quantum lower bound for the collision problem
- Quantum lower bounds by quantum arguments
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum versus classical proofs and advice
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Sharp quantum versus classical query complexity separations
Cited in
(15)- The quantum adversary method and classical formula size power bounds
- QMA with subset state witnesses
- QMA with subset state witnesses
- Quantum versus classical proofs and advice
- Classical verification of quantum proofs
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Oracle separation of QMA and QCMA with bounded adaptivity
- A computational separation between quantum no-cloning and no-telegraphing
- Classical vs quantum advice and proofs under classically-accessible oracle
- Classical verification of quantum learning
- A qubit, a coin, and an advice string walk into a relational problem
- On the fine-grained query complexity of symmetric functions
- On the fine-grained query complexity of symmetric functions
- Untelegraphable encryption and its applications
- Quantum search with in-place queries
This page was built for publication: Quantum vs. classical proofs and subset verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005122)
