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

arXiv:2609.16490 · quant-ph, math-ph, math.MP · Submitted 2026-09-15 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems".

Mira: Here's the gist of the paper. Linear constraint systems (LCS) with a finite-dimensional quantum-classical gap exist if and only if they are associated with ray-context arrangements whose underlying modular incidence problem is classically unsatisfiable.

Kai: The main result establishes the existence of such LCS beyond the binary case, stating they exist if and only if d ≥ 3 and gcd(n, d) > 1.

Mira: Pruning redundant reasoning tokens The paper first isolates the reason for the difference between Pauli-based constructions and other unitary-based constructions at odd prime modulus, noting that for tensor-product quantum solutions, the obstruction to a classical solution of an LCS over Zn decomposes into obstruction classes carried by individual factors As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems.

Kai: The authors then associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces.

Title and authors: Kai: So, this paper is called "A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems." It's really about figuring out exactly when you can have a system that has no classical solution but still works with quantum operators.

Mira: Right, it's trying to give us a complete picture of that problem. The main thing they tackle is distinguishing between different kinds of quantum solutions, like Pauli-based ones versus other unitary-based ones at odd prime modulus.

Lev: I mean, for real hardware running on qubits or qudits, knowing the exact conditions under which these gaps exist is crucial because it tells us what kind of quantum advantage we can actually expect to measure.

Kai: The paper first sets up this distinction by looking at tensor-product quantum solutions and how the obstruction to a classical solution breaks down across those factors. They suggest that you can't get a global gap just by taking local systems that are all solvable classically.

Mira: They then connect these linear constraint systems to finite arrangements of rank-one projectors and resolutions of the identity, which is where they find the key connection to proving classical unsatisfiability.

Lev: So, what's the actual hurdle for someone trying to build a real system? Is it just finding an arrangement that has this specific incidence cycle they mention?

Kai: Exactly. They show that for these ray-context arrangements, you can characterize when the linear constraint system is inconsistent by finding a finite incidence cycle in an incidence complex.

Mira: And they link this inconsistency directly to group-valued frame functions, which is a really neat way to formalize the idea of a quantum-classical gap.

Lev: That sounds like it moves the problem from an abstract math question into something we can actually test with some kind of operator algebra.

Kai: The main result they land on is that there exists this system over the ring Zn which has no classical solution but admits a d-dimensional quantum solution if and only if gcd of n and d is greater than one, and d is three or more.

Mira: That condition, gcd of n and d being greater than one, seems like the big dividing line for whether a gap exists in these systems.

Lev: It's interesting that they establish this general result beyond just the binary case; it applies when you have n-qubit operators or higher dimensional qudits.

Kai: They do show that for Pauli-based quantum solutions, the obstruction is tied to how observables can be rephrased without changing context signs, which is a symmetry property in group cohomology.

Mira: That's where the contextuality comes in; they compare their construction to things like Kochen-Specker contextuality by showing their arrangement isn't colourable.

Lev: If it's not colourable, it means you can't assign values to the measurements consistently, which is exactly what we want for a gap.

Title and authors: Kai: They also give an explicit construction for dimension three, which they call a forty-three ray-thirty-one context arrangement in dimension three that relates back to Peres and Penrose sets <ref:2609.16490#pg2>.

Mira: And they mention that the minimal dimension of the quantum solution is determined by the least prime divisor of n when n is odd.

Lev: So, for practical purposes on hardware, if you want a gap, you need to pick an n with a specific prime factor and then make sure your dimension d meets their criteria.

Kai: The paper also gives an explicit construction for the case where n equals two qubits, which involves eighteen rays and nine contexts where every ray is in exactly two contexts.

Mira: That specific construction for n equals two is quite concrete, showing how the symmetry aspect of the Pauli signs can be traded for a uniform relation on orthogonal projectors.

Lev: If we look at that construction from an error correction standpoint, that symmetry might correspond to some kind of stabilizer code structure you could analyze.

Kai: And finally, they generalize this idea to arbitrary finite fields Fq where the inconsistency is detected by a chain lambda such that AT lambda equals zero and one T lambda is not congruent to zero.

