← Latest papers
⚛️ quantum physics

Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA

This paper introduces the Codeword-Hash pairs in Noise problem to establish a classical oracle separation where the QCMA hierarchy collapses to P while QMA remains distinct, thereby demonstrating that quantum proofs can offer advantages and that various quantum cryptographic primitives can exist even in a world where P equals QCMA.

Original author: Alper Cakan

Published 2026-11-20
📖 5 min read🧠 Deep dive

Original author: Alper Cakan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the author. For technical accuracy, refer to the original paper. Read full disclaimer

In the world of computing, there is a long-standing debate about the nature of proof and the power of information. For decades, scientists have distinguished between two types of verification. One type relies on a classical witness, which is essentially a piece of written information, like a password or a checklist, that a computer can read and check to confirm a solution is correct. The other type relies on a quantum witness, which is a fragile state of matter, existing in a superposition of possibilities, that must be held in a quantum computer to be verified. The central question has been whether the quantum version offers a genuine advantage over the classical one. If a problem can be solved efficiently by a classical computer once given the right classical proof, does it still require a quantum state to be verified? This question sits at the heart of understanding the limits of what computers can do, specifically whether the ability to manipulate quantum states allows us to solve problems that are fundamentally out of reach for classical machines, even when those machines are given the best possible hints.

A researcher has now constructed a theoretical world where the answer is a definitive yes. They have demonstrated that it is possible to have a scenario where classical computers are incredibly powerful—so powerful that they can solve any problem that can be verified with a classical proof—yet quantum computers still hold a unique advantage. In this constructed reality, a classical computer can efficiently solve any problem that admits a classical proof, meaning the gap between classical and quantum verification power has vanished for standard proofs. However, the researcher showed that there remains a class of problems that can only be verified if the prover possesses a specific quantum state. This discovery proves that the advantage of quantum states is not merely a byproduct of classical computers being slow or limited; it is an intrinsic property of the quantum state itself. Even if classical machines were to become as powerful as quantum machines in terms of what they can compute, the quantum state would still offer a unique capability that classical information cannot replicate.

To reach this conclusion, the researcher introduced a new mathematical puzzle they call "Codeword-Hash pairs in Noise." Imagine a vast, noisy field where most of the ground is covered in random static. Hidden within this static are specific, structured patterns that look like a secret code. The puzzle is to determine whether the field contains these hidden patterns or if it is just random noise. The researcher showed that a verifier equipped with a specific quantum state can easily find these patterns and confirm their existence. However, they proved that no verifier relying solely on classical information, no matter how many layers of complexity or logic they are allowed to use, can distinguish the hidden patterns from the random noise with any reliability. This result was achieved by creating a theoretical "oracle," which acts like a black box that answers questions. They built this box in such a way that it collapses the power of classical verification to its absolute limit, yet the quantum state remains the only key that can unlock the truth.

The implications of this finding extend beyond abstract theory into the realm of cryptography, the science of secure communication. For years, it was believed that the security of modern encryption relied on the difficulty of certain mathematical problems for classical computers. If a classical computer could solve these problems, the encryption would break. However, the researcher showed that even in a world where classical computers are all-powerful and can solve any problem that has a classical proof, it is still possible to build secure cryptographic systems that rely on quantum states. They demonstrated the existence of several such systems, including digital signatures and encryption schemes where the secret keys are quantum states. These keys possess a unique property called "copy-protection." Unlike a classical key, which can be copied perfectly and shared with anyone, a quantum key cannot be duplicated without destroying its original function. This means that even if a classical computer could solve every other problem in the universe, it could not copy these quantum keys to forge signatures or decrypt messages.

The researcher constructed these systems by encoding the secret information into the very structure of the quantum states they used. They showed that an adversary, even with access to a classical computer that is as powerful as a quantum one, could not extract the secret information without destroying the state itself. This creates a scenario where security is guaranteed not by the difficulty of a calculation, but by the laws of physics that govern quantum information. The study confirms that quantum cryptography can exist independently of classical cryptography. It suggests that the future of secure communication might not depend on keeping classical computers slow, but rather on harnessing the unique, uncopyable nature of quantum states. This work provides a rigorous proof that the power of quantum information is fundamental and cannot be erased, even in a world where classical computation has reached its theoretical peak.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →