How to Classically Verify a Quantum Cat without Killing It
This research solves a major problem in verifying quantum computation classically: how to verify a quantum proof (QMA witness) without destroying it. The goal was to create verification protocols that use only one copy of the witness while still achieving high accuracy. The solution uses post-quantum hardness assumptions to transform existing protocols into new ones that preserve the witness, meaning verification can be done repeatedly without needing multiple copies of the original quantum state.