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

arXiv:quant-ph/0103162 · Algorithmica

A New Proof for the Existence of Mutually Unbiased Bases

Not Available Not Available, Not Available Not Available

Published Nov 6, 2002• 576 citations
arXivHTMLPDF
DOI
10.1007/s00453-002-0980-7

Related papers

A gap for the maximum number of mutually unbiased bases

Mihály Weiner

A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of

arXiv:0902.0635•Proceedings of the American Mathematical Society•Jan 23, 2013•40 citations

On the mathematical foundations of mutually unbiased bases

Koen Thas

arXiv:1409.3386•Quantum Information Processing•Dec 21, 2017•4 citations

A fourier analytic approach to the problem of mutually unbiased bases

Máté Matolcsi

We give a new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique borrowed from additive combinatorics. The method provides a short and elegant generalization of the fact that there are at mostd+ 1 MUBs in ℂd. It may also yield a proof that no complete system of MUBs exists in some composite dimensions — a long standing open problem.

arXiv:1009.2407•Studia Scientiarum Mathematicarum Hungarica•Nov 17, 2012•11 citations

The problem of mutually unbiased bases in dimension 6

Philippe Jaming, Máté Matolcsi, Péter Móra

arXiv:1201.0640•Cryptography and Communications•Apr 12, 2010•20 citations

An application of positive definite functions to the problem of MUBs

Mihail N. Kolountzakis, Máté Matolcsi, Mihály Weiner

We present a new approach to the problem of mutually unbiased bases (MUBs), based on positive definite functions on the unitary group. The method provides a new proof of the fact that there are at most d + 1 d+1 MUBs in C d \mathbb {C}^d , and it may also lead to a proof of non-existence of complete systems of MUBs in dimension 6 via a conjectured algebraic identity.

arXiv:1612.09000•Proceedings of the American Mathematical Society•Jun 5, 2017•9 citations

On approximate real mutually unbiased bases in square dimension

Ajeet Kumar, Subhamoy Maitra, Chandra Sekhar Mukherjee

Cryptography and Communications•Jan 11, 2021•7 citations
A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of