Resolves 25-year-old open problems by proving QIP(2), qq-QAM, QAM, and QMA achieve perfect completeness. Introduces endpoint-inward turn-halving transformation that halves message complexity while preserving completeness guarantees.

#QuantumProofs #QuantumComplexity #QuantumInformation

Researchers proved QMA=QMA1, demonstrating quantum Merlin-Arthur proof systems can achieve perfect completeness without sacrificing computational power using a universal gate set of Hadamard, Toffoli, and X gates.

#QuantumComplexity #QuantumProofs #Research