A Tensor-Algebraic No-Go Theorem for High-Dimensional Photonic Greenberger–Horne–Zeilinger States Discovered with AlphaProof Nexus
Mario Krenn, Moritz Firsching, George Tsoukalas, Rishikesh Gajjala, Xuemei Gu, Swarat Chaudhuri
quant-ph
Nov 19, 2026 · v1
cs.AI math.CO
TL;DR
AlphaProof Nexus found a Lean proof, against a Formal Conjectures formalization, that no complex-weighted monochromatic quantum graph exists for even N≥4, D≥N.
Abstract
Photonic GHZ states generated with probabilistic pair sources can be described by edge-coloured, complex-weighted graphs. In this representation, conditioning on an event with one photon in every detector turns the output amplitudes into coherent sums over perfect matchings, and generating an \(N\)-photon \(D\)-dimensional GHZ state is equivalent to constructing a monochromatic quantum graph. Here, we prove that no complex-weighted monochromatic quantum graph exists for any even \(N\ge4\) when \(D\ge N\). The proof, discovered through AI-assisted formal proof search in Lean using AlphaProof Nexus, constructs a weighted sum \(\mathcal F\) of amplitudes whose coefficients factor vertex by vertex. Summing over the colours at one fixed vertex reduces the problem to an \((N-1)\times N\) matrix of effective edge weights. For the graph amplitudes \(ω\) and GHZ target \(Δ\), the row–column imbalance yields \(\mathcal F(ω)=0\) but \(\mathcal F(Δ)\neq0\), contradicting the required equality \(ω=Δ\). Finally, we give a physical interpretation of the AI-discovered mathematical proof.
Problem
Photonic GHZ states produced with probabilistic pair sources correspond to edge-coloured, complex-weighted graphs. The open question is whether a monochromatic quantum graph, which would generate an N-photon D-dimensional GHZ state, can exist beyond the known small cases.
Approach
The conjecture was formalised in Lean in the Formal Conjectures project. The formalisation encodes edge weights and defines perfect-matching sums recursively. AlphaProof Nexus, which combines language models with Lean compiler feedback, searched for and found a formal proof. The authors then extracted a tensor-algebraic argument from it: a weighted sum F of amplitudes with vertex-factorised coefficients, reduced to an (N-1)×N matrix of effective edge weights, for which F(ω)=0 but F(Δ)≠0.
Results
No complex-weighted monochromatic quantum graph exists for any even N≥4 with D≥N. The result is machine-checked in Lean, and the authors also give a physical interpretation of the proof in terms of measurements.