← Latest papers
⚛️ quantum physics

The Low-Individual-Degree Test Without the Diagonal-Lines Test Is Not Quantum-Sound

This paper demonstrates that the diagonal-lines test is essential for the quantum soundness of the low-individual-degree test and cannot be removed without an alternative compatibility mechanism, thereby showing that a proposed simplification in the MIP*=RE proof does not preserve the required soundness.

Original authors: Tianrun Zhao

Published 2026-09-14
📖 6 min read🧠 Deep dive

Original authors: Tianrun Zhao

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 authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the strange and counterintuitive world of quantum computing, scientists often rely on a clever trick to verify that a machine is doing what it claims to be doing. Imagine a game where two players, who cannot communicate with each other, are asked questions about a massive, complex pattern. To prove they are truly following a single, consistent set of rules, they must answer in a way that lines up perfectly. In the classical world, if their answers match up along every straight line drawn through the pattern, we can be sure they are describing one single, global object. This logic is the foundation of "low-degree tests," a tool used to check if local answers come from a single global polynomial, a mathematical shape that curves gently rather than twisting wildly.

However, the quantum world is far more slippery. In quantum mechanics, the act of measuring a system can change it, and different measurements might not be compatible with one another. This means two players sharing a quantum state might give answers that look perfect when checked along specific directions, yet fail to represent a single, coherent reality. For years, researchers believed that checking consistency along horizontal and vertical lines was enough to guarantee this global harmony, even in the quantum realm. They thought that if the answers aligned perfectly on these grid-like paths, the underlying quantum measurements must be working together correctly. This belief was crucial for a major breakthrough in computer science that proved quantum computers could solve problems previously thought impossible.

A researcher has now shown that this belief is incorrect. They demonstrated that checking only the horizontal and vertical lines is not enough to force the quantum players to agree on a single global truth. By constructing a specific quantum strategy, they proved that two players can pass every test involving these straight lines with perfect scores, yet still be fundamentally disconnected from one another. Their answers would look consistent on the grid, but the underlying quantum measurements would fail to align in the way required for a true global solution. This finding means that a specific check, known as the diagonal-lines test, cannot be removed from the verification process without adding a different mechanism to ensure the players are truly compatible.

The researcher built this counterexample using a mathematical landscape defined by a finite field, a system where numbers wrap around after reaching a certain prime number. They designed a strategy where two players share a maximally entangled quantum state, a special connection that links their actions regardless of distance. In this setup, the players are asked to provide answers for points and lines within a two-dimensional grid. The rules of their game require them to report values that match a polynomial of a specific degree. The researcher engineered their quantum measurements so that whenever a player is asked about a point on a horizontal or vertical line, their answer perfectly matches the polynomial reported for that entire line. They also ensured that if both players are asked about the same point, they always give the exact same answer.

Despite this flawless performance on all the standard checks, the strategy fails the ultimate test of global consistency. The researcher calculated that the players' measurements do not commute, meaning the order in which they are performed changes the outcome, a sign that they are not describing a single, unified reality. Specifically, they showed that the average error in this alignment is not a tiny, negligible number that vanishes as the system grows larger. Instead, the error remains stubbornly high, bounded away from zero by a constant value. Even as the grid becomes infinitely large, the players remain a fixed distance away from being able to describe a single global polynomial. This proves that the diagonal-lines test, which checks consistency along slanted paths, is not just a redundant step but a necessary component to catch this specific type of quantum deception.

The construction relies on a clever mapping of points to vectors in a higher-dimensional space, using a specific mathematical formula that ensures the measurements align perfectly along rows and columns but clash whenever both coordinates change. This creates a situation where the players are locally consistent but globally incompatible. The researcher confirmed that this failure is not a fluke of a single calculation but a fundamental obstruction. They showed that no matter what global measurement a third party tries to use to verify the players' answers, the strategy will always fail to match that global view by a significant margin. This result forces a reevaluation of how we verify quantum computations, confirming that we cannot simply assume that local consistency on a grid implies global truth.

This work does not suggest that quantum computers are broken or that the major result they helped prove is false. Rather, it clarifies the precise conditions needed to make that result hold. The original proof that quantum computers can solve these hard problems relied on a test that included the diagonal lines. This paper confirms that removing that part of the test would have been a mistake. The diagonal check is the missing piece that forces the quantum players to stop acting like independent local actors and start behaving as part of a single, coherent whole. Without it, the illusion of a global polynomial can be maintained even when the underlying reality is fractured.

The implications reach beyond just this one test. The study highlights a deep difference between the classical and quantum worlds. In the classical world, if you check a pattern along every straight line, you know the whole picture is consistent. In the quantum world, you must check along the diagonals as well to be sure. The researcher's work serves as a reminder that in the quantum realm, what looks perfect from one angle can be deeply flawed from another. Their proof is rigorous and complete, leaving no room for doubt that the diagonal-lines test is essential for the soundness of these quantum verification protocols. It closes the door on a potential shortcut in quantum verification, ensuring that future proofs remain built on a foundation that is truly solid.

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 →