Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Dimension–Six MUB Obstruction A Complete, Closed Proof that M(6) = 3 (Elaboration V-3)

Pompetzki, Christopher

Published Dec 13, 2025• 0 citations
Publisher

Abstract

We prove that there exist at most three mutually unbiased bases in dimension six. The proofforms a single obstruction chain: a structural lemma for 6 × 6 complex Hadamard matrices, arecognition theorem reducing to two explicit families, and family-specific contradictions writtenin invariant, transportable form.
DOI
10.5281/zenodo.17924400

Related papers

M6_Complete_Proof_Final V-2 AKA The End AKA The Dimension–Six MUB Obstruction AKA A Complete, Closed Proof that M(6) = 3

Pompetzki, Christopher

The end from here to eternity. We present a single, linear obstruction chain for MUBs in dimension six: a structural lemma(Bridge Lemma) for 6 × 6 complex Hadamard matrices arising as MUB transition matrices,a recognition theorem reducing to two explicit families, and family-specific obstructions. Weinclude explicit invariance and transport lemmas to prevent “hidden equivalence” gaps. TheHaagerup family obstruction is completed by exhibiting an explicit non-scalar unitary commutant.

•Dec 14, 2025•0 citations

The Dimension–Six MUB Obstruction A Complete, Closed Proof that M(6) = 3 (Elaboration)

Pompetzki, Christopher

We prove that there exist at most three mutually unbiased bases in dimension six. Theproof proceeds by establishing a structural constraint (the Bridge Lemma) on 6 × 6 complexHadamard matrices, applying a recognition theorem that forces all admissible cases into twoexplicit families, and then proving that neither family can occur as a transition matrix in aMUB–4 configuration. Each implication appears explicitly in a single linear chain.

•Dec 13, 2025•0 citations

The Maximum Number of Mutually Unbiased Bases in Dimension Six - Pompetzki, Chris

Pompetzki, Christopher

We prove that the maximum number of mutually unbiased bases in complex dimension sixis three. The proof is structural and does not rely on exhaustive classification, numerical search,or probabilistic arguments. The key ingredients are: (1) a Laurent–polynomial obstructionblocking the Haagerup family of complex Hadamard matrices, (2) an analogous obstructionblocking the 2-circulant family, and (3) a structural Bridge Lemma showing that any complexHadamard matrix arising as a transition matrix in a MUB triplet must exhibit an opposite-pairphenomenon in its row-ratio multisets. Combined with the recognition theorem of Matszangoszand Sz¨oll˝osi, this forces all MUB-triplet transition matrices in dimension six into families alreadyobstructed, yielding a contradiction to the existence of a fourth mutually unbiased basis.

•Dec 13, 2025•0 citations

M(6) = 3: An Unconditional Proof

Pompetzki, Christopher

This paper presents an unconditional proof that the maximum number of mutually unbiased bases in dimension six satisfies M(6) = 3. The argument avoids classification assumptions and proceeds via explicit structural obstructions.

•Dec 12, 2025•0 citations

Mutually unbiased bases and Hadamard matrices of order six

Ingemar Bengtsson, Wojciech Bruzda, Åsa Ericsson +3 more

We report on a search for mutually unbiased bases (MUBs) in six dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set of all complex Hadamard matrices of the given order, and we introduce a natural notion of distance between bases in Hilbert space. This allows us to draw a detailed map of where in the landscape the MUB triplets are situated. We use available tools, such as the theory of the discrete Fourier transform, to organize our results. Finally, we present some evidence for the conjecture that there exists a four dimensional family of complex Hadamard matrices of order 6. If this conjecture is true the landscape in which one may search for MUBs is much larger than previously thought.

arXiv:quant-ph/0610161•Journal of Mathematical Physics•May 1, 2007•130 citations

All Mutually Unbiased Bases in Dimensions Two to Five

STEPHEN D. BRIERLEY, Stefan Weigert, Ingemar Bengtsson

All complex Hadamard matrices in dimensions two to five are known. We use this fact to derive all inequivalent sets of mutually unbiased (MU) bases in low dimensions. We find a three-parameter family of triples of MU bases in dimension four and two inequivalent classes of MU triples in dimension five. We confirm that the complete sets of (d+1) MU bases are unique (up to equivalence) in dimensions below six, using only elementary arguments for d less than five.

arXiv:0907.4097•Jul 23, 2009•4 citations
We prove that the maximum number of mutually unbiased bases in complex dimension sixis three. The proof is structural and does not rely on exhaustive classification, numerical search,or probabilistic arguments. The key ingredients are: (1) a Laurent–polynomial obstructionblocking the Haagerup family of complex Hadamard matrices, (2) an analogous obstructionblocking the 2-circulant family, and (3) a structural Bridge Lemma showing that any complexHadamard matrix arising as a transition matrix in a MUB triplet must exhibit an opposite-pairphenomenon in its row-ratio multisets. Combined with the recognition theorem of Matszangoszand Sz¨oll˝osi, this forces all MUB-triplet transition matrices in dimension six into families alreadyobstructed, yielding a contradiction to the existence of a fourth mutually unbiased basis.
We report on a search for mutually unbiased bases (MUBs) in six dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set of all complex Hadamard matrices of the given order, and we introduce a natural notion of distance between bases in Hilbert space. This allows us to draw a detailed map of where in the landscape the MUB triplets are situated. We use available tools, such as the theory of the discrete Fourier transform, to organize our results. Finally, we present some evidence for the conjecture that there exists a four dimensional family of complex Hadamard matrices of order 6. If this conjecture is true the landscape in which one may search for MUBs is much larger than previously thought.