What was already known
Higuchi and Sudbery exhibited the candidate maximiser. Brierley and Higuchi proved that it is a local maximum.
AI involvement
Antony Lewis credits agents using Claude Opus and Sonnet 5.5 and GPT 6.1 sol with producing the results and text under human supervision.
- The most entangled states of four and seven qubitsAI attribution and proof provenance
Importance
The result proves the global entropy maximum and identifies every state attaining it. The proof combines moment inequalities for the three reduced states with a cubic upper bound on the entropy function.
Technical verification
Lewis reports a Lean 4 formalization of the entropy bound, attainment and equality classification. The paper identifies the compiled-code checks for two separate certificate results, outside this theorem.
Formal checking
Lewis reports a Lean 4 formalization of the entropy bound, attainment and equality classification. The paper identifies the compiled-code checks for two separate certificate results, outside this theorem.
- Checker
- Lean 4 kernel, as documented by Antony Lewis
- Scope
- For pure states of four qubits, the mean von Neumann entropy of the three balanced cuts is at most bits. Equality holds exactly for the Higuchi–Sudbery state and its complex conjugate, up to independent unitary transformations on the four qubits.
- Basis
- Reported by the linked checker
- Lewis’s Lean formalization and theorem indexChecked statements and verification scope
Human understanding
Lewis reports supervising the work. The paper credits agents with its proof and exposition.
Correction and publication history
New curated result with documented central AI work and a scoped checking assessment.
Read this published revision