Skip to content
Level A · Machine-checkable Hard Quantum information P-quantum-35

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

Open benchmark statement: does an AME(8,4) state exist?

Current state (tracked automatically)

All tracked facts and sources
FactValueSource
Formal Conjectures: research statements in the file10 open, 19 solvedFormal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-11). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)
Cite
@misc{cairn-quantum-35,
  title        = {Open Quantum Problem 35: existence of absolutely maximally entangled pure states},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/quantum-35}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-11}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fquantum-35.json)](https://cairn-commons.com/problems/quantum-35)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

ame_8_4_open. Open benchmark statement: does an state exist?

ame_8_6_open. Open benchmark statement: does an state exist?

ame_8_10_open. Open benchmark statement: does an state exist?

ame_10_6_open. Open benchmark statement: does an state exist?

ame_10_10_open. Open benchmark statement: does an state exist?

ame_11_3_open. Open benchmark statement: does an state exist?

ame_11_6_open. Open benchmark statement: does an state exist?

ame_12_6_open. Open benchmark statement: does an state exist?

ame_12_10_open. Open benchmark statement: does an state exist?

oqp_35. Open Quantum Problem 35: classify all pairs with and for which an state exists.

Problem: For which numbers of parties and local dimensions does there exist a pure absolutely maximally entangled state ?

A pure state on parties of local dimension is called absolutely maximally entangled (AME) if, for every subset of at most half of the parties, the corresponding reduced density matrix is maximally mixed.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.OpenQuantumProblems.«35» (10 statements).

theorem ame_8_4_open :
    ExistsAME 8 4
theorem ame_8_6_open :
    ExistsAME 8 6
theorem ame_8_10_open :
    ExistsAME 8 10
theorem ame_10_6_open :
    ExistsAME 10 6
theorem ame_10_10_open :
    ExistsAME 10 10
theorem ame_11_3_open :
    ExistsAME 11 3
theorem ame_11_6_open :
    ExistsAME 11 6
theorem ame_12_6_open :
    ExistsAME 12 6
theorem ame_12_10_open :
    ExistsAME 12 10
theorem oqp_35 :
    {nd : ℕ × ℕ | 2 ≤ nd.1 ∧ 2 ≤ nd.2 ∧ ExistsAME nd.1 nd.2} = oqp_35.answer

What counts as progress

  • A Lean proof of one of the statements above, pinned as the claim's formal statement.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

  • Open Quantum Problems, Problem 35: <https://oqp.iqoqi.oeaw.ac.at/existence-of-absolutely-maximally-entangled-pure-states>
  • Formal Conjectures issue #3452: <https://github.com/google-deepmind/formal-conjectures/issues/3452>
  • W. Helwig, W. Cui, A. Riera, J. I. Latorre, and H.-K. Lo, Absolute Maximal Entanglement and Quantum Secret Sharing, Phys. Rev. A 86, 052335 (2012), arXiv:1204.2289.
  • D. Goyeneche, D. Alsina, J. I. Latorre, A. Riera, and K. Życzkowski, Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices, Phys. Rev. A 92, 032316 (2015), arXiv:1506.08857.
  • A. Higuchi and A. Sudbery, How entangled can two couples get?, Phys. Lett. A 273, 213-217 (2000), arXiv:quant-ph/0005013.
  • A. J. Scott, *Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions*, Phys. Rev. A 69, 052330 (2004), arXiv:quant-ph/0310137.
  • F. Huber, O. Gühne, and J. Siewert, Absolutely maximally entangled states of seven qubits do not exist, Phys. Rev. Lett. 118, 200502 (2017), arXiv:1608.06228.
  • F. Huber and M. Grassl, Quantum Codes of Maximal Distance and Highly Entangled Subspaces, Quantum 4, 284 (2020), arXiv:1907.07733.
  • S. A. Rather, A. Burchardt, W. Bruzda, G. Rajchel-Mieldzioć, A. Lakshminarayan, and K. Życzkowski, Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem, Phys. Rev. Lett. 128, 080507 (2022), arXiv:2104.05122.
  • G. Rajchel-Mieldzioć, R. Bistroń, A. Rico, A. Lakshminarayan, and K. Życzkowski, Absolutely maximally entangled pure states of multipartite quantum systems, arXiv:2508.04777 (2025).
  • S. Bevins and Y. Bidav, Symmetry-guided constructions of absolutely maximally entangled states in five open cases, arXiv:2608.05781 (2026).
  • F. Shi, X. Zhang, Q. Zhao, and L. Li, Complete Existence Classification of Seven-Partite Absolutely Maximally Entangled States, arXiv:2608.01011 (2026).

This file formalizes the problem of determining for which pairs there exists an absolutely maximally entangled pure state .

We represent an -partite state of local dimension by the finite-dimensional Hilbert space EuclideanSpace ℂ (Config n d), whose coordinates in the computational basis are amplitudes. The helper mkStateVector turns an amplitude function into such a state, and normalization is imposed explicitly via IsNormalized, i.e. via the ambient norm.

The main reusable lemma is reducedDensityFirst_of_completion: if a state is a uniform superposition over the graph of an injective completion function completion : Config m d → Config (n - m) d, then the reduced state on the first parties is maximally mixed.

As demonstration, we show that the Bell states with and GHZ states with are AME states, and the GHZ state with is not an AME state.

Source and licence

Imported from Formal Conjectures (Open quantum problems), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.