Mira: That connects back to the frame function idea, showing that the existence of a quantum solution depends on whether a specific function exists on C d with weight one.

Lev: The paper's limitation, as I see it from an engineering side, is that while they give constructions for p greater than five and dimension three specifically, it doesn't necessarily cover every single possible dimension or every prime field easily.

Kai: They do flag that the determinant condition of gcd of n and d being greater than one is sufficient in every dimension except for d equals two in Proposition one which means we have to be careful when d is just two <ref:2609.16490#pg2>.

Mira: And they mention that for finite fields, they find a result that there exists a linear constraint system with no classical solution but with a quantum solution if and only if the prime p divides d and d is greater than or equal to three.

Lev: So, in short, it gives us the necessary conditions for these gaps over various settings—binary systems, odd primes, and finite fields.

Kai: It’s a deep classification of when we can expect to find that gap between classical math and quantum mechanics in constraint systems.

Mira: The paper's main contribution is providing this complete classification by linking the existence of quantum solutions to these specific incidence cycles and frame functions.

Lev: It gives us a clear roadmap for what mathematical structures we need to look for when designing experiments that might reveal these non-classical behaviors in quantum systems.

Kai: This paper is about understanding the precise algebraic language behind contextuality and how it manifests in solvable linear constraint systems.

The paper's summary: Kai: So, this paper basically wraps up the whole investigation into when you can have these tricky linear constraint systems that don't have any classical solution but still admit a finite-dimensional quantum answer.

Mira: Right, it’s summarizing how they’ve linked those systems to ray-context arrangements and frame functions. They show that the existence of a quantum solution boils down entirely to checking if there's an incidence cycle in a complex that signals classical inconsistency.

Lev: From my side, this means we can use group cohomology analysis, specifically looking at that context duality class, to really pin down which types of quantum solutions are actually possible on real hardware.

Kai: They establish a general rule for when these systems exist beyond just the simple binary case; it happens if you have n and d greater than two and their greatest common divisor is bigger than one.

Mira: That gcd condition is key because it tells us whether that underlying mathematical structure is consistent enough to support a quantum answer at all.

Lev: I mean, when we build something for real hardware, we need to know if the overhead of the error correction can handle these specific constraints dictated by n and d.

Kai: The paper gives an explicit example for dimension three, which is a forty-three ray-thirty-one context arrangement, showing exactly what this looks like in practice.

Mira: And they also talk about how the minimal size of the quantum solution depends on the smallest prime factor of n when it’s an odd number.

Lev: That suggests that if you’re working with systems where n is odd, you can actually predict a lower bound on the dimension you need for a quantum solution.

Kai: They also connected this to those Zn-valued frame functions, showing that finding a specific kind of function is the mathematical equivalent of finding a gap between classical math and quantum physics.

Mira: That whole framework lets us verify whether we’re looking at an inconsistent system or one that might actually yield a quantum advantage.

Lev: So, the implication here for error correction is that if you design your constraints around these specific mathematical structures, you have a concrete path to either a classical solution or a quantum one.

Kai: They also showed how to check contextuality obstructions using group cohomology on Pauli operators, which helps distinguish between different kinds of quantum solutions based on their symmetry properties.

Mira: That’s the connection to things like Kochen-Specker contextuality, suggesting that these mathematical structures are fundamentally tied to measurement limitations in quantum mechanics.

Lev: If we want to build a reliable quantum computer for constraint satisfaction problems, understanding these incidence cycles is going to be essential for designing better codes and protocols.

Kai: This work sets the stage for building tools that can systematically search for these kinds of systems across different dimensions and fields.

Mira: The paper’s main contribution is providing this complete classification by linking the existence of quantum solutions to those specific incidence cycles and frame functions.

Lev: It gives us a clear roadmap for what mathematical structures we need to look for when designing experiments that might reveal these non-classical behaviors in quantum systems.

The paper's improvements: Kai: So, looking at where they’re going next, they aren't just stopping at classifying what exists; they’re suggesting ways to actually build things based on those classifications.

Mira: Right, they are proposing a system where you can take the mathematical conditions we just discussed and use them to actively construct new examples of these constraint systems.

Lev: That’s interesting because right now, we mostly look at existing problems; this paper opens up a way to systematically generate novel ones that have that quantum-classical gap.

