qedbot

Open quantum problems·quantum:13

Open Quantum Problem 13: Mutually unbiased bases

conjecture formal record: mixed F3 anchored

Machine-checked by Palomar.

Fidelity F3: The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.

Source

AI activity

How grades work

No AI contribution recorded against this statement.

F3 anchored. The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/1646ca16afd6cc7a693d3bdc9f066c4d3cc01a89/FormalConjectures/OpenQuantumProblems/13.lean

declares divergences from its source reviewed by its authors only source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at 5938504e: Comparator confirmed 60 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-10-16·commit 5938504ecc63

    PALOMAR-2026-10-16-000014

Declared by the projects

1

As each project's formalization.yaml states it.

Finite quantum designs: mutually unbiased bases, SIC-POVMs, and the Welch and Gerzon boundsJD-Jones-ASES/finite-quantum-designs-lean · joined by anchor · Palomar

Read formalization.yaml

authors
JD Jones
method
agent — Claude Fable 5.1 (Anthropic), Claude Opus 5.5 (Anthropic), GPT-6 Pro (OpenAI)
review
self-assessed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
60 main results named, checked with Comparator, with an alignment table
sources
Constructions of Mutually Unbiased Bases — formalizes, authors not-contacted; A New Proof for the Existence of Mutually Unbiased Bases — formalizes, authors not-contacted; A gap for the maximum number of mutually unbiased bases — formalizes, authors not-contacted; Complex Lines with Restricted Angles — formalizes, authors not-contacted
divergences
The fourteen definitions are formal-conjectures' own, restated verbatim inside a noncomputable section as there; their CoeFun instance on StateVector is not restated since Mathlib's PiLp instance gives the same coordinates. The bound is stated for d >= 2 where Bandyopadhyay-Boykin-Roychowdhury-Vatan state it for every d; it fails at d = 0 and d = 1 in this encoding (every two bases of C^1 are unbiased), which hasMUBs_one_dim states. The tensor bound is stated for every k (including k = 0) and every m, n (including 0, where every family is vacuously unbiased); its corollary is stated over the factorization of d != 0 rather than for a single prime divisor (the single-prime form, HasMUBs d (q + 1) for every prime p dividing d, is not known to hold: for d = 6, p = 3 it would assert four mutually unbiased bases in C^6, an open question). The odd-characteristic statement is for any finite field F of odd characteristic, with Fintype.card F as the dimension; its proof uses Mathlib's primitive character (Klappenecker-Rötteler use the trace character), and quadSum_normSq holds for every nontrivial additive character; the quadratic-phase sum is proved by Weyl differencing, not by the Weil bou
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 · 2
Also known as · 2
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OpenQuantumProblems/13.lean
  • FormalConjectures/OpenQuantumProblems/13.lean

Cite this record

qed.bot, “Open Quantum Problem 13: Mutually unbiased bases”, https://qed.bot/s/quantum-13, as of 20 Nov 2026.

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