Three-qubit nonlocality paradoxes: beyond GHZ

Abstract: Quantum nonlocality paradoxes, such as that of GHZ, provide maximally sharp logical obstructions to classical probabilistic models of quantum correlations. They are key resources in a broad variety of information-theoretic tasks that exhibit unconditional quantum advantage. For example, in nonlocal games, which are communication tasks that serve as core technical tools in recent landmark results in quantum computational complexity theory. Their role in establishing quantum advantage motivated their study by Abramsky et al. who introduced an infinite family of three-qubit paradoxes exhibiting novel conditional structure. This was later extended by de Silva et al. into a full classification program. In this work, we completely classify all three-qubit nonlocality paradoxes established via a biconditional parity proof; this is a very large class of paradoxes that encompasses all earlier-known examples. We do this by introducing a suite of new structural and combinatorial techniques. We find that the landscape of nonlocality paradoxes is far richer than previously understood, violating regularity conditions underlying all prior constructions.

• The paper introduces a novel combinatorial classification of three-qubit nonlocality paradoxes via biconditional parity proofs, generalizing the GHZ model.
• It employs graph-theoretic and algebraic methods to systematically encode and enumerate paradoxical quantum states and measurement configurations.
• The work reveals new families of nonlocality paradoxes, including exotic non-interpolant cases, with implications for quantum advantage and cryptography.

Classification and Novel Structure of Three-Qubit Nonlocality Paradoxes

Introduction

This work provides a technical advance in the systematic understanding and classification of three-qubit quantum nonlocality paradoxes, moving substantially beyond the archetypal Greenberger-Horne-Zeilinger (GHZ) construction. Nonlocality paradoxes—strong logical contradictions between quantum predictions and any classical hidden-variable theory—lie at the core of quantum computational advantage and various device-independent information-theoretic protocols. Prior research provided certain infinite families of such paradoxes, often showing strong symmetry and parity structure, but left the general combinatorial and physical structure largely uncharacterized.

Structural Innovations and Main Results

This paper achieves a full structural and combinatorial classification of three-qubit nonlocality paradoxes admitting biconditional parity proofs, using new graph-theoretic and algebraic methods. The authors generalize previous classifications by removing key prior restrictions on measurement numbers, state interpolant structure, and regularity conditions, and introduce techniques encoding logical paradoxes as 2-CNF formulas and implication graphs.

Fundamentally, they show that:

• Every paradox admitting a biconditional parity proof is equivalent (up to local change of basis and party relabelling) to a scenario with two measurement settings on the distinguished (Charlie) qubit, with the quantum state an interpolant state. This broadens the family previously reached via classification under restrictive symmetry or parity assumptions and captures all prior known examples, including the GHZ and the families from Abramsky et al. and de Silva et al.
• In the graph-theoretic formalism, implication graphs for all such interpolant-state biconditional paradoxes are bidirected; paradoxicality is then equivalent to the existence of a path from any literal to its complement. All such minimal paradoxes are therefore characterized by purely combinatorial data, which the authors formalize as tuples involving (i) a "Charlie clock" (cyclic group and tick structure), (ii) canonical Alice-Bob measurement completions (coset selections in the group), and (iii) continuous layer shifts (real parameters specifying measurement arrangement).
• The authors rigorously enumerate and classify all possible valid clocks, measurement completions, and layer shifts. This provides an explicit, effective bijection between families of nonlocality paradoxes and these canonical data.

Extension to Exotic and Non-Interpolant Paradoxes

The landscape of paradoxes is shown to extend far beyond the domain of interpolant states and two measurement settings per qubit:

• Families of paradoxes are constructed with three or more measurement settings on Charlie, with nontrivial and asymmetric Alice-Bob measurement structures, and with nonmaximal impossibility (not saturating the impossibility of all measurement assignments). These were unknown in prior literature.
• Most notably, an explicit construction of a strong nonlocality paradox for three qubits realized by a state outside the interpolant family is provided. This resolves a long-standing conjecture, demonstrating that the set of possible nonlocality paradoxes is far richer and more abundant than previously anticipated. The proof leverages a formulation in terms of Möbius transformations on the unit circle to construct a minimal unsatisfiable set of constraints, an approach inapplicable within previous frameworks.

Strong Claims and Numerical Results

The work makes the following strong technical assertions—backed by constructive combinatorial and algebraic arguments:

• The complete equivalence between biconditional parity proofs (including all known families such as GHZ and its generalizations) and paradoxes arising from interpolant states with two measurements on one party.
• The explicit, elementary, and checkable classification criteria for valid clocks and canonical completions, which covers all possibilities in this regime.
• The explicit construction of previously unanticipated paradoxes with three and four measurement settings on Charlie, with measured sets on Alice and Bob of variable size (including $(4,4,4)$, $(6,6,4)$, $(7,5,4)$, etc., combinations).
• The existence of a non-interpolant paradox within three qubits, disproving a previous conjecture, via explicit algebraic characterization.

Theoretical and Practical Implications

From both foundational and applied perspectives, this classification holds several implications:

• Amplification of nonlocality resources: The abundance and combinatorial variety of paradoxes across measurement and state parameters implies that nonlocal resources for quantum advantage are far less restricted than previously believed. This has implications for device-independent cryptography, randomness amplification, and self-testing protocols, and for the construction of families of nonlocal games with robust quantum vs. classical separations.
• Optimization of measurement-based quantum computing: Understanding the combinatorial structure of nonlocality paradoxes clarifies which resource states and measurement configurations give rise to unconditional quantum advantage. The combinatorial classification enables explicit construction (or search) for resource-optimal or symmetry-breaking nonlocality settings.
• Complexity-theoretic ramifications: Nonlocal games play a critical technical role in quantum complexity theory, e.g., in proving MIP* = RE. The enriched catalogue of paradoxical scenarios may allow further refinement of the communication and proof structures of quantum multi-prover interactive proof systems.
• Foundational insight into quantum contextuality: The classification realizes a "logical geometry" of how local impossibility propagates globally, with an explicit match to cycle structure in implication graphs, exposing the arithmetic and group-theoretic underpinnings of quantum-classical separation.

Future Directions

Potential extensions of this work include:

• Systematic enumeration and characterization of all nonlocality paradoxes for higher qubit numbers or higher-dimensional (qudit) systems, generalizing the developed group and graph-theoretic machinery.
• Automated computer-aided discovery of further exotic, minimal paradoxes via enumeration algorithms built on the provided combinatorial framework.
• Investigation of operational tasks (e.g., randomness certification, cryptographic primitives) that optimally leverage the newly identified paradoxical resources.
• Deeper analysis of the set of algebraic constraints yielding non-interpolant paradoxes and their relationship with state entanglement classes beyond SLOCC-GHZ equivalence.

Conclusion

This work presents a definitive classification of three-qubit nonlocality paradoxes admitting biconditional parity proofs and demonstrates the existence of qualitatively new families of paradoxes, including those beyond interpolant states. The formulation in terms of clocks, coset data, and implication graphs provides both a complete mathematical taxonomy and a pathway for systematic enumeration and discovery. The results clarify the nature and abundance of strong nonlocality in simple quantum systems and open new directions for both foundational quantum theory and the construction of quantum-advantage protocols.