On perfect completeness for QMA
From MaRDI portal
Recommendations
- Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
- Two QCMA-complete problems
- Stronger methods of making quantum interactive proofs perfectly complete
- Quantum versus classical proofs and advice
- Stronger methods of making quantum interactive proofs perfectly complete
Cited in
(13)- Characterising the intersection of QMA and coQMA
- Total functions in QMA
- QMA with subset state witnesses
- Quantum 3-SAT Is QMA₁-complete
- QMA with subset state witnesses
- Stronger methods of making quantum interactive proofs perfectly complete
- Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- "NON-IDENTITY-CHECK" IS QMA-COMPLETE
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum cryptography in Algorithmica
- A classical proof system for quantum unsatisfiability, based on a matrix Nullstellensatz
- Quantum sat problems with finite sets of projectors are complete for a plethora of classes
This page was built for publication: On perfect completeness for QMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605726)
