Maximum number of mutually unbiased bases in composite dimensions

24

No. 1,730 in all physics · No. 93 in Quantum Information and Foundations

This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.

Non-expert version

Let $N(d)$ be the maximal number of MUBs in $C^d$, with $N(d) = d + 1$ for prime powers. Determine whether $N(d) < d + 1$ for every d that is not a prime power, and find $N(d)$ for $d = 10\text{ and }12$. Lower bounds exceed the tensor-product bound $1 + \min_i p_i^{a_i}$ in some dimensions, e.g. five MUBs in $d = 12$ (Cardenes Wuttig and Tindall, arXiv:2609.40311, 2026).

What would settle it

Proofs of upper bounds below d + 1 together with matching constructions in specific composite dimensions.

Status in the literature

Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.

A September 2026 preprint gives constructions beyond the tensor-product bound in many composite dimensions.

Subproblems (1)

How results are checked

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Value
Topic review
P. Horodecki, L. Rudnicki and K. Zyczkowski, Five open problems in quantum information theory, PRX Quantum, 2022. Link
Record
Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
Batch approval
Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
Earlier revisions
revision 1 bundle

Proof

Fingerprint
f40998596bac…
Public log
Entry 2,053, in checkpoint 2,123
In the log by
Block 969,698, 2026-10-03

This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.

History