The QMA Singularity
7 hours ago
- #Quantum Complexity
- #AI in Research
- #QMA
- Study on limitations of black-box amplification in QMA.
- Proof that doubly exponentially small completeness error is optimal for black-box procedures.
- Use of complex approximation theory for quantum oracle separation.
- QMA (Quantum Merlin Arthur) as the quantum version of NP.
- Open problem: whether QMA equals QMA1 (perfect completeness).
- 2008 result showing QMA ≠ QMA1 relative to a quantum oracle.
- 2025 breakthrough: black-box amplification to doubly exponentially small error.
- Lower bound matches the 2025 protocol, showing optimality.
- First paper using AI (GPT5-Thinking) for a key technical step.
- AI suggested a rational function to analyze eigenvalues, proving crucial for the result.