Pith.

Quantum Physics · arXiv:2611.17216 v1 · submitted 12 Nov 2026 · 48 references

Explicit Absolutely Maximally Entangled states in dimensions twice a prime power

Palash Pandya

The paper says

“Absolutely maximally entangled (AME) states are pure multipartite states with maximally mixed reductions on every set of at most half the parties.”

more of the abstract

We construct explicit families in local dimension 2q, twice an odd prime power q, using an established coupling of qubits and q-level systems. The q-level states remove interference between branches, so the qubit states need maximally mixed reductions only on average. This gives AME(9,2q) and AME(11,2q) for every odd prime power q ≥ 5, AME(13,2q) for q ≥ 17, AME(15,2q) for q ≥ 9, and AME(17,2q) for q ≥ 67. For every odd N ≥ 3, the same coupling gives AME(N,2q) under the sufficient condition q ≥ max{N,2N−2} on the odd prime power q. Within this coupling, the smallest such q must grow exponentially with N. Combined with known inputs and products, these families complete the nine-party classification: for integer d ≥ 2, an AME(9,d) state exists if and only if d ≥ 3. Choosing the branch pairing also gives AME(15,2p) states with a cyclic shift of the parties compensated by local unitaries, for every prime p ≡ 1 (mod 15).

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Solid, reproducible construction paper that completes the AME(9,d) classification; the only real soft spot is the single external AME(9,6) input behind d=6, which the artifact does not re-verify and which a one-line proof change would isolate. This line is wrong

2 major objections · 3 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 48 references say.

The paper says, at Appendix D2 / Corollary II.4

The review did not quote this passage.

Pith says: Objection 1 of 2 · major

Corollary II.4 is stated as an unconditional if-and-only-if classification, but for d=2s with 3|s and no other odd prime divisor the proof depends entirely on Kitamura's AME(9,6) state [29]. Appendix D2 first says "We checked both in exact arithmetic" and then states that the companion repository does not include Kitamura's original matrix and that without it the runner reports the AME(9,6) check as "not run rather than passed".

more of objection 1

Because Proposition II.7 together with the capacity bound K≤q excludes q=3 inside this paper's own coupling, this external input is load-bearing for the headline classification. I am not asking that the cited Lean proof be reproduced; I am asking that the manuscript either include the matrix and a passed exact certificate, or state explicitly in Corollary II.4 and the abstract that the classification is conditional on the external Lean proof, and remove the conflicting "checked both in exact arithmetic" wording.

The paper says, at Section II.C

The review did not quote this passage.

Pith says: Objection 2 of 2 · major

The written proof applies Kitamura's state to every d=2s with 3|s, although d=2·3^m with m≥2 is already covered by Theorem II.3 with q=3^m≥9, and cases with a prime factor p≥5 are covered by AME(9,2p). The external state is therefore indispensable only at d=6. Please either reorganize the case split so that this is visible, or add a remark stating that [29] is used only for d=6. This would not change the mathematical conclusion but would make the verification target precise.

3 minor objections

The paper says, at Theorem II.3

Pith says: minor objection 1 of 3

The notation q_N for the sufficient threshold is easy to confuse with the local dimension q; a symbol such as q_min(N) or q_thr(N) would be clearer.

The paper says, at Appendix D2

Pith says: minor objection 2 of 3

The phrase "the AME(9,6) check as not run rather than passed" should be reconciled with the earlier sentence "We checked both in exact arithmetic"; as written, a reader cannot tell which of the two external states passed an exact check in the companion repository.

show 1 more

The paper says, at Conclusions

Pith says: minor objection 3 of 3

The final paragraph repeats the abstract's classification claim without the caveat about the external AME(9,6) input; after the Appendix D2 issue is resolved, the conclusion should mirror the precise dependency stated there.

What would settle it

