QMA with subset state witnesses
From MaRDI portal
Publication:2808530
DOI10.4086/CJTCS.2016.004zbMATH Open1356.68081OpenAlexW2970305865MaRDI QIDQ2808530FDOQ2808530
Authors: Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora 
Publication date: 24 May 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2016.004
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Proof verification and the hardness of approximation problems
- Probabilistic checking of proofs
- Two-Message Quantum Interactive Proofs Are in PSPACE
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
- Title not available (Why is that?)
- On perfect completeness for QMA
- Two QCMA-complete problems
Cited In (6)
- On the power of a unique quantum witness
- Quantum vs. classical proofs and subset verification
- QMA with subset state witnesses
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- StoqMA meets distribution testing
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
This page was built for publication: QMA with subset state witnesses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808530)
