Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.14632

Linear equations mod nnn are pseudo-telepathic

Lorenzo Ciardo

quant-phcs.CCcs.LOmath.COmath.OASubmitted Sep 13, 2026• Announced Sep 15, 2026• 1 citation
arXivHTMLPDF

Abstract

We prove that the quantum monad in dimension $2n$ admits no natural transformation to the polymorphism clone of linear equations modulo $n$. Consequently, for every $n\geq 2$, there exists an unsatisfiable system of linear equations over $\mathbb{Z}_n$ whose constraint system game admits a perfect finite-dimensional quantum strategy. As a corollary, we completely characterise pseudo-telepathic constraint languages in finite dimension. The proof combines a result of Harding, Jager, and Smith on group-valued measures on subspaces of Hilbert spaces with the polymorphism-minion characterisation of quantum pseudo-telepathy.

Related papers

A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems

Markus Frembs

Linear constraint systems (LCS) provide a compact algebraic language for nonlocal games and state-independent contextuality. In the binary case the Mermin--Peres square shows that inconsistent LCS can be solved by promoting variables to local Pauli operators, whereas a series of no-go results excludes analogous Pauli-, Clifford- and monomial unitary-based constructions at odd prime modulus. We first isolate the reason for this difference: for tensor-product quantum solutions, the obstruction to a classical solution of a LCS over $\mathbb{Z}_n$ decomposes into obstruction classes carried by the individual factors. As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems. The argument is specific to odd modulus; at even modulus the reordering phase need not vanish, as in Pauli-based examples. Given this distinction, we instead associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces. Quantum solvability for such LCS is automatic and the search for a quantum-classical gap rests entirely on proving classical unsatisfiability of the underlying modular incidence problem of the arrangement. By relating such LCS with group-valued frame functions, we identify a family of examples in the work of [Harding, Jager, and Smith, Int. J. Theor. Phys. 44, 539 (2005)]. To establish the (non)existence of classically unsatisfiable LCS over $\mathbb{Z}_n$ with quantum solutions in all dimensions $d$ and for all $n\in\mathbb{N}$, we further construct explicit examples for the cases $d=n$ prime. Our main result thus positively resolves the existence problem of such LCS beyond the binary case: such systems exist if and only if $d\geq 3$ and $\gcd(n,d)>1$. Moreover, we establish the existence of LCS with a quantum-classical gap over finite fields if and only if $d\geq 3$ and $p\mid d$.

quant-pharXiv:2609.16490•Sep 16, 2026•0 citations

On the Quantum Chromatic Gap II

Lorenzo Ciardo, Antoine Mottet

We confirm a conjecture of the first author [SODA'26] on a strong form of pseudo-telepathy for Khot's $d$-to-$1$ games: for every $d\geq 4$, every $ε>0$, and every $k\in\mathbb N$, there is a $d$-to-$1$ label-cover game of classical value less than $ε$ that admits a perfect quantum strategy using finite-dimensional shared entanglement with measurement contexts of radius at least $k$. As a consequence, there exist graphs whose quantum chromatic number $χ_q$ is $3$ and whose classical chromatic number $χ$ is arbitrarily large. This is the first improvement on the quantum chromatic gap since the work of Brassard, Cleve, and Tapp [Phys. Rev. Lett.'99], which produced graphs for which $χ$ grows exponentially in $χ_q$. To prove the conjecture, we proceed as follows. We start with a ``stretched'' version of the Mermin--Peres magic square, obtained by spacing out its equations and linking them with additional long equation wires. This operation increases the radius of the initial measurement contexts of a perfect quantum strategy for the game, while preserving classical unsatisfiability. We then apply parallel repetition to make the classical value small, and we turn the system into a pseudo-telepathic multi-layered Kneser hypergraph via a PCP construction of Dinur, Guruswami, Khot, and Regev [STOC'03]. Finally, we feed the resulting hypergraph into the reduction of Fei, Minzer, and Wang from hypergraph colouring to $4$-to-$1$ games, we establish quantum completeness of this reduction, and we show that it preserves context radius.

quant-pharXiv:2610.40571•Oct 30, 2026•0 citations

k-partite quantum homomorphisms

Amin Karamlou

$k$-partite XOR games and linear binary constraint system (BCS) games arise from systems of linear equations over $\mathbb{Z}_2$, providing distinct quantum relaxations of the same classical constraint satisfaction problem (CSP). Linear BCS games have been generalised to synchronous homomorphism games on arbitrary relational structures, with compositional semantics provided by the quantum monad. We introduce $k$-partite homomorphism games, extending $k$-XOR games from linear systems to arbitrary relational structures. This yields a framework for studying multipartite quantum CSPs and quantum homomorphisms. We characterise perfect strategies in both the tensor-product and commuting-operator models as Kleisli morphisms of suitable state-dependent graded quantum monads on a category of $k$-partite relational structures. We then study quantum advantage in the pseudotelepathic sense: the existence of a perfect quantum strategy without a perfect classical strategy. We show that synchronous and $k$-partite quantum advantage are incomparable at the level of CSP instances. The GHZ instance admits three-player quantum advantage but no synchronous commuting-operator advantage, whereas the magic-square instance admits synchronous quantum advantage but no $k$-partite commuting-operator advantage for any number of players or proper colouring. We also exhibit an explicit six-element template whose CSP is NP-complete and admits two-player quantum advantage. Finally, we prove that no bounded-width CSP template admits $k$-partite quantum advantage, even in the commuting-operator model.

arXiv:2611.15839•Nov 11, 2026•0 citations

Maximally entangled states are not complete for pseudo-telepathy

Olivier Lalonde

One of the longstanding open problems in quantum nonlocality is to determine if maximally entangled states are complete for bipartite pseudo-telepathic games: namely, if every nonlocal game which admits a perfect entangled strategy admits such a strategy which uses a maximally entangled state. We exhibit a counterexample to this in the form of a bipartite nonlocal game with input sets of size 4 and 3 and output sets both of size 6. This game is part of a new class of nonlocal games, which we call inner product games, which could be of independent interest.

quant-pharXiv:2608.05378•Aug 7, 2026•2 citations

Algebraic quantum structures for reference frame-independent quantum teleportation and pseudo-telepathy

Dominic Verdon

Part I: We present two new schemes for teleportation of a quantum state between parties whose local reference frames are misaligned by the action of a compact Lie group G. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution, suiting them to situations of rapid reference frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially ---including the case of qubit teleportation under arbitrary SU(2) reference frame uncertainty--- while communicating no information about either party's reference frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of G; we completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases. Part II: Quantum pseudo-telepathy is a phenomenon whereby two non-communicating parties can use the non-signalling correlations from shared quantum entanglement to perform a task that would ordinarily be impossible without communication. Here we consider the graph isomorphism game: an instance of the game is defined by a pair of graphs, and a perfect deterministic classical strategy precisely corresponds to an isomorphism of those graphs. We call a pair of graphs for which a perfect strategy using shared entanglement (a quantum strategy) exists pseudo-telepathic, and call a quantum strategy a quantum isomorphism between the graphs. Using a deep connection between noncommutative mathematics and nonlocal games, we classify all graphs quantum isomorphic to a given graph in terms of the quantum automorphism group of the graph. This implies a construction of quantum isomorphisms from central type subgroups of the ordinary automorphism group; we give an explicit description of the resulting quantum strategy and the new graph. We consider generation of new examples of quantum contextuality from central type groups. For abelian central type groups we show that this reduces to construction of quantum solutions of a binary linear constraint system from the abelianisation of its homogeneous solution group.

•Jan 1, 2019•0 citations

Quantum Polymorphisms and the Complexity of Quantum Constraint Satisfaction

Lorenzo Ciardo, Gideo Joubert, Antoine Mottet

We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between quantum polymorphism minions and quantum relational constructions. By leveraging a contextuality property of quantum polymorphisms, we fully characterise the existence of commutativity gadgets for relational structures, introduced by Ji as a method for achieving quantum soundness of classical CSP reductions. Prior to our work, only a partial classification was known for a subclass of Boolean languages and for non-Boolean languages meeting specific structural conditions [Culf--Mastel, FOCS'25]. As an application of our framework, we prove that the quantum CSPs parameterised by odd cycles and the quantum CSP expressing quantum satisfiability of Siggers clauses are undecidable.

quant-pharXiv:2511.23445•Dec 1, 2025•5 citations
We prove that the quantum monad in dimension 2n2n2n admits no natural transformation to the polymorphism clone of linear equations modulo nnn. Consequently, for every n≥2n\geq 2n≥2, there exists an unsatisfiable system of linear equations over Zn\mathbb{Z}_nZn​ whose constraint system game admits a perfect finite-dimensional quantum strategy. As a corollary, we completely characterise pseudo-telepathic constraint languages in finite dimension. The proof combines a result of Harding, Jager, and Smith on group-valued measures on subspaces of Hilbert spaces with the polymorphism-minion characterisation of quantum pseudo-telepathy.
Linear constraint systems (LCS) provide a compact algebraic language for nonlocal games and state-independent contextuality. In the binary case the Mermin--Peres square shows that inconsistent LCS can be solved by promoting variables to local Pauli operators, whereas a series of no-go results excludes analogous Pauli-, Clifford- and monomial unitary-based constructions at odd prime modulus. We first isolate the reason for this difference: for tensor-product quantum solutions, the obstruction to a classical solution of a LCS over Zn\mathbb{Z}_nZn​ decomposes into obstruction classes carried by the individual factors. As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems. The argument is specific to odd modulus; at even modulus the reordering phase need not vanish, as in Pauli-based examples. Given this distinction, we instead associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces. Quantum solvability for such LCS is automatic and the search for a quantum-classical gap rests entirely on proving classical unsatisfiability of the underlying modular incidence problem of the arrangement. By relating such LCS with group-valued frame functions, we identify a family of examples in the work of [Harding, Jager, and Smith, Int. J. Theor. Phys. 44, 539 (2005)]. To establish the (non)existence of classically unsatisfiable LCS over Zn\mathbb{Z}_nZn​ with quantum solutions in all dimensions ddd and for all n∈Nn\in\mathbb{N}n∈N, we further construct explicit examples for the cases d=nd=nd=n prime. Our main result thus positively resolves the existence problem of such LCS beyond the binary case: such systems exist if and only if d≥3d\geq 3d≥3 and gcd⁡(n,d)>1\gcd(n,d)>1gcd(n,d)>1. Moreover, we establish the existence of LCS with a quantum-classical gap over finite fields if and only if d≥3d\geq 3d≥3 and p∣dp\mid dp∣d.
We confirm a conjecture of the first author [SODA'26] on a strong form of pseudo-telepathy for Khot's ddd-to-111 games: for every d≥4d\geq 4d≥4, every ε>0ε>0ε>0, and every k∈Nk\in\mathbb Nk∈N, there is a ddd-to-111 label-cover game of classical value less than εεε that admits a perfect quantum strategy using finite-dimensional shared entanglement with measurement contexts of radius at least kkk. As a consequence, there exist graphs whose quantum chromatic number χqχ_qχq​ is 333 and whose classical chromatic number χχχ is arbitrarily large. This is the first improvement on the quantum chromatic gap since the work of Brassard, Cleve, and Tapp [Phys. Rev. Lett.'99], which produced graphs for which χχχ grows exponentially in χqχ_qχq​. To prove the conjecture, we proceed as follows. We start with a ``stretched'' version of the Mermin--Peres magic square, obtained by spacing out its equations and linking them with additional long equation wires. This operation increases the radius of the initial measurement contexts of a perfect quantum strategy for the game, while preserving classical unsatisfiability. We then apply parallel repetition to make the classical value small, and we turn the system into a pseudo-telepathic multi-layered Kneser hypergraph via a PCP construction of Dinur, Guruswami, Khot, and Regev [STOC'03]. Finally, we feed the resulting hypergraph into the reduction of Fei, Minzer, and Wang from hypergraph colouring to 444-to-111 games, we establish quantum completeness of this reduction, and we show that it preserves context radius.
kkk-partite XOR games and linear binary constraint system (BCS) games arise from systems of linear equations over Z2\mathbb{Z}_2Z2​, providing distinct quantum relaxations of the same classical constraint satisfaction problem (CSP). Linear BCS games have been generalised to synchronous homomorphism games on arbitrary relational structures, with compositional semantics provided by the quantum monad. We introduce kkk-partite homomorphism games, extending kkk-XOR games from linear systems to arbitrary relational structures. This yields a framework for studying multipartite quantum CSPs and quantum homomorphisms. We characterise perfect strategies in both the tensor-product and commuting-operator models as Kleisli morphisms of suitable state-dependent graded quantum monads on a category of kkk-partite relational structures. We then study quantum advantage in the pseudotelepathic sense: the existence of a perfect quantum strategy without a perfect classical strategy. We show that synchronous and kkk-partite quantum advantage are incomparable at the level of CSP instances. The GHZ instance admits three-player quantum advantage but no synchronous commuting-operator advantage, whereas the magic-square instance admits synchronous quantum advantage but no kkk-partite commuting-operator advantage for any number of players or proper colouring. We also exhibit an explicit six-element template whose CSP is NP-complete and admits two-player quantum advantage. Finally, we prove that no bounded-width CSP template admits kkk-partite quantum advantage, even in the commuting-operator model.
One of the longstanding open problems in quantum nonlocality is to determine if maximally entangled states are complete for bipartite pseudo-telepathic games: namely, if every nonlocal game which admits a perfect entangled strategy admits such a strategy which uses a maximally entangled state. We exhibit a counterexample to this in the form of a bipartite nonlocal game with input sets of size 4 and 3 and output sets both of size 6. This game is part of a new class of nonlocal games, which we call inner product games, which could be of independent interest.
Part I: We present two new schemes for teleportation of a quantum state between parties whose local reference frames are misaligned by the action of a compact Lie group G. These schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution, suiting them to situations of rapid reference frame drift. Our tight scheme yields improved purity compared to standard teleportation, in some cases substantially ---including the case of qubit teleportation under arbitrary SU(2) reference frame uncertainty--- while communicating no information about either party's reference frame alignment at any time. Our perfect scheme performs perfect teleportation, but does communicate some reference frame information. The mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of G; we completely classify such unitary error bases for qubits, exhibit constructions in higher dimension, and provide a method for proving nonexistence in some cases. Part II: Quantum pseudo-telepathy is a phenomenon whereby two non-communicating parties can use the non-signalling correlations from shared quantum entanglement to perform a task that would ordinarily be impossible without communication. Here we consider the graph isomorphism game: an instance of the game is defined by a pair of graphs, and a perfect deterministic classical strategy precisely corresponds to an isomorphism of those graphs. We call a pair of graphs for which a perfect strategy using shared entanglement (a quantum strategy) exists pseudo-telepathic, and call a quantum strategy a quantum isomorphism between the graphs. Using a deep connection between noncommutative mathematics and nonlocal games, we classify all graphs quantum isomorphic to a given graph in terms of the quantum automorphism group of the graph. This implies a construction of quantum isomorphisms from central type subgroups of the ordinary automorphism group; we give an explicit description of the resulting quantum strategy and the new graph. We consider generation of new examples of quantum contextuality from central type groups. For abelian central type groups we show that this reduces to construction of quantum solutions of a binary linear constraint system from the abelianisation of its homogeneous solution group.
We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between quantum polymorphism minions and quantum relational constructions. By leveraging a contextuality property of quantum polymorphisms, we fully characterise the existence of commutativity gadgets for relational structures, introduced by Ji as a method for achieving quantum soundness of classical CSP reductions. Prior to our work, only a partial classification was known for a subclass of Boolean languages and for non-Boolean languages meeting specific structural conditions [Culf--Mastel, FOCS'25]. As an application of our framework, we prove that the quantum CSPs parameterised by odd cycles and the quantum CSP expressing quantum satisfiability of Siggers clauses are undecidable.