Obtain Kitamura's AME(9,6) state from the cited Lean witness (ame-9-6-lean, commit 500ee827dffb, lean/AME96/Data.lean) or from the Hontarenko–Życzkowski amplitude description (arXiv:2610.17170v1, Secs. 7.2–7.4 and Apps. D–E), and run the exact check the repository skips: in exact arithmetic, verify that for each of the 126 four-party subsets A of {1,...,9} the reduction ρ_A = Tr_{A^c}|ψ⟩⟨ψ| equals I_6^4/6^4, and that grouping by four binary digits yields sixteen branches each equal to an AME(9,3) graph state as claimed in Appendix D2. If the check passes, the classification's only external dependency is closed and the artifact can be updated to report 'passed'.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence moderate
  2. Skeptic agrees 3 min 7 s · 26,680 tokens read, 31,667 written
  3. Editor wrote the verdict above 30 s · 27,630 tokens read, 4,680 written
  4. Referee major revision: 2 major objections, 3 minor 1 min 10 s · 27,077 tokens read, 10,469 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

Bottom line: this is a solid constructive paper and deserves a serious referee. The headline claim—AME(9,d) exists for every integer d≥3—looks correct, and the one real soft spot is narrow and honestly disclosed: the d=6 case rests on Kitamura's external AME(9,6) state, which the companion artifact does not re-verify.

What's actually new: explicit AME(N,2q) families at N=13,15,17 with thresholds 17,9,67; the extension of the N=9,11 families beyond the known q=5 members; the if-and-only-if classification at nine parties; the cyclic N=15 family; the general odd-N bound; and the rank lower bounds of Prop. II.7. The coupling principle itself is explicitly credited to Atlas, Kitamura, and Shi et al., which is the right call. No overclaiming about novelty.

Where the paper earns its keep: Prop. II.1 is short and clean; the qubit mixtures are specified by explicit Pauli groups with a weight criterion; the finite-field parents come with exact checks (M \bar MT = −I, every square submatrix invertible, every balanced cut verified); the rank bounds are Farkas certificates with displayed nonnegative combinations. The companion repo ships the finite data and a checker. This is reproducible work in the sense that matters.

The soft spot is the one the stress test identifies. Appendix D2 first says "We checked both in exact arithmetic" and later says the runner reports the AME(9,6) check as not run because Kitamura's original matrix is not in the repository; the Lean proof was read but not rebuilt. That is a reporting tension and a genuine verification gap for the load-bearing external input. But the gap is narrower than the written proof makes it look: Theorem II.3 with q=9,27,... already covers d=18,54,..., and odd factors with a prime divisor p≥5 are covered by AME(9,2p). Only d=6 actually needs Kitamura. A one-line refinement of the proof shrinks the dependency to that single case, so the fix is cheap: include the matrix and run the exact check, or rebuild the Lean proof. Everything else feeding the classification is internally certified.

Minor: the (15,7) and (17,22) rank-bound certificates live in the repo rather than on the page; the nine- and thirteen-party identities are written out, the other two are replayed by the checker. Not a problem, just a place where a referee has to run code or trust the repo.

Audience: anyone tracking AME existence, multipartite entanglement, or quantum MDS codes. I would accept this for peer review and ask the authors to close the AME(9,6) gap and resolve the Appendix D2 wording before acceptance. The thresholds are explicitly sufficient rather than optimal, so there is no issue there.

The strongest objection

Corollary II.4 claims AME(9,d) exists if and only if d ≥ 3, and the abstract presents the completed classification as a headline. The proof routes every d = 2s with 3|s through Kitamura's AME(9,6) state [29], an input the paper's own machinery cannot produce: Proposition II.7 proves every 4-uniform nine-qubit mixture has rank at least 4, so with the capacity bound K ≤ q this excludes q = 3 (Sec. IIE). Appendix D2 states that the companion repository does not include Kitamura's original matrix and that 'without it the runner reports the AME(9,6) check as not run rather than passed'; the same appendix earlier says 'We checked both in exact arithmetic,' a reporting tension. The Lean proof at commit 500ee827dffb was read but not rebuilt. A refinement matters: the external state is truly load-bearing only for d = 6, because d = 2·3^m with m ≥ 2 is already covered by Theorem II.3 with q = 3^m ≥ 9, and odd factors with a prime divisor p ≥ 5 are covered by AME(9,2p); the written proof, however, uses Kitamura for all 3|s cases. If AME(9,6) did not exist, the if-and-only-if claim would fail at d = 6. This is a verification gap in an otherwise self-contained artifact, not an internal inconsistency; it is the single most load-bearing premise of the central claim.