Kai: They’re looking into how group cohomology analysis can be used to search for those specific ray-context arrangements mentioned earlier, which should help us find those examples.

Mira: They are also suggesting a framework where you can use the Zn-valued frame functions not just to prove non-existence but as a constructive tool to build systems with quantum solutions.

Lev: If the AI system we talked about is going to be useful for finding these gaps, it needs those constructive steps, not just the existence proof.

Kai: They are also looking at how this whole framework might relate to designing better control protocols for high-dimensional systems, tying it back to hardware like superconducting qubits.

Mira: This moves the work from pure theory into something more applied, showing how these abstract math tools translate into actual physical constraints on what we can measure.

Lev: It suggests that instead of just testing if a system is solvable, we could use this machinery to design systems that are specifically engineered to be inconsistent yet quantum solvable.

Kai: It’s a big step because it gives us a way to move past just verifying known bounds and start generating new experimental targets.

Mira: They are essentially providing the blueprint for an AI system that can search the space of possible arrangements for those elusive patterns that lead to quantum advantage.

Lev: So, this isn't just about confirming a theorem; it’s about creating a computational pipeline for finding the hard-to-find examples we need to test on.

Kai: It really changes how we think about searching for these non-classical behaviors in physical systems because it gives us an engine to do that search systematically.

Mira: The implication is that we can start designing experiments with a much more guided approach, focusing our limited experimental resources on the most promising mathematical structures.

Conclusion: Kai: So, to wrap up, this paper classifies all the ways we can have linear constraint systems that have no classical solution but still admit a finite-dimensional quantum answer by linking it all to those ray-context arrangements and frame functions.

Mira: Exactly, they gave us the complete picture of when that gap exists based on conditions like the greatest common divisor of n and d being greater than one.

Lev: For my work on error correction, this means we have a much clearer mathematical boundary for what kind of quantum advantage we can even hope to find in these types of constraint problems.

Kai: The implication is that if you are designing experimental setups, you now have a precise mathematical language to check if your problem has the potential for a quantum gap.

Mira: It shifts the focus from just searching blindly to using this classification framework to guide where we should look for novel, difficult systems.

Lev: I think it’s good because it gives us targets; we can actually design constraints that are guaranteed to be inconsistent but still have a quantum solution if they meet these criteria.

Kai: And the explicit constructions they provided, like the one in dimension three, show us what those abstract rules actually look like when you try to build something on real superconducting hardware.

Mira: That construction is really valuable because it’s not just theoretical; it shows a concrete ray-context arrangement that we can analyze for its physical realizability and symmetry properties.

Lev: I'm still thinking about how much overhead that group cohomology analysis will add when we try to run these kinds of checks on a real quantum computer with limited coherence times.

Kai: The paper’s title, "A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems," is really a mouthful, but it sums up what they achieved.

Mira: It’s a solid result because it connects the abstract math to concrete physical constraints on what we can measure in quantum computation.

Lev: This classification gives us leverage when we look at more complex problems like those involving high-dimensional systems or different finite fields, which is where I see the most immediate utility for error correction.

Institut f¨ur Theoretische Physik, Leibniz Universit¨at Hannover

quant-ph, math-ph, math.MP

Submitted: 2026-09-15

Updated: 2026-11-11

Comments: 20+10 pages, comments welcome; v2: added citations to closely similar results obtained in concurrent and previous works (Refs 6,42-44)

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 78/100

The gist: Linear constraint systems (LCS) with a finite-dimensional quantum-classical gap exist if and only if they are associated with ray-context arrangements whose underlying modular incidence problem is…

Key concepts

Linear Constraint System (LCS)
A set of linear equations over a finite ring (like Zn) where you are looking for solutions that satisfy all constraints simultaneously. The paper investigates when these systems have no classical solution but can still be solved using quantum operators.
Ray-Context Arrangement
A geometric structure related to the LCS, involving rank-one projectors and resolutions of the identity in vector spaces. The existence of a quantum solution is linked to the classical unsatisfiability of the modular incidence problem defined by this arrangement.
Zn-Valued Frame Functions
Functions defined over Zn that characterize whether an LCS has a classical solution. Specifically, if every frame function with invertible weight yields a classical solution, then no such function implies the existence of an inconsistent LCS with a quantum solution.
Incidence Cycle
A finite cycle within the incidence complex associated with the ray-context arrangement. The paper shows that for these specific LCS, classical inconsistency is equivalent to finding such a finite incidence cycle.

