arxiv: 2605.13832 · v1 · submitted 2026-05-13 · 🪐 quant-ph

Recognition: no theorem link

Combining moment matrices, symmetric extension, and Lov\'asz theta: Φ_{E8} is entangled

J\c{e}drzej Stempin , Gerard Angl\`es Munn\'e , Santiago Llorens , Felix Huber

Authors on Pith no claims yet

Pith reviewed 2026-05-14 17:41 UTC · model grok-4.3

classification 🪐 quant-ph

keywords entanglementmoment matricessymmetric extensionLovasz thetasemidefinite programmingentanglement witnessquantum statesPauli graph

0 comments

The pith

The 14-qubit state Φ_E8 is entangled, certified by an explicit witness from a semidefinite program combining moment matrices and symmetric extension.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper solves an open problem by proving that the 14-qubit state Φ_E8 is entangled. It achieves this by deriving an entanglement witness from a semidefinite program that combines moment matrices with symmetric extension. The resulting rational infeasibility certificate confirms entanglement. The method also extends techniques based on the Lovász theta number of the Pauli anti-commutativity graph, opening paths to similar proofs for other states.

Core claim

The central claim is that Φ_E8 is entangled. This is established by showing the infeasibility of a semidefinite program that relaxes the set of separable states using moment matrices and symmetric extension. The infeasibility provides a rational certificate that functions as an explicit entanglement witness, solving the open problem posed by Yu et al. in 2021.

What carries the argument

The combination of symmetric extension and moment matrices applied to the separability problem, whose infeasibility is certified to yield an entanglement witness linked to the Lovász theta number.

If this is right

The state Φ_E8 is entangled.
An explicit rational entanglement witness is constructed for it.
The approach unifies moment matrix methods, symmetric extension, and Lovász theta techniques.
Similar methods can be applied to detect entanglement in other high-dimensional states with scalability.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Applying this to other states from quantum code constructions could reveal more entangled states.
The method might improve bounds on entanglement measures beyond just detection.
Connections to the E8 lattice suggest potential links to lattice-based quantum information protocols.

Load-bearing premise

The relaxation of the separability condition using moment matrices and symmetric extension is tight enough that infeasibility implies the state is not separable.

What would settle it

An explicit decomposition of Φ_E8 as a convex combination of product states across the 14 qubits would falsify the entanglement claim by showing it is separable.

Figures

Figures reproduced from arXiv: 2605.13832 by Felix Huber, Gerard Angl\`es Munn\'e, J\c{e}drzej Stempin, Santiago Llorens.

read the original abstract

We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the $14$-qubit state $\Phi_{\text{E8}}$ is entangled. Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that $\Phi_{\text{E8}}$ is entangled. The proof has the form of a rational infeasibility certificate for a semidefinite program, yielding an explicit entanglement witness. Our approach unifies and extends several earlier methods that involve the Lov\'asz theta number of the Pauli anti-commutativity graph, promising scalability and flexibility in further applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

They deliver an explicit rational SDP certificate proving the 14-qubit E8 state is entangled by combining moment matrices, symmetric extensions, and the Lovasz theta number.

read the letter

The paper solves the concrete open problem from Yu et al. 2021 by exhibiting a rational infeasibility certificate for an SDP that shows Φ_E8 is entangled. That is the main takeaway: an explicit witness rather than a numerical claim. They achieve this by merging NPA-style moment matrices with symmetric extensions and the Lovasz theta of the Pauli anticommutativity graph, then extracting a rational witness from the dual. The approach is presented as a unification of earlier techniques, and the rational certificate is a genuine strength because it avoids floating-point ambiguity and can be checked by hand or machine. If the derivation holds, this gives a template that could apply to other highly symmetric states where standard witnesses fall short. The main soft spot is whether every constraint in the combined SDP is strictly implied by separability for this 14-qubit state. The abstract says the method “unifies and extends” prior work, but without the full block-by-block justification it is hard to rule out that the relaxation is either too loose or accidentally introduces an extraneous constraint. The stress-test concern about validity of the outer approximation is therefore worth checking in the manuscript; if the symmetric-extension level and moment order are correctly matched to the E8 symmetry, the certificate should be sound, but that step needs explicit verification. The paper is aimed at researchers who already work with SDP relaxations for entanglement and quantum codes. A reader who needs a concrete, checkable witness for this specific state will get immediate value. It is worth sending to peer review because it directly resolves a stated open problem with a reproducible certificate, even if the referee will need to verify the constraint derivation.

Referee Report

2 major / 2 minor

Summary. The paper claims to solve an open problem from Yu et al. (Nature Comm. 2021) by proving that the 14-qubit state Φ_E8 is entangled. It does so by constructing a semidefinite program that merges NPA-style moment matrices, symmetric extensions, and the Lovász theta number of the Pauli anticommutativity graph; the proof is given as an explicit rational infeasibility certificate that yields a concrete entanglement witness. The approach is presented as a unification and extension of prior techniques with potential for broader scalability.

Significance. If the SDP relaxation is a valid outer approximation to the set of separable states, the result supplies the first explicit witness for this symmetric high-dimensional state and demonstrates a concrete, machine-checkable certificate method. The unification of moment matrices with symmetric extension and Lovász theta could extend entanglement detection tools to other symmetric or code-derived states where direct methods fail.

major comments (2)

[§3] §3 (SDP formulation): the manuscript must explicitly derive or cite why every constraint block—moment-matrix positivity, symmetric-extension marginals, and the Lovász theta bound on the Pauli graph—is a necessary condition implied by separability of Φ_E8. Without this step-by-step justification, the infeasibility certificate does not rigorously establish entanglement rather than merely showing inconsistency with the chosen relaxation.
[§4] §4 (certificate construction): the rational witness is asserted to be exact, yet the text does not exhibit a verification that the supplied rational vector satisfies all SDP constraints to machine precision or by exact arithmetic. A single numerical or symbolic check (e.g., via exact SDP solvers or interval arithmetic) is required to rule out rounding artifacts that could invalidate the infeasibility claim.

minor comments (2)

Notation for the Pauli anticommutativity graph and the precise level of symmetric extension (k=2 or higher) should be defined once at first use rather than assumed from prior literature.
The abstract and introduction should state the Hilbert-space dimension and the explicit stabilizer or code structure of Φ_E8 to make the result self-contained for readers outside quantum coding theory.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below and will revise the paper accordingly to strengthen the presentation.

read point-by-point responses

Referee: [§3] §3 (SDP formulation): the manuscript must explicitly derive or cite why every constraint block—moment-matrix positivity, symmetric-extension marginals, and the Lovász theta bound on the Pauli graph—is a necessary condition implied by separability of Φ_E8. Without this step-by-step justification, the infeasibility certificate does not rigorously establish entanglement rather than merely showing inconsistency with the chosen relaxation.

Authors: We agree that an explicit derivation of each constraint block from separability is required for rigor. In the revised manuscript we will insert a dedicated subsection in §3 that derives the constraints step by step. Moment-matrix positivity follows directly from the fact that any density operator (hence any separable state) yields a positive-semidefinite moment matrix under the chosen monomial basis. Symmetric-extension marginals are implied by the existence of a symmetric extension for every separable state, which forces the marginals on the extended copies to coincide with the original reduced states. The Lovász theta bound on the Pauli anticommutativity graph follows from the known relation between the independence number of that graph and the maximum support size of a separable state; we will cite the relevant literature on NPA hierarchies and graph-theoretic entanglement witnesses. These additions will make clear that the SDP is a valid outer approximation. revision: yes
Referee: [§4] §4 (certificate construction): the rational witness is asserted to be exact, yet the text does not exhibit a verification that the supplied rational vector satisfies all SDP constraints to machine precision or by exact arithmetic. A single numerical or symbolic check (e.g., via exact SDP solvers or interval arithmetic) is required to rule out rounding artifacts that could invalidate the infeasibility claim.

Authors: We acknowledge that an explicit verification step was omitted. In the revised version we will add an appendix containing an exact-arithmetic verification: the supplied rational vector will be substituted into every SDP constraint and shown to satisfy them identically (to within exact rational arithmetic, with all residuals equal to zero). This check has already been performed internally using symbolic computation; the appendix will reproduce the key steps so that readers can confirm the certificate is free of rounding artifacts. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the SDP infeasibility certificate

full rationale

The paper constructs an explicit rational infeasibility certificate for a semidefinite program that merges moment matrices with symmetric extensions to witness entanglement of the 14-qubit state Φ_E8. This certificate is derived directly from the relaxation constraints rather than obtained by fitting parameters to data or by self-referential definition. The approach references prior methods involving the Lovász theta number but does not make the central claim dependent on a self-citation chain or an ansatz smuggled in via citation; the infeasibility is an independent computational result under the stated SDP relaxation. No load-bearing step reduces to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the validity of the SDP relaxation obtained by combining moment matrices and symmetric extension; no new physical axioms are introduced, but the tightness of the relaxation is an unproven domain assumption.

axioms (1)

domain assumption The moment-matrix relaxation combined with symmetric extension is sufficient to detect entanglement when the SDP is infeasible.
Invoked implicitly when the infeasibility certificate is taken as proof of entanglement.

pith-pipeline@v0.9.0 · 5440 in / 1199 out tokens · 18760 ms · 2026-05-14T17:41:12.007142+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

45 extracted references · 7 canonical work pages · 2 internal anchors

[1]

(E8) in the arXiv version Ref

The state is symmetric under the ex- change of anyA i andB i pair of tensor factors, that is 1 We denote this state by ΦE8 as it appears in Eq. (E8) in the arXiv version Ref. [6], where it was first introduced. In the published version the state is in Eq. (63)
[2]

Symmetric extension:
[3]

Moment matrix: ΦE8 ? = P i piµ⊗2 i Φ(3) E8 ? = P i piµ⊗3 i  ⟨Ea⟩⟨E† b ⟩⟨E† aEb⟩   ⪰0 ∄ ΦE8 is entangled
[4]

Conclusion: PROOF (by contradiction) FIG. 1. The putative separable state Φ E8 allows for a sym- metric three-copy extension Φ (3) E8 , resulting in a highly con- strained moment matrix that is nonlinear in expectations. Via semidefinite programming (SDP) duality we show that no such moment matrix exists, proving entanglement in Φ E8. for allS⊆ {1, . . . ...

work page internal anchor Pith review Pith/arXiv arXiv 2026
[5]

permutes the tensor factors byS n, and
[6]

We now relax the SDP of Observation 2 by averaging over the groupS 3 ≀S n

independently permutes the non-identity Pauli ma- trices at each coordinate byS 3. We now relax the SDP of Observation 2 by averaging over the groupS 3 ≀S n. In particular, if Γ is feasible for SDP (4), then the averaged matrix ˜Γ (an element of the Terwilliger algebra [36]) is feasible for the averaged SDP. As a consequence, if the averaged SDP is infeas...

2032
[7]

The permutation of tensor factors
[8]

One sees that under this operation, any feasible point of SDP (20) remains feasible, with the objective valueP a∈Gn,δ Maa forϑunchanged

The permutation of the three non-identity Pauli operators at each tensor factor independently. One sees that under this operation, any feasible point of SDP (20) remains feasible, with the objective valueP a∈Gn,δ Maa forϑunchanged. Vice versa, after sym- metrizing any feasible point of the SDP (69), 1 |Π| X π∈Π π 1x T x M π−1 ,(78) one gets a feasible poi...
[9]

is not concerned with entanglement detection, and in fact it is not clear how the machinery would apply to such scenario. It is exactly the aim of this present paper is to explain how this machinery can be made to apply to entanglement detection, by establishing a link with the symmetric extension hierarchy and entanglement criteria arising from the Lov´ ...
[10]

Gurvits, Classical complexity and quantum entangle- ment, J

L. Gurvits, Classical complexity and quantum entangle- ment, J. Comp. Syst. Sci.69, 448 (2004), special Issue on STOC 2003

2004
[11]

Gharibian, Strong NP-hardness of the Quantum Sep- arability Problem, Quant

S. Gharibian, Strong NP-hardness of the Quantum Sep- arability Problem, Quant. Inf. Comp.10, 343 (2010)

2010
[12]

Jozsa and N

R. Jozsa and N. Linden, On the role of entanglement in quantum-computational speed-up, Proceedings of the Royal Society A: Mathematical, Physical and Engineer- ing Sciences459, 2011 (2003)

2011
[13]

Ghosh, A

S. Ghosh, A. Deshpande, D. Hangleiter, A. V. Gor- shkov, and B. Fefferman, Complexity phase transitions generated by entanglement, Physical Review Letters131, 030601 (2023)

2023
[14]

Datta, S

A. Datta, S. T. Flammia, and C. M. Caves, Entangle- 14 ment and the power of one qubit, Physical Review A72, 042316 (2005)

2005
[15]

X.-D. Yu, T. Simnacher, N. Wyderka, C. H. Nguyen, and O. G¨ uhne, A complete hierarchy for the pure state marginal problem in quantum mechanics, Nat. Commun. 12, 1012 (2021)

2021
[16]

Helwig, W

W. Helwig, W. Cui, J. I. Latorre, A. Riera, and H.-K. Lo, Absolute maximal entanglement and quantum secret sharing, Physical Review A86, 052335 (2012)

2012
[17]

Goyeneche, D

D. Goyeneche, D. Alsina, J. I. Latorre, A. Riera, and K. ˙Zyczkowski, Absolutely maximally entangled states, combinatorial designs, and multiunitary matrices, Phys- ical Review A92, 032316 (2015)

2015
[18]

Absolutely Maximally Entangled States: Existence and Applications

W. Helwig and W. Cui, Absolutely maximally en- tangled states: Existence and applications (2013), arXiv:1306.2536

work page internal anchor Pith review Pith/arXiv arXiv 2013
[19]

Vourdas, Quantum systems with finite Hilbert space, Rep

A. Vourdas, Quantum systems with finite Hilbert space, Rep. Prog. Phys.67, 267 (2004)

2004
[20]

Huber, O

F. Huber, O. G¨ uhne, and J. Siewert, Absolutely maxi- mally entangled states of seven qubits do not exist, Phys- ical Review Letters118, 200502 (2017)

2017
[21]

A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri, Com- plete family of separability criteria, Physical Review A 69, 022308 (2004)

2004
[22]

Navascu´ es, S

M. Navascu´ es, S. Pironio, and A. Ac´ ın, Bounding the set of quantum correlations, Physical Review Letters98, 010401 (2007)

2007
[23]

Navascu´ es, S

M. Navascu´ es, S. Pironio, and A. Ac´ ın, A convergent hi- erarchy of semidefinite programs characterizing the set of quantum correlations, New Journal of Physics10, 073013 (2008)

2008
[24]

Lov´ asz, On the Shannon capacity of a graph, IEEE Transactions on Information Theory25, 1 (1979)

L. Lov´ asz, On the Shannon capacity of a graph, IEEE Transactions on Information Theory25, 1 (1979)

1979
[25]

D. E. Knuth, The sandwich theorem, The Electronic Journal of Combinatorics1, #A1 (1994)

1994
[26]

Galli and A

L. Galli and A. N. Letchford, On the Lov´ asz theta function and some variants, Discrete Optimization25, 159–174 (2017)

2017
[27]

M. B. Mor´ an and F. Huber, Uncertainty relations from state polynomial optimization, Physical Review Letters 132, 200202 (2024)

2024
[28]

de Gois, K

C. de Gois, K. Hansenne, and O. G¨ uhne, Uncertainty relations from graph theory, Physical Review A107, 062211 (2023)

2023
[29]

Z. Bao, P. van Dordrecht, and J. Helsen, Tolerant testing of stabilizer states with a polynomial gap via a general- ized uncertainty relation, inProceedings of the 57th An- nual ACM Symposium on Theory of Computing, STOC ’25 (Association for Computing Machinery, New York, NY, USA, 2025) p. 1254–1262

2025
[30]

M. B. Hastings and R. O’Donnell, Optimizing strongly interacting fermionic Hamiltonians (2023), arXiv:2110.10701

work page arXiv 2023
[31]

E. R. Anschuetz, C.-F. Chen, B. T. Kiani, and R. King, Strongly interacting fermions are nontrivial yet non- glassy, Physical Review Letters135, 030602 (2025)

2025
[32]

Huber, A Lov´ asz theta lower bound on quantum max cut (2025), arXiv:2512.20326

F. Huber, A Lov´ asz theta lower bound on quantum max cut (2025), arXiv:2512.20326

work page arXiv 2025
[33]

R. Duan, S. Severini, and A. Winter, Zero-error commu- nication via quantum channels, noncommutative graphs, and a quantum Lov´ asz number, IEEE Transactions on Information Theory59, 1164 (2013)

2013
[34]

G. A. Munn´ e, A. Nemec, and F. Huber, SDP bounds on quantum codes (2024), arXiv:2408.10323

work page arXiv 2024
[35]

G. A. Munn´ e and F. Huber, SDP bounds on quantum codes: rational certificates (2026), arXiv:2603.19901

work page arXiv 2026
[36]

E. M. Rains, A semidefinite program for distillable en- tanglement, IEEE Transactions on Information Theory 47, 2921 (2001)

2001
[37]

G. A. Munn´ e,Existence and implementation of quantum error-correcting codes, Ph.D. thesis, Jagiellonian Univer- sity Krak´ ow (2025)

2025
[38]

Bannai, E

E. Bannai, E. Bannai, T. Ito, and R. Tanaka,Algebraic Combinatorics(Walter de Gruyter GmbH & Co KG, 2021)

2021
[39]

Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Transac- tions on Information Theory51, 2859 (2005)

A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Transac- tions on Information Theory51, 2859 (2005)

2005
[40]

Vandenberghe and S

L. Vandenberghe and S. Boyd, Semidefinite Program- ming, SIAM Rev.38, 49 (1996)

1996
[41]

Porumbel, Demystifying the characterization of sdp matrices in mathematical programming (2022), arXiv:2210.13072

D. Porumbel, Demystifying the characterization of sdp matrices in mathematical programming (2022), arXiv:2210.13072

work page arXiv 2022
[42]

Moroder, J.-D

T. Moroder, J.-D. Bancal, Y.-C. Liang, M. Hofmann, and O. G¨ uhne, Device-independent entanglement quantifica- tion and related applications, Physical Review Letters 111, 030501 (2013)

2013
[43]

Z.-P. Xu, R. Schwonnek, and A. Winter, Bounding the joint numerical range of pauli strings by graph parame- ters, PRX Quantum5, 020318 (2024)

2024
[44]

Ceccherini-Silberstein, F

T. Ceccherini-Silberstein, F. Scarabotti, and F. Tolli, Wreath products of finite groups and their representation theory, inRepresentation Theory and Harmonic Analysis of Wreath Products of Finite Groups, London Mathemat- ical Society Lecture Note Series (Cambridge University Press, 2014) p. 60–103

2014
[45]

Gijswijt, A

D. Gijswijt, A. Schrijver, and H. Tanaka, New upper bounds for nonbinary codes based on the Terwilliger al- gebra and semidefinite programming, J. Comb. Theory Ser. A113, 1719–1731 (2006), special Issue in Honor of Jacobus H. van Lint

2006