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 Maximum Number of Mutually Unbiased Bases in Dimension 12 is Exactly Four

Pompetzki, Christopher

Published Dec 13, 2025• 0 citations
Publisher

Abstract

AbstractWe prove that the maximum number of mutually unbiased bases (MUBs) in C12 is exactlyfour: M(12) = 4. The proof proceeds by constructing four product MUBs using the tensorstructure C12 = C4 ⊗ C3, then showing via a finite exhaustive search over 12th roots of unitythat no vector exists unbiased to all four. The key insight is that the column orthogonalityconstraint from the qutrit marginal condition reduces the search space to exactly 96 candidatematrices, none of which satisfy the transform unimodularity requirements."Towards thee I roll, thou all-destroying but unconquering whale; to the last I grapple with thee; from hell’s heart I stab at thee; for hate’s sake I spit my last breath at thee. Sink all coffins and all hearses to one common pool! and since neither can be mine, let me then tow to pieces, while still chasing thee, though tied to thee, thou damned whale!"- Captain Ahab

DOI
10.5281/zenodo.17949275

Related papers

The Maximum Number of Mutually Unbiased Bases in Dimension 14 is Exactly Three

Pompetzki, Christopher

AbstractWe prove that the maximum number of mutually unbiased bases (MUBs) in C14 is exactlythree: M(14) = 3. The proof proceeds by constructing three product MUBs using the tensorstructure C14 = C2 ⊗ C7, then showing via finite coupling enumeration in the μ7 phase modelthat every triply-unbiased state is separable. This extends the tensor saturation paradigm fromdimensions 6, 10, and 12 to the case d = 2p with p = 7.

•Dec 16, 2025•0 citations

The Maximum Number of Mutually Unbiased Bases in Dimension Ten is Three - PDF

Pompetzki, Christopher

AbstractWe prove that M(10) = 3, where M(d) denotes the maximum number of mutually unbiased bases in Cd. The proof uses the tensor product structure C10 ∼= C2 ⊗ C5 and a rigidity analysis for vectors in C5 that are flat in multiple bases. We show that any vector unbiased to three canonical product MUBs must be a product vector, yielding acontradiction with the product saturation bound.

•Dec 16, 2025•0 citations

Tensor Saturation and the Nonexistence of a Fourth Mutually Unbiased Basis in Dimension Six

Pompetzki, Christopher, Shrek, Ogre

AbstractWe prove that the maximum number of mutually unbiased bases in C6 is exactly three:M(6) = 3. The proof exploits the tensor product structure C6 ∼= C2 ⊗ C3 and proceedsby showing that any vector unbiased to three canonical product bases must itself be aproduct vector. The key technical ingredient is a rigidity theorem: vectors in C3 that aresimultaneously flat in two specific bases form a finite six-element orbit. Combined withcoupling constraints from the tensor structure, this forces separability, contradicting therequirement that a fourth basis contain no product vectors. The argument is elementary,using only linear algebra and explicit polynomial system analysis.The author blasts Hungarian music from the 17th centurywhile memeing on visions of heretics in Japan btw.

•Dec 16, 2025•0 citations

The Maximum Number of Mutually Unbiased Bases in Dimension Ten is Three

Pompetzki, Christopher

AbstractWe prove that M(10) = 3, where M(d) denotes the maximum number of mutually unbiased bases in Cd. The proof uses the tensor product structure C10 ∼=C2 ⊗ C5 and a rigidity analysis for vectors in C5 that are flat in multiple bases. We show that any vector unbiased to three canonical product MUBs must be a product vector, yielding a contradiction with the product saturation bound.The author continues to blast Hungarian music from the 16th-17th century btw.https://x.com/mathCObot/status/1791341944125489463?s=20The author continues to meme on heretics in Japan btw. Visions of The Dreamworks Intergalactic Empire btw.Visions of Swamps btw. Shrek is love btw.Shrek is life btw.

•Dec 16, 2025•0 citations

Mutually Unbiased Bases in Dimension Twelve: Tensor Saturation, Strong Unextendibility, and the Flat-Sum Trichotomy

Han-Jun Lim

