OpenFrontiers
← Back to the index

Zauner's conjecture: do SIC-POVMs exist in every dimension?

Numerically found in every dimension tried, exactly constructed in many, and proved in none in general.

Problem statement

A symmetric informationally complete positive operator-valued measure in dimension dd is a set of d2d^2 unit vectors {∣ψj⟩}\{|\psi_j\rangle\} in Cd\mathbb{C}^d with

∣⟨ψj∣ψk⟩∣2=1d+1for all j≠k.|\langle \psi_j | \psi_k \rangle|^2 = \frac{1}{d+1} \quad \text{for all } j \ne k.

Conjecture: such a set exists for every d≥2d \ge 2, and can be taken as an orbit of the Weyl–Heisenberg group.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Posed by Gerhard Zauner in his 1999 thesis and independently rediscovered by Renes, Blume-Kohout, Scott and Caves. The problem has an unexpected connection to Hilbert's twelfth problem: the exact solutions generate abelian extensions of real quadratic fields, and work by Appleby, Flammia, Kopp and others has turned SIC construction into a question in algebraic number theory.

Why it matters

SIC-POVMs are optimal measurements for quantum state tomography and minimal informationally complete measurements. Beyond quantum information, the number-theoretic reformulation makes this a rare problem where a physics question feeds directly into class field theory.

Known partial results

  • Exact solutions are known in dimensions 22–2828 and a scattered collection of larger dimensions, some found with high-precision numerics and then recognised algebraically.
  • Numerical solutions have been found in every dimension attempted, into the hundreds.
  • Kopp and collaborators have given conjectural exact constructions from Stark units, verified in many cases.
  • No proof exists for infinitely many dimensions.
References
  1. [1]Randomstrasse101 — Open Problems of 2025 — Mutually Unbiased Bases, ETFs, and Zauner’s Conjecture — Problem 24 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.