Terminology

Summary

Linear constraint systems (LCS) with a finite-dimensional quantum-classical gap exist if and only if they are associated with ray-context arrangements whose underlying modular incidence problem is classically unsatisfiable. p. 0

Where the paper says it

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.

The main result establishes the existence of such LCS beyond the binary case, stating they exist if and only if d ≥ 3 and gcd(n, d) > 1. p. 0
Where the paper says it

To establish the (non)existence of classically unsatisfiable LCS over Zn with quantum solutions in all dimensions d and for all n ∈ 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 ≥ 3 and gcd(n, d) > 1.

Pruning redundant reasoning tokens

The paper first isolates the reason for the difference between Pauli-based constructions and other unitary-based constructions at odd prime modulus, noting that for tensor-product quantum solutions, the obstruction to a classical solution of an LCS over Zn decomposes into obstruction classes carried by individual factors As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems. The authors then associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces. p. 0

Where the paper says it

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. p. 0
Where the paper says it

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.

How the training signal is built

The paper develops several key structural distinctions to analyze the existence problem, including an even–odd distinction for local unitaries where for n odd an obstruction cannot arise only after tensoring locally unobstructed factors. They then relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions. p. 2

Where the paper says it

We show that the inconsistency of such a LCS is characterised by a finite incidence cycle, which further simplifies for symmetric arrangements. Next, we relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions.

This allows them to identify a family of LCS with a quantum-classical gap in the work of Harding, Jager and Smith. p. 2
Where the paper says it

Next, we relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions. This allows us to identify a family of LCS with a quantum-classical gap in the work of Harding, Jager and Smith [13] in Sec.

The search for explicit constructions leads to the construction of an explicit 43 ray-31 context arrangement in dimension 3. p. 2
Where the paper says it

To fully solve the existence problem, we perform a computational search for symmetric ray-context arrangements in C p . From this we extract a generic construction for p ≥ 5 and an explicit 43 ray-31 context arrangement in dimension 3, which turns out to be a close relative of Peres’ and Penrose’s KochenSpecker sets [29, 28], as explicated in App.

Where the gains come from

The paper provides a complete classification by relating classical unsatisfiability to the existence of a finite incidence cycle in an incidence complex. They establish that for LCS associated with ray-context arrangements, the inconsistency is characterized by a finite incidence cycle. p. 2

Where the paper says it

We show that the inconsistency of such a LCS is characterised by a finite incidence cycle, which further simplifies for symmetric arrangements. Next, we relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions.

Furthermore, they relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions. p. 2
Where the paper says it

We show that the inconsistency of such a LCS is characterised by a finite incidence cycle, which further simplifies for symmetric arrangements. Next, we relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions.

The final result is stated as Theorem 6: there exists a linear constraint system over Zn which has no classical solution but admits a d-dimensional quantum solution if and only if gcd(n, d) > 1 and d ≥ 3 1 and d ≥ 3>. p. 2
Where the paper says it

For n = 2 these are the operator-valued binary constraint systems of [7]. We say that a LCS has a (finite-dimensional) quantum-classical gap if it admits a quantum but no classical solution.

Zn-valued frame functions

The paper connects the existence of a quantum-classical gap to Zn-valued frame functions, showing that every frame function with invertible weight yields a classical solution to every such LCS. Conversely, the non-existence of such a frame function implies the existence of an inconsistent LCS over Zn. p. 8

Where the paper says it

In particular, the existence of a Zn-valued frame function on P1(C d ) of weight 1 provides a classical solution to the LCS associated to any ray-context arrangement in C d . Conversely: Lemma 5.

This leads to Theorem 2, which states that there exists a classically unsatisfiable LCS over Zn with d-dimensional quantum solution if and only if there exists no Zn-valued frame function on C d of weight one. p. 9
Where the paper says it