Abstract Setting. The maximal number N(12) of mutually unbiased bases (MUBs) of C12 is unknown; no composite non-prime-power dimension has a known exact value. The quantum MacNeish (tensor) bound gives N(12) ≥ min{N(3),N(4)} = 4, and within Array Cosmology (AC) the integer 4 = k is the ququart rank of the rendering algebra R12 = M3(C)⊗ M4(C). This paper maps the d = 12 MUB landscape and states the tensor saturation conjecture N(12) = 4. Canonical sector. (i) Strong unextendibility [A]: no vector of C12 is unbiased to all four bases of the canonical product quadruple; the proof closes through an entanglement-forcing theorem, a flatness–circle-structure reduction, a monomial-rigidity step, and an atomic lemma whose ninebranches collapse to f = U+UV+V withexactminimum5/4 = (k+1)/k > 1. (ii)Localrigidity[A]: the canonical quadruple is rigid modulo its 191-dimensional gauge orbit; the Jacobian has exact rank 385 and exact nullity 191, certified by an explicit integer basis of the kernel verified in exact arithmetic, by modular arithmetic at p = 1000033, and by an independent gauge-dimension proof

•Jun 13, 2026•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
AbstractWe prove that the maximum number of mutually unbiased bases (MUBs) in C12 is exactlyfour: M(12) = 4. The proof proceeds by constructing four product MUBs using the tensorstructure C12 = C4 ⊗ C3, then showing via a finite exhaustive search over 12th roots of unitythat no vector exists unbiased to all four. The key insight is that the column orthogonalityconstraint from the qutrit marginal condition reduces the search space to exactly 96 candidatematrices, none of which satisfy the transform unimodularity requirements."Towards thee I roll, thou all-destroying but unconquering whale; to the last I grapple with thee; from hell’s heart I stab at thee; for hate’s sake I spit my last breath at thee. Sink all coffins and all hearses to one common pool! and since neither can be mine, let me then tow to pieces, while still chasing thee, though tied to thee, thou damned whale!"- Captain Ahab
AbstractWe prove that the maximum number of mutually unbiased bases in C6 is exactly three:M(6) = 3. The proof exploits the tensor product structure C6 ∼= C2 ⊗ C3 and proceedsby showing that any vector unbiased to three canonical product bases must itself be aproduct vector. The key technical ingredient is a rigidity theorem: vectors in C3 that aresimultaneously flat in two specific bases form a finite six-element orbit. Combined withcoupling constraints from the tensor structure, this forces separability, contradicting therequirement that a fourth basis contain no product vectors. The argument is elementary,using only linear algebra and explicit polynomial system analysis.The author blasts Hungarian music from the 17th centurywhile memeing on visions of heretics in Japan btw.
AbstractWe prove that M(10) = 3, where M(d) denotes the maximum number of mutually unbiased bases in Cd. The proof uses the tensor product structure C10 ∼=C2 ⊗ C5 and a rigidity analysis for vectors in C5 that are flat in multiple bases. We show that any vector unbiased to three canonical product MUBs must be a product vector, yielding a contradiction with the product saturation bound.The author continues to blast Hungarian music from the 16th-17th century btw.https://x.com/mathCObot/status/1791341944125489463?s=20The author continues to meme on heretics in Japan btw. Visions of The Dreamworks Intergalactic Empire btw.Visions of Swamps btw. Shrek is love btw.Shrek is life btw.
Abstract Setting. The maximal number N(12) of mutually unbiased bases (MUBs) of C12 is unknown; no composite non-prime-power dimension has a known exact value. The quantum MacNeish (tensor) bound gives N(12) ≥ min{N(3),N(4)} = 4, and within Array Cosmology (AC) the integer 4 = k is the ququart rank of the rendering algebra R12 = M3(C)⊗ M4(C). This paper maps the d = 12 MUB landscape and states the tensor saturation conjecture N(12) = 4. Canonical sector. (i) Strong unextendibility [A]: no vector of C12 is unbiased to all four bases of the canonical product quadruple; the proof closes through an entanglement-forcing theorem, a flatness–circle-structure reduction, a monomial-rigidity step, and an atomic lemma whose ninebranches collapse to f = U+UV+V withexactminimum5/4 = (k+1)/k > 1. (ii)Localrigidity[A]: the canonical quadruple is rigid modulo its 191-dimensional gauge orbit; the Jacobian has exact rank 385 and exact nullity 191, certified by an explicit integer basis of the kernel verified in exact arithmetic, by modular arithmetic at p = 1000033, and by an independent gauge-dimension proof
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.