qedbot

Open quantum problems·quantum:35

Open Quantum Problem 35: existence of absolutely maximally entangled pure states

conjecture formal record: mixed F2 declared

Machine-checked by Palomar.

Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

declares divergences from its source source authors not contacted

Checks

2
  • verified·Palomar

    Registered by Palomar at e8c1e58c: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-11-02·commit e8c1e58c7e4d

    PALOMAR-2026-11-02-000014

  • verified·Palomar

    Registered by Palomar at 974bf30a: Comparator confirmed 2 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-11-02·commit 974bf30aa49e

    PALOMAR-2026-11-02-000010

Declared by the projects

6

As each project's formalization.yaml states it.

An absolutely maximally entangled state of twelve five-level systems: AME(12, 5) existszblore/fc-ame-12-5 · joined by anchor · Palomar

Read formalization.yaml

method
agent — Claude Opus 5.5
review
agent-reviewed (Zayn Blore)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
3 main results named, with an alignment table
sources
Symmetry-guided constructions of absolutely maximally entangled states in five open cases — formalizes, authors not-contacted; AME-paper-materials (the authors' reproducibility package) — formalizes, authors not-contacted
divergences
None in the statement, which is Formal Conjectures' own, copied verbatim. One proof step in the definition combineFirst differs: Formal Conjectures proves `i.1 - m < n - m` by `omega`, which under Lean's module system leaves a private auxiliary lemma named after the module, so the copies in Challenge and AME125.Defs could never compare equal in Comparator; both use `exact Nat.sub_lt_sub_right him i.2`. The proposition proved is the same, so the definition is the same, and audit/Audit.lean checks it against Formal Conjectures' original by rfl. The 12! permutations in `IsAME` are not enumerated: permuting the parties of a graph state gives the graph state of the permuted matrix (`AME125.permuteState_graphState`), so the condition becomes one fact about each set of six parties. The witness is the graph state with amplitude 5⁻⁶ · χ(xᵀ U x), χ(k) = exp(2πik/5), with U the upper triangle of the authors' matrix, so the edge weight between parties i and j is their entry (i, j) and the diagonal gives local phases. The general criterion (`AME125.graphState_isAME`) is proved for any even number of parties and any matrix over ZMod 5. The finite core is 924 inverse certificates, checked by `dec
checked by
Palomar
fc-ame-4-2zblore/fc-ame-4-2 · joined by anchor · no independent check

Read formalization.yaml

authors
Zayn Blore
method
agent — Claude Opus 5.5
review
author-verified (Zayn Blore)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, with an alignment table
sources
How entangled can two couples get? — formalizes, authors not-contacted; Quantum shadow enumerators — formalizes, authors not-contacted; Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity — formalizes, authors not-contacted
divergences
None in the statement, which is Formal Conjectures' own. The argument is the published one. The only step proved differently from the sources is the identity between the purity form of the shadow coefficient S₀ (Huber, Eltschka, Siewert and Gühne 2018, "HEGS", eq. (9) with j = 0) and Rains' |vᵀ σ_y^{⊗n} v|² (Rains 1999, section 4) for a pure state, which is proved directly, for any number of qubits, by a factorisation over qubits (`AME42.sum_sign_purity`) rather than through the general MacWilliams transform. No `native_decide`; every `decide` is over a finite table of at most 64 entries. HEGS equation numbers are those of arXiv:1708.06298v2.
checked by
nobody independent of its authors yet
fc-ame-4-6zblore/fc-ame-4-6 · joined by anchor · no independent check

Read formalization.yaml

authors
Zayn Blore
method
agent — Claude Opus 5.5
review
author-verified (Zayn Blore)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, with an alignment table
sources
Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem — formalizes, authors not-contacted; 2-unitary matrix U36 (authors' data files) — formalizes, authors not-contacted
divergences
None in the statement, which is Formal Conjectures' own. The 24 permutations in `IsAME` are not enumerated: the reduction depends only on which two parties are kept (`AME46.hasMaximallyMixedFirstReduction_of_kept`), giving 6 representatives. Amplitudes are represented exactly in ℤ[ω], ω = exp(iπ/10), and mapped into ℂ by a proved evaluation map. The finite core `AME46.gram_eq` is checked by `decide +kernel` (no `native_decide`) over the 6 representatives and 36 × 36 reduced entries, using the sparsity of the state. The state is defined from a table generated from the authors' data file; any table that passes the check is an AME state, and `AME46.table_amp_eq` records the match with the paper's form m · ω^p. `AME46.paperIdentities` proves the paper's explanation: the moduli satisfy a² + b² = c² = 1/2 and b/a = φ (the golden ratio), and the non-antipodal cancellations between rows are the paper's (S6) and (S8)–(S12), with (S8) corrected (the paper prints ω⁻⁴ for ω⁴), plus one three-term relation the paper does not list. `scripts/extract_relations.py` checks that these are exactly the non-antipodal cancellations of the matrix.
checked by
nobody independent of its authors yet
fc-ame-5-2zblore/fc-ame-5-2 · joined by anchor · no independent check

Read formalization.yaml

authors
Zayn Blore
method
agent — Claude
review
author-verified (Zayn Blore, Claude Fable 5.1 (independent agent review, 2026-09-24))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, with an alignment table
sources
Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions — formalizes, authors not-contacted; Absolutely Maximally Entangled Qudit Graph States — background, authors not-contacted
divergences
None in the statement, which is Formal Conjectures' own. The finite core `AME52.ringSign_trace` is checked by `decide +kernel` over all 120 permutations (no `native_decide`).
checked by
nobody independent of its authors yet
fc-ame-6-2zblore/fc-ame-6-2 · joined by anchor · no independent check

Read formalization.yaml

authors
Zayn Blore
method
agent — Claude Opus 5.5
review
author-verified (Zayn Blore, Claude Fable 5.1 (independent agent review, 2026-10-08), OpenAI Astra, gpt-6-astra (independent agent review, 2026-10-08))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, with an alignment table
sources
Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions — formalizes, authors not-contacted; Absolutely maximally entangled states of seven qubits do not exist — background, authors not-contacted; Absolutely Maximally Entangled Qudit Graph States — background, authors not-contacted
divergences
None in the statement, which is Formal Conjectures' own. The 720 permutations in `IsAME` are not enumerated. The general lemma `AME62.hasMaximallyMixedFirstReduction_of_kept` shows the reduction depends only on which parties are kept (20 sets). The prism's rotation symmetry (`AME62.prismSign_rotate`) and the cover `AME62.exists_rep` bring those 20 down to 4, via the general lemma `AME62.hasMaximallyMixedFirstReduction_of_invariant`. The finite core `AME62.prismSign_trace` is checked by `decide +kernel` over those 4 representative permutations (no `native_decide`).
checked by
nobody independent of its authors yet
Absolutely maximally entangled states of seven parties: for d >= 2, AME(7, d) exists exactly when d >= 3zblore/fc-ame-7 · joined by anchor · Palomar

Read formalization.yaml

method
agent — Claude Opus 5.5
review
agent-reviewed (Zayn Blore)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
6 main results named, with an alignment table
sources
Absolutely maximally entangled states of seven qubits do not exist — formalizes, authors not-contacted; Constraints on correlations in multiqubit systems — adapts, authors not-contacted; Complete Existence Classification of Seven-Partite Absolutely Maximally Entangled States — formalizes, authors not-contacted
divergences
None in the statements, which are Formal Conjectures' own, copied verbatim. One proof step in the definition combineFirst differs: Formal Conjectures proves `i.1 - m < n - m` by `omega`, which under Lean's module system leaves a private auxiliary lemma named after the module, so the copies in Challenge and AME7.Defs could never compare equal in Comparator; both use `exact Nat.sub_lt_sub_right him i.2`. The proposition proved is the same, so the definition is the same, and audit/Audit.lean checks it against Formal Conjectures' original by rfl. For AME(7, 2) the proofs use the real Pauli basis 1, X, Z, XZ (XZ = -iY) in place of 1, X, Y, Z; the weights, and so the even and odd parts, are the same. Reduced states on an arbitrary set of qubits are defined here (`AME72.red`) and connected to Formal Conjectures' `reducedDensityFirst` by `AME72.red_eq_reducedDensityFirst`. For local dimensions 2^a m with a >= 2 the proof uses circulant graph states over GF(4) and GF(8), found by search, and the product property, where Shi, Zhang, Zhao and Li cite earlier AME(7, 4) states and Reed-Solomon AME(7, 2^a) states. The finite checks (35 cut certificates per family, the Steane code facts, the seven
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 13
Also known as · 2
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OpenQuantumProblems/35.lean
  • FormalConjectures/OpenQuantumProblems/35.lean

Cite this record

qed.bot, “Open Quantum Problem 35: existence of absolutely maximally entangled pure states”, https://qed.bot/s/quantum-35, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.