Curator's Take
This article delivers the first exhaustive taxonomy of three‑qubit nonlocality paradoxes built from biconditional parity proofs, showing that the space of such contradictions is far larger and more intricate than previously thought. By extending the foundational GHZ framework with new combinatorial tools, it clarifies exactly which logical structures can fuel unconditional quantum advantage in nonlocal games—a cornerstone of recent breakthroughs in quantum complexity theory. The classification not only sharpens our theoretical understanding but also equips researchers with a richer toolbox for designing protocols that exploit genuine quantum non‑classicality on near‑term hardware.
— Mark Eatherly
Summary
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.