Reading in good faith: the paper's core construction is the coupling of Proposition II.1 plus three fully specified ingredient families. The coupling proof is clean and parameter-free. The qubit mixtures for N = 13, 15, 17 are stabilizer projectors whose uniformity criterion (Appendix B1) is a standard weight argument, and the claimed weights, generator counts, and branch counts are backed by exact certificates in the companion repository; the Atlas and Kitamura mixtures for N = 9, 11 are independently checked in-repo through the average-sign test (Appendix B3). The Cauchy parents (Lemma C.1) are proven in-paper for every odd prime power q ≥ N, with a correct determinant argument for the extended all-ones column. The small-field parents are either explicitly constructed with stated check counts (e.g., the F_121 matrix with all 12,869 square submatrices, the F_49 codes, the extended RS codes) or cited to published sources (Bevins–Bidav, Hontarenko–Życzkowski) whose relevant equations are named. The rank bounds of Proposition II.7 are Farkas certificates, with the N = 9 and N = 13 identities displayed so they can be checked by hand. I found no internal inconsistency in the coupling or the family proofs. The single load-bearing concern is the classification's reliance on the external AME(9,6) state. A useful refinement to the reader's statement: the dependency is narrower than 'every pure power of 3' — Theorem II.3 already gives AME(9,2·3^m) for m ≥ 2, so the genuinely load-bearing instance is d = 6. That instance is exactly the one the paper's rank bound excludes from its own coupling, and it is the case the artifact does not verify. The existence of AME(9,6) has independent support (Kitamura's Lean proof, HZ amplitude description), so this is not an attack on the cited result; it is a reproducibility gap the paper itself flags, sitting at the entry gate of the headline classification. The error probability is low, but the verification is cheap and the claim is strong, so a CONDITIONAL verdict with a request to close the d = 6 check is proportionate. No verdict change from the reader is needed.

The referee's report

If the claims are correct, the paper gives valuable explicit infinite families in dimensions that the product construction cannot reach, and it completes the nine-party local-dimension classification. The coupling proof in Proposition II.1 is simple and convincing, and the explicit qubit groups, parent graphs, and linear-programming/Farkas certificates are a real strength: the manuscript ships exact arithmetic certificates and reconstruction code for the finite ingredients. The paper is also unusually transparent about which checks were run and which remain open. The main caveat is that the headline classification depends on Kitamura's external AME(9,6) state, and the paper's own appendix reports that this input was not re-verified in the companion repository. This affects the classification's status as a self-contained artifact, not the internal validity of Theorem II.3.

Pith's reading of the paper (a machine's summary, not the authors')

The paper constructs explicit infinite families of absolutely maximally entangled (AME) states for 9, 11, 13, 15, and 17 parties, in local dimension twice an odd prime power. The key trick is to couple a mixture of qubit states, which need only be uniform on average, with a set of $q$-level states that cancel interference exactly, obtained by projecting one party of a larger AME state. This bypasses the known impossibility of a pure qubit AME state for these party numbers. The families are explicit enough to specify each amplitude as a sum of at most 64 terms, and the paper completes the nine-party classification: an AME(9,d) state exists for every integer d≥3, and none exists at d=2. If the construction is correct, these states are available as concrete multipartite entangled resources for quantum error correction and secret sharing, with required local dimensions that grow at most exponentially in the number of parties.

What carries the argument. The coupling of Proposition II.1: a state |Ψ⟩ = ∑_a √λ_a |u_a⟩⊗|v_a⟩, where the q-level states |v_a⟩ satisfy Tr_{A^c}|v_a⟩⟨v_b| = δ_{ab} I_A/q^k for every set A of k parties, and the qubit mixture ρ_bin = ∑_a λ_a |u_a⟩⟨u_a| satisfies Tr_{A^c}ρ_bin = I_A/2^k. The q-level states are obtained by projecting one party of an AME(N+1,q) parent (Lemma A.1), which guarantees the required orthogonality and vanishing cross blocks. The qubit mixture is built from a commuting Pauli group whose nonidentity words all have weight greater than k, so its normalized projector is k-uniform (Appendix B). The coupling separates the problem: the q-level side can supply at most q branches (capacity bound, Appendix F1), and the qubit side must have rank at most q (Theorem II.6). The paper gives explicit qubit mixtures of ranks 4, 2, 16, 8, and 64 for N=9, 11, 13, 15, and 17, together with parents for each required q, including Cauchy graph states (Lemma C.1) and finite-field codes (Appendix C3).

Core claim. The paper proves that for every odd number of parties N=9,11,13,15,17 and every odd prime power q above a stated threshold (5, 5, 17, 9, 67 respectively), an AME(N,2q) state exists. The construction uses a superposition of K branches, each branch pairing an N-qubit state with an N-party q-level state. The q-level states are obtained by projecting the reference party of an AME(N+1,q) parent; their cross-block reductions vanish, so they cancel all interference between distinct branches. The qubit mixture therefore needs only to have maximally mixed reductions on every set of k=⌊N/2⌋ parties — a strictly weaker condition than requiring a pure AME qubit state. The paper supplies explicit qubit mixtures, built from known codes or commuting Pauli groups, and explicit parents, built from Cauchy matrices, Reed–Solomon codes, or finite-field constructions, for each N and each q in the stated range. Combined with product constructions and an external AME(9,6) state, the nine-party case yields the complete integer-dimension classification: AME(9,d) exists if and only if d≥3.

The premise it rests on. The nine-party classification depends on the existence of an AME(9,6) state that the paper does not independently verify; if that external state does not exist, the product construction would fail for dimensions whose odd factor is a pure power of three.

If the paper is right (Pith's inferences, not the authors')

For quantum error correction and secret sharing, AME(N,2q) states provide explicit pure ⌊N/2⌋-uniform states that can encode a secret such that any set of at most half the parties learns nothing.

The nine-party local-dimension question is settled: AME(9,d) exists for every integer d≥3 and fails only at d=2, removing a long-standing gap in the existence table.

The coupling method is general: for every odd N≥3, an AME(N,2q) state exists whenever q≥max{N,2^{N-2}}, and for q≥N feasibility inside this coupling is characterized by the minimum rank of a k-uniform qubit mixture.

The cyclic family for N=15 and primes p≡1 mod 15 produces AME(15,2p) states with a compensated cyclic permutation symmetry, adding a structural constraint that may be useful for symmetric quantum protocols.

The nine-party classification inherits a load-bearing external premise: the paper relies on an AME(9,6) state whose 4-party uniformity check it reports as not run rather than passed. If that state were invalid, the classification would still cover all d not divisible by 3, but the product argument would miss dimensions d=2·3^k (e.g., 18, 54).

The rank bounds in Proposition II.7 are proven by necessary linear inequalities on Pauli correlators, but the paper notes that satisfying those inequalities does not guarantee a valid density matrix. The true minimal ranks for the qubit mixtures at N=13,15,17 could be larger than the bounds, which would raise the thresholds of the families.

The construction treats q as an odd prime power to get finite-field parents. For composite odd q that are not prime powers, the method would need a different way to supply the parent, so the stated infinite families do not immediately extend to all odd integers q.

Because the rank packing bound shows exponential growth of the required local dimension within this coupling, large-party states from this method quickly become inefficient; alternate constructions that let the qubit and q-level factors share the interference cancellation may reach smaller dimensions for the same N.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Absolutely maximally entangled (AME) states are pure multipartite states with maximally mixed reductions on every set of at most half the parties. We construct explicit families in local dimension 2q, twice an odd prime power q, using an established coupling of qubits and q-level systems. The q-level states remove interference between branches, so the qubit states need maximally mixed reductions only on average. This gives AME(9,2q) and AME(11,2q) for every odd prime power q ≥ 5, AME(13,2q) for q ≥ 17, AME(15,2q) for q ≥ 9, and AME(17,2q) for q ≥ 67. For every odd N ≥ 3, the same coupling gives AME(N,2q) under the sufficient condition q ≥ max{N,2N−2} on the odd prime power q. Within this coupling, the smallest such q must grow exponentially with N. Combined with known inputs and products, these families complete the nine-party classification: for integer d ≥ 2, an AME(9,d) state exists if and only if d ≥ 3. Choosing the branch pairing also gives AME(15,2p) states with a cyclic shift of the parties compensated by local unitaries, for every prime p ≡ 1 (mod 15).

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 0.39

“Combined with known inputs and products, these families complete the nine-party classification: for integer $d\geq2$, an AME$(9,d)$ state exists if and only if $d\geq3$.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.92 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.97 · compares with prior results 0.77 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Absolutely maximally entangled (AME) states are pure multipartite states with maximally mixed reductions on every set of at most half the parties. background 1.00 0.05 0.03 asserted 1.00
We construct explicit families in local dimension $2q$, twice an odd prime power $q$, using an established coupling of qubits and $q$-level systems. contribution 0.81 0.94 0.25 asserted 1.00
The $q$-level states remove interference between branches, so the qubit states need maximally mixed reductions only on average. method 0.49 0.53 0.05 asserted 1.00
This gives AME$(9,2q)$ and AME$(11,2q)$ for every odd prime power $q\geq5$, AME$(13,2q)$ for $q\geq17$, AME$(15,2q)$ for $q\geq9$, and AME$(17,2q)$ for $q\geq67$. result 0.97 0.92 0.37 asserted 1.00
For every odd $N\geq3$, the same coupling gives AME$(N,2q)$ under the sufficient condition $q\geq\max\{N,2^{N-2}\}$ on the odd prime power $q$. result 0.91 0.88 0.27 asserted 0.98
Within this coupling, the smallest such $q$ must grow exponentially with $N$. limitation 0.50 0.72 0.06 asserted 1.00
Combined with known inputs and products, these families complete the nine-party classification: for integer $d\geq2$, an AME$(9,d)$ state exists if and only if $d\geq3$. result 0.84 0.64 0.30 asserted 1.00
Choosing the branch pairing also gives AME$(15,2p)$ states with a cyclic shift of the parties compensated by local unitaries, for every prime $p\equiv1\pmod{15}$. result 0.84 0.88 0.06 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.98 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 6,546 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (1)
Figure 1 of the paper
Figure 1. FIG. 1. Coupling on

Figures are the authors', reproduced from the paper.

References (48)
  1. [29] K. Kitamura, A Lean proof of an AME(9,6) state (2026), ame-9-6-lean, commit 500ee827dffb, witness in lean/AME96/Data.lean on Pith
  2. [1] A. J. Scott, Multipartite entanglement, quantum-error- correcting codes, and entangling power of quantum evo- lutions, Phys. Rev. A69, 052330 (2004), arXiv:quant- ph/0310137v3 on Pith
  3. [2] W. Helwig, W. Cui, J. I. Latorre, A. Riera, and H.-K. Lo, Absolute maximal entanglement and quantum secret shar- ing, Phys. Rev. A86, 052335 (2012), arXiv:1204.2289v1 on PithPith's reviewarXiv
  4. [3] D. Goyeneche and K. Życzkowski, Genuinely multipartite entangled states and orthogonal arrays, Phys. Rev. A90, 022316 (2014), arXiv:1404.3586 on PithPith's reviewarXiv
  5. [4] W. Kłobus, A. Burchardt, A. Kołodziejski, M. Pan- dit, T. Vértesi, K. Życzkowski, and W. Laskowski,k- uniform mixed states, Phys. Rev. A100, 032112 (2019), arXiv:1906.01311v2 on PithPith's reviewarXiv
  6. [5] W. Helwig and W. Cui, Absolutely maximally en- tangled states: Existence and applications (2013), arXiv:1306.2536v1 on PithPith's reviewarXiv
  7. [6] F. Huber and M. Grassl, Quantum codes of maximal distance and highly entangled subspaces, Quantum4, 284 (2020), arXiv:1907.07733v2 on PithPith's reviewarXiv
  8. [7] Z. Raissi, C. Gogolin, A. Riera, and A. Acín, Optimal quantum error correcting codes from absolutely maximally entangled states, J. Phys. A: Math. Theor.51, 075301 (2018), arXiv:1701.03359 on PithPith's reviewarXiv
  9. [8] G. Rajchel-Mieldzioć, R. Bistroń, A. Rico, A. Lakshmi- narayan, and K. Życzkowski, Absolutely maximally entan- gled pure states of multipartite quantum systems, Rep. Prog. Phys.89, 057601 (2026), arXiv:2508.04777v3 on PithPith's reviewarXiv
  10. [9] W. Helwig, Absolutely maximally entangled qudit graph states (2013), arXiv:1306.2879v1 on PithPith's reviewarXiv
  11. [10] F. Shi, M.-S. Li, L. Chen, and X. Zhang,k-uniform quan- tum information masking, Phys. Rev. A104, 032601 (2021), arXiv:2009.12497v2, titled “k-Uniform states and quantum information masking” on PithPith's reviewarXiv
  12. [11] A. Higuchi and A. Sudbery, How entangled can two cou- ples get?, Phys. Lett. A273, 213 (2000), arXiv:quant- ph/0005013 on Pith
  13. [12] E. M. Rains, Quantum shadow enumerators, IEEE Trans. Inf. Theory45, 2361 (1999), arXiv:quant-ph/9611001v2 on PithPith's reviewarXiv
  14. [13] 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.06228v3 on PithPith's reviewarXiv
  15. [14] 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 clas- sically impossible problem, Phys. Rev. Lett.128, 080507 (2022), arXiv:2104.05122 on PithPith's reviewarXiv
  16. [15] H. Cha, Non-existence of stabilizer absolutely maximally entangled states across infinitely many configurations (2026), arXiv:2603.13442v2 on PitharXiv
  17. [16] J. Wójcik, O. Makuta, W. Bruzda, and R. Augusiak, On non-existence of absolutely maximally entangled canonical graph states in even local dimensions (2026), arXiv:2603.18193v3 on PithPith's reviewarXiv
  18. [17] E. M. Rains, Quantum weight enumerators, IEEE Trans. Inf. Theory44, 1388 (1998), arXiv:quant-ph/9612015 on PithPith's reviewarXiv
  19. [18] D. Alsina and M. Razavi, Absolutely maximally entangled states, quantum-maximum-distance-separable codes, and quantum repeaters, Phys. Rev. A103, 022402 (2021), arXiv:1907.11253 on PithPith's reviewarXiv
  20. [19] Z. Raissi, A. Teixidó, C. Gogolin, and A. Acín, Construc- tions ofk-uniform and absolutely maximally entangled states beyond maximum distance codes, Phys. Rev. Re- search2, 033411 (2020), arXiv:1910.12789v3 on PithPith's reviewarXiv
show 28 more
  1. [20] F. Shi, X. Zhang, Q. Zhao, and L. Li, Complete exis- tence classification of seven-partite absolutely maximally entangled states (2026), arXiv:2608.01011v1 on PithPith's reviewarXiv
  2. [21] Atlas contributors, Lean proof of an AME(9,10) state (Open Quantum Problem 35) (2026), facebookresearch/atlas-lean, commit 223d8bc0879b, and the Formal Conjectures copy AtlasFCSolutions/Oqp35.lean, commit15e4b3a7584e on Pith
  3. [22] S. Moalla, A. Rammal, N. Patel, R. Munos, and J. Kempe, h1: A taste of the bitter lesson in automated theorem proving (2026), arXiv:2610.35962v2 on PithPith's reviewarXiv
  4. [23] K. Kitamura, A Lean proof of AME(11,10) (2026), ame-11-10-lean, commit 6b7d009a4397, README and lean/AMEProbe.lean on Pith
  5. [24] S. Bevins and Y. Bidav, Symmetry-guided constructions of absolutely maximally entangled states in five open cases (2026), arXiv:2608.05781v2 on PithPith's reviewarXiv
  6. [25] M. Hontarenko and K. Życzkowski, Absolutely maximally entangled states of2q parties in every odd prime-power dimensionq(2026), arXiv:2609.11796v1 on PithPith's reviewarXiv
  7. [26] P. Keevash, The existence of designs II (2018), arXiv:1802.05900v1 on PithPith's reviewarXiv
  8. [27] P. Pandya, Companion code and data: coupled-branch AME states (2026), version 1.0, tagged code and data release on Pith
  9. [28] K. V. Antipin, On generatingr-uniform subspaces with the isometric mapping method, Mod. Phys. Lett. A39, 2350185 (2024), arXiv:2301.03120v1 on PithPith's reviewarXiv
  10. [30] X. Zhang, S. Pang, S.-M. Fei, and Z.-J. Zheng, Pu- rity and construction of arbitrary dimensionalk-uniform mixed states, Adv. Quantum Technol.7, 2400245 (2024), arXiv:2408.15515v1 on PithPith's reviewarXiv
  11. [31] A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inf. Theory44, 1369 (1998), arXiv:quant- ph/9608006 on Pith
  12. [32] M. Grassl, Bounds on linear codes:[15 , 6]over GF(4) (2026), codetables.de, accessed 19 October 2026 on Pith
  13. [33] M. Grassl, Bounds on linear codes:[17 , 6]over GF(4) (2026), codetables.de, accessed 19 October 2026, includes the quasicyclic[18,6,10] 4 code on Pith
  14. [34] M. Van den Nest, J. Dehaene, and B. De Moor, Graphi- cal description of the action of local Clifford transforma- tions on graph states, Phys. Rev. A69, 022316 (2004), arXiv:quant-ph/0308151 on PithPith's reviewarXiv
  15. [35] M. Hein, J. Eisert, and H. J. Briegel, Multiparty entan- glement in graph states, Phys. Rev. A69, 062311 (2004), arXiv:quant-ph/0307130 on PithPith's reviewarXiv
  16. [36] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes(North-Holland, Amsterdam, 1977) on Pith
  17. [37] R. M. Roth and G. Seroussi, On generator matrices of MDS codes, IEEE Trans. Inf. Theory31, 826 (1985) on Pith
  18. [38] A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, Nonbinary stabilizer codes over finite fields, IEEE Trans. Inf. Theory52, 4892 (2006), arXiv:quant- ph/0508070 on Pith
  19. [39] M. Grassl, A. Klappenecker, and M. Rötteler, Graphs, quadratic forms, and quantum codes, inProc. 2002 IEEE 16 Int. Symp. Inf. Theory (ISIT)(2002) p. 45, arXiv:quant- ph/0703112 on Pith
  20. [40] F. Huber and N. Wyderka, Table of AME states (2026), huberfe.github.io/ame, table version of 8 June 2026, com- mitf88c4d3 on Pith
  21. [41] M. Grassl and M. Rötteler, Quantum MDS codes over small fields, inProc. 2015 IEEE Int. Symp. Inf. Theory (ISIT)(2015) pp. 1104–1108, arXiv:1502.05267v1 on PithPith's reviewarXiv
  22. [42] M. Hontarenko and K. Życzkowski, Fractional and quan- tum Latin squares: real solutions of quantum 36 officers problem (2026), arXiv:2610.17170v1 on PithPith's reviewarXiv
  23. [43] N. J. Cerf and R. Cleve, Information-theoretic interpreta- tion of quantum error-correcting codes, Phys. Rev. A56, 1721 (1997), arXiv:quant-ph/9702031 on PithPith's reviewarXiv
  24. [44] M.Grassl, F.Huber,andA.Winter,EntropicproofsofSin- gleton bounds for quantum error-correcting codes, IEEE Trans. Inf. Theory68, 3942 (2022), arXiv:2010.07902 on PithPith's reviewarXiv
  25. [45] E. M. Rains, Nonbinary quantum codes, IEEE Trans. Inf. Theory45, 1827 (1999), arXiv:quant-ph/9703048 on PithPith's reviewarXiv
  26. [46] P. Shor and R. Laflamme, Quantum analog of the MacWilliams identities for classical coding theory, Phys. Rev. Lett.78, 1600 (1997), arXiv:quant-ph/9610040 on PithPith's reviewarXiv
  27. [47] F. Huber, C. Eltschka, J. Siewert, and O. Gühne, Bounds on absolutely maximally entangled states from shadow in- equalities, and the quantum MacWilliams identity, J. Phys. A: Math. Theor.51, 175301 (2018), arXiv:1708.06298v2 on PithPith's reviewarXiv
  28. [48] D. Gottesman,Stabilizer Codes and Quantum Error Cor- rection, Ph.D. thesis, California Institute of Technology (1997), arXiv:quant-ph/9705052v1 on PithPith's reviewarXiv

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment