Characterising the intersection of QMA and coQMA
DOI10.1007/S11128-021-03326-3OpenAlexW3217385125MaRDI QIDQ2099640FDOQ2099640
Authors: Serge Massar, Miklos Santha
Publication date: 24 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03326-3
Recommendations
\textsc{coQMA}intersection of QMA and \textsc{coQMA}QMAquantum complexity classestotal functional QMA
Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- The complexity of computing a Nash equilibrium
- Quantum Arthur-Merlin games
- How easy is local search?
- On the complexity of the parity argument and other inefficient proofs of existence
- Settling the complexity of computing two-player Nash equilibria
- On total functions, existence theorems and computational complexity
- Towards a unified complexity theory of total functions
- Total functions in QMA
- Fast amplification of QMA
Cited In (1)
This page was built for publication: Characterising the intersection of QMA and coQMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099640)