GPT-5 model helps crack one of quantum computing’s most stubborn open problems

undefined 30, 2025

Source: interestingengineering

Researchers used GPT-5 to help prove strict limits in quantum complexity theory’s QMA class. In QMA, proofs come as quantum states verified by algorithms. Amplification methods improve accuracy, but it was unknown if completeness could surpass doubly exponential closeness to 1. GPT-5 suggested reframing with a key function, enabling a proof that completeness can’t exceed doubly exponential and soundness can’t drop below exponential. The result sets hard limits and marks a rare AI-aided breakthrough in quantum theory.

Share on