there exists a classically unsatisfiable LCS over Zn with d-dimensional quantum solution; 2. there exists no Zn-valued frame function on C d of weight one; 3.

Quantum solutions from n-qubit Pauli operators

The paper shows that for binary LCS with quantum but no classical solution, similar tensorproduct decompositions with higher-dimensional qudit tensor factors never correspond to a classically unsatisfiable LCS unless one of its tensor factors already furnishes such an example. For Pauli-based quantum solutions, the context phase vector b is the pullback of the Pauli multiplication cocycle β to the LCS context complex. p. 0

Where the paper says it

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.

The group cohomology analysis shows that [b] ∈ coker A is invariant under projective Clifford action, and vanishing only occurs when observables can be rephrased without changing context signs.

A Relation with Peres-Penrose qutrit contextuality proofs

The paper compares the construction in Theorem 5 from the perspective of Kochen-Specker contextuality. It is shown that the ray–context arrangement in Thm. p. 5

Where the paper says it

4 Quantum solutions from ray-context arrangements Thm. 1 suggests to construct quantum solutions in a different way.

5 is KS-uncolourable, meaning it does not admit valuations. p. 1
Where the paper says it

constraint system games to separate tensor-product and commuting-operator models in variants of Tsirelson’s problem [36, 35, 8]; the broader relation between Tsirelson’s problem and Connes’ embedding problem was developed in [16], and the latter was ultimately refuted as a consequence of the identity MIP∗ = RE [15]. From the single-system point of view, the same operator relations are paradigmatic examples of contextuality: mutually compatible sets of measurements define overlapping classical contexts which do not admit a global value assignment [19, 1].

The arithmetic interpretation suggests that the construction exploits the trace-zero identity α + α¯ = 0 in Z[√−2] which is absent at the ordinary real Peres point α = √2. This construction involves a real conference matrix of order p + 1 for every odd prime power q [26]. p. 4
Where the paper says it

For every row r ∈ [M] in the LCS and with respect to a fixed variable order, define the row word W(k) r = Y N i=1 U Ari i,k . Let 2 ≤ n ∈ N be odd and {Xi} N i=1 be a finite-dimensional quantum solution of the LCS Ax = b (mod n) as in Eq.

The resulting arrangement is equitable, and the incidence cycle certificate is found to be non-trivial. p. 2
Where the paper says it

This shifts the above existence problem to proving the corresponding incidence relations of an arrangement to be inconsistent. We show that the inconsistency of such a LCS is characterised by a finite incidence cycle, which further simplifies for symmetric arrangements.

Conclusion

The paper completely resolves the existence problem of linear constraint systems (LCS) that have no classical solution, that is, are inconsistent, yet admit finite-dimensional quantum solutions in the form of unitary operators on a finite-dimensional Hilbert space. The authors explicitly relate the existence of quantum solutions to such LCS with Zn-valued frame functions. p. 2

Where the paper says it

We show that the inconsistency of such a LCS is characterised by a finite incidence cycle, which further simplifies for symmetric arrangements. Next, we relate the existence of quantum solutions to LCS associated with ray-context arrangements to group-valued frame functions.

They provide a general and constructive existence result for LCS with quantum but no classical solution in the variables n, d. p. 0
Where the paper says it

A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems Markus Frembs∗ Institut f¨ur Theoretische Physik, Leibniz Universit¨at Hannover Appelstraße 2, 30167 Hannover, Germany Abstract 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.

The minimal dimension of a quantum solution is determined by the least prime divisor of n for odd n. p. 1
Where the paper says it

The operators ζ P n with ζn = e 2πi n and P a projector in the arrangement 1Van Dobben de Bruyn (in joint work with Roberson) has recently announced a graph-theoretical argument for the existence of odd-prime LCS examples with a quantum-classical gap, although we remain unaware of any published version of their work [41, 42]. Here, we solve the complete n, d-classification for the existence of LCS with quantum-classical gaps and provide explicit constructions in all cases, including the minimal dimension d = p.

The final conclusion is that the determinant condition gcd(n, d) > 1 in Prop. p. 6
Where the paper says it

