⚛️ quantum physics

The right entanglement for perfect nonlocality and zero-error communication

This paper introduces a "Flagged Magic-Square" game that self-tests a specific non-maximally entangled state, demonstrating that such states can achieve perfect nonlocality and enable superior zero-error communication over classical channels compared to maximally entangled states.

Original authors: Laura Mančinska

Published 2026-10-06

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Laura Mančinska

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 world of quantum physics, particles can become linked in a way that defies our everyday experience. When two particles are "entangled," a change to one instantly affects the other, no matter how far apart they are. For decades, scientists believed that the strongest possible link between two particles—a state where they are perfectly balanced and identical in their connection, known as a maximally entangled state—would always be the best tool for any task requiring this quantum connection. It seemed logical that the most powerful resource would be the most useful one. However, a new study challenges this long-held assumption, showing that in certain specific scenarios, a less perfect, unbalanced connection is actually required to succeed.

This research, led by Laura Mančinska at the University of Copenhagen, explores the limits of these quantum connections through a series of logical puzzles called nonlocal games. Imagine a game where two players, separated and unable to communicate, must answer questions in a way that satisfies a set of rules. If they share quantum entanglement, they can sometimes win these games with a certainty that is impossible for classical players. The central question was whether the perfectly balanced, maximally entangled state was always the key to winning these games with 100% certainty. The answer, according to this new work, is a definitive no. The researchers have constructed a specific game where winning perfectly is impossible if the players use a perfectly balanced connection, but becomes possible if they use a specific, unbalanced one.

To prove this, the team designed a new game based on a classic puzzle known as the Magic Square. In the original version, two players fill a grid of numbers to satisfy row and column rules, and they can win every time if they share a specific type of quantum link. The researchers expanded this game by adding a "flag" outcome and extra questions that act as a bridge between the players' answers. They found that to win this new, more complex game every single time, the players must share a quantum state where the connection is not uniform. Specifically, the strength of the link between the particles must follow a precise pattern: one part of the connection is weaker, while four other parts are stronger and equal to each other. This unbalanced state allows the players to cancel out the errors that would otherwise cause them to lose.

The study provides a rigorous mathematical proof that no matter how large or complex the perfectly balanced quantum state is, it cannot be used to win this specific game perfectly. The researchers demonstrated that the geometry of the game's rules creates a conflict that a balanced connection cannot resolve. In contrast, the unbalanced connection they identified acts like a precise tuning fork, adjusting the quantum probabilities just enough to eliminate the losing outcomes. This is a significant finding because it proves that the "perfect" resource is not always the "optimal" resource. In fact, the paper shows that the unbalanced state is not just helpful, but strictly necessary for perfect play in this scenario.

Beyond the game itself, the researchers showed that this discovery has real consequences for how information is sent. They developed a method to translate the rules of their quantum game into a system for sending messages over a noisy classical channel without any errors. In this communication scenario, the players act as a sender and a receiver trying to transmit ten distinct messages perfectly. The study proves that if they use the specific unbalanced quantum state, they can successfully send all ten messages. However, if they are limited to using any kind of perfectly balanced quantum state, they can send at most nine messages. This demonstrates that for certain communication tasks, the unbalanced entanglement is a superior resource, allowing for the transmission of more information than the traditionally "perfect" state ever could.

The work also introduces a new way to verify the state of quantum systems, a process known as self-testing. In quantum technology, it is often difficult to know exactly what state two particles are in without destroying them. The new game acts as a test that forces the players to use the specific unbalanced state if they want to win. If they win every time, it proves they must be using that exact unbalanced connection. This provides a powerful tool for certifying that quantum devices are working correctly and using the right resources. The researchers suggest that this method of adding constraints to rigid game structures could be used to create tests for many other specific quantum states, opening a modular path to understanding and verifying complex quantum resources.

Ultimately, this paper reshapes our understanding of quantum advantage. It moves beyond the idea that more entanglement or a more perfect balance is always better. Instead, it reveals that the structure of a task can demand a very specific, sometimes unbalanced, type of connection. The findings show that nature does not always favor the most symmetric solution; sometimes, the key to perfection lies in a carefully calibrated imperfection. This insight not only solves a theoretical puzzle about the nature of quantum games but also offers a practical guide for designing better quantum communication systems, proving that the right tool for the job is not always the most powerful one, but the one that fits the specific shape of the problem.

Technical Summary: The Right Entanglement for Perfect Nonlocality and Zero-Error Communication

Problem Statement
The paper addresses the phenomenon where "more nonlocality" can be achieved with "less entanglement," specifically investigating whether maximally entangled states are universally optimal for nonlocal tasks. While it is established that non-maximally entangled states can outperform maximally entangled ones in scenarios with imperfect completeness, it remained an open question whether such a separation persists in the regime of perfect completeness (pseudo-telepathy). Specifically, the author asks:

Can a two-party pseudo-telepathy game self-test a specific non-maximally entangled state?
What structural mechanism forces a particular non-maximal entanglement spectrum?
Are maximally entangled states sufficient for optimal one-shot zero-error communication over noisy classical channels?

Methodology
The author constructs a novel nonlocal game, the Flagged Magic-Square game ( $G_{FMS}$ ), by extending the standard Magic-Square game. The construction introduces:

Bridge Questions: Two additional questions ( $T_0, T_1$ for Alice; $U_0, U_1$ for Bob) for each player.
Flag Outcome: An additional answer option ( $\perp$ ) for the standard questions.
Verification Constraints:
- Calibration Constraints: Link bridge questions to specific Magic-Square measurement directions ( $c_0, c_1, r_0, r_1$ ) to enforce specific overlaps.
- Frustrated Sign Constraints (CHSH-like): Require that for specific sign answer pairs, the product of signs matches a parity condition. Crucially, the "losing" sign pairs correspond to non-orthogonal vectors in the standard inner product.

The author analyzes the winning conditions using operator algebra and rigidity arguments. They demonstrate that for a perfect strategy to exist, the "losing" amplitudes must cancel out. This cancellation requires a specific weighting of the Schmidt coefficients that is incompatible with a uniform (maximally entangled) distribution.

To connect nonlocal games to communication, the paper establishes a game-to-channel reduction. Given a game $G$ , they construct a classical channel whose confusability graph is defined by the game's question-answer pairs. They prove that a perfect strategy for $G$ corresponds exactly to an optimal zero-error code for the constructed channel, preserving the Schmidt rank and the nature of the entanglement (maximal vs. non-maximal).

Key Contributions and Results

Existence of a Perfect Non-Maximally Entangled Strategy:
The author exhibits a perfect strategy for $G_{FMS}$ using a 5-dimensional state with Schmidt coefficients proportional to $(1, \sqrt{2}, \sqrt{2}, \sqrt{2}, \sqrt{2})$ . The uniform spectrum over the last four dimensions corresponds to the two EPR pairs required for the standard Magic-Square game, while the first dimension acts as a "flag."
Impossibility of Perfect Play with Maximally Entangled States:
The paper provides a direct algebraic proof that no maximally entangled state of any dimension can win $G_{FMS}$ with probability 1.
- Mechanism: The game's rigidity forces the measurement directions to align with vectors having an overlap of magnitude $1/\sqrt{2}$ . In a maximally entangled state, the weighted inner product for the "losing" sign pairs does not vanish. However, with the specific Schmidt ratio of $\sqrt{2}$ , the weighted inner product vanishes exactly, allowing perfect play.
- Result: $\omega^*(G_{FMS}) = 1 > \omega_{ME}(G_{FMS})$ , where $\omega_{ME}$ is the supremum winning probability over all maximally entangled strategies.
Exact Self-Testing:
The game $G_{FMS}$ is shown to self-test the specific non-maximally entangled state and the associated measurements. This answers the first research question affirmatively, providing a template for certifying specific entanglement spectra via pseudo-telepathy. The construction is modular: any rigid pseudo-telepathy game can be extended in this manner to self-test a state with a specific Schmidt spectrum determined by the overlaps of the base game's measurement vectors.
Separation in Zero-Error Communication:
Applying the game-to-channel reduction to $G_{FMS}$ yields a 50-input classical channel.
- With the specific non-maximally entangled state, the channel can transmit 10 messages with zero error in a single use.
- With any finite-dimensional maximally entangled resource, the channel can transmit at most 9 messages.
  This demonstrates that maximally entangled states are not universally optimal for one-shot zero-error communication.

Significance
The paper claims to provide the first natural, explicit construction (as opposed to computer-searched examples) that isolates the mechanism making non-maximal entanglement necessary for perfect play. It establishes that:

Perfect play in nonlocal games can enforce specific, non-trivial Schmidt ratios, not just the existence of entanglement.
The "right" entanglement (specifically non-maximal) is a necessary resource for optimal zero-error communication in certain scenarios, challenging the assumption that maximally entangled states are the universal resource for such tasks.
The modular construction offers a systematic route to generating further self-tests for specific entanglement spectra based on other rigid pseudo-telepathy games.

The work resolves the open question of whether a separation between maximally and non-maximally entangled resources exists in the regime of perfect completeness, confirming that such separations do exist and have direct consequences for communication complexity.

Technical Summary: The Right Entanglement for Perfect Nonlocality and Zero-Error Communication

More like this