Moreover, we have im(δ) = (ker(∂))⊥ from above, hence, βb ∈/ im(δ) if and only if it pairs nontrivially with some λ ∈ ker(∂). We call λ ∈ C1 satisfying the condition in Prop.

1 is sufficient in every dimension except for d = 2 1 in Prop. p. 7
Where the paper says it

Note that unlike Prop. 4 provides only a sufficient criterion for unsatisfiability in general.

1 is sufficient in every dimension except for d = 2>. p. 1
Where the paper says it

Here, we refute this conjecture. 1 We first observe that the 2005 construction of Harding, Jager and Smith [13] already implicitly supplies such examples for every n in dimension 2n, and extend it to a complete and constructive solution in Thm.

B A family of LCS from conference matrices

The paper includes a family of LCS over Fq with q = p f for p prime where classical inconsistency is detected by a chain λ ∈ ker(AT) such that AT λ = 0 and 1T λ ≠ 0. The existence result for finite fields is stated in Theorem 8, which states there exists a LCS with no classical solution, yet with a d-dimensional quantum solution if and only if p d and d ≥ 3. p. 9

Where the paper says it

Here, ‘block’ is synonymous with basis and our ‘context’ in Def. For every 2 ≤ n ∈ N and every d = kn with k ≥ 2, there exists a LCS over Zn with a d-dimensional quantum solution, yet no classical solution.

The paper concludes by providing an explicit construction for the case n = 2, where the HJS construction consists of 18 rays and 9 contexts, with every ray contained in exactly two contexts. The obstruction to a classical solution can be viewed in terms of symmetry. p. 6

Where the paper says it

2 Symmetric arrangements and their classical obstructions In order to construct quantum solutions to inconsistent LCS, we will heavily rely on symmetry, in particular, we will construct ray-context arrangements that come with a finite group acting on its rays and contexts. More generally, the analysis in this section applies to any quantum solution (X , C) with LCS associated to its underlying incidence relations (defined in the obvious way).

It is highlighted that the Pauli signs of the original Mermin-Peres square have been traded for the uniform relation b = 1C attached to every orthogonal projector resolution as in Eq. p. 4
Where the paper says it

Thus a local row word formed from involutions can carry a fourth-root phase. In the Mermin–Peres square the two local qubits contribute phases ±i, whose products give the global signs ±1.

(41). The paper shows that the obstruction to a classical solution can be viewed in terms of symmetry. p. 0
Where the paper says it

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 decomposes into obstruction classes carried by the individual factors.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Develop an AI system capable of solving linear constraint systems (LCS) over finite rings with no classical solution by leveraging ray-context arrangements whose incidence relations are inconsistent. This allows the system to determine if a given LCS admits a quantum solution based on whether there is an incidence cycle satisfying AT lambda = 0 and 1T lambda not congruent to 0.

  2. Enhance quantum computation algorithms by utilizing the algebraic structure of Zn-valued frame functions to identify classical solutions for LCS with invertible weights. This capability allows the system to find a classical solution if a specific frame function exists, which is useful for verifying or bypassing quantum-classical gaps in nonlocal games.

  3. Implement a mechanism to construct explicit examples of LCS with a quantum-classical gap by systematically searching for ray-context arrangements that satisfy the conditions derived from group cohomology, such as in Theorem 9. This enables the system to generate novel, high-dimensional examples for arbitrary dimensions d = kp where k is not congruent to 1 modulo p.

  4. Create a robust framework for verifying contextuality obstructions by analyzing the symmetry of quantum solutions built from n-qubit Pauli operators using group cohomology, specifically checking if the context duality class [b] is G-invariant or if it belongs to H1(G, ker A). This allows the system to distinguish between different types of quantum solutions based on their symmetry properties.

  5. Generalize quantum solution verification from prime fields Fp to arbitrary finite fields Fq with characteristic p by using additive characters and spectral decompositions. The system can verify the existence of a d-dimensional quantum solution for an LCS over Fq if p divides d and d is greater than or equal to 3, as stated in Theorem 8.

Abstract

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 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 Z n with quantum solutions in all dimensions d and for all n in 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 at least 3 and (n,d)>1. Moreover, we establish the existence of LCS with a quantum-classical gap over finite fields if and only if d at least 3 and p d.

Related papers