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/0412066 · Journal of Algebraic Combinatorics

The limitations of nice mutually unbiased bases

Michael Aschbacher, Andrew M. Childs, Paweł Wocjan

Published Jul 10, 2006• 45 citations
arXivHTMLPDF
DOI
10.1007/s10801-006-0002-y

Related papers

Mutually unbiased bases

S. Chaturvedi

Pramana•Aug 1, 2002•34 citations

Nice error bases, mutually unbiased bases, induced representations, the Heisenberg group and finite geometries

Roger Howe

Indagationes Mathematicae•Dec 1, 2005•33 citations

Mutually Unbiased Bases

M. Kibler

Elsevier eBooks•Jan 1, 2017•0 citations

New Constructions of Approximately Mutually Unbiased Bases by Character Sums over Galois Rings

You Gao, Ming-Yue XIE, Gang Wang +1 more

Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Feb 6, 2024•0 citations

Constructions of Mutually Unbiased Bases

Andreas Klappenecker, Martin Rötteler

Lecture notes in computer science•Jan 1, 2004•288 citations

Mutually unbiased bases

TR Thijs Timmerman

Two orthogonal bases A and B of an n-dimensional Hilbert space are called Mutually Unbiased if for ai ∈ A and bj ∈ B holds: |(ai, bj)| = 1 n for each i, j ∈ {1, . . . , n}. A set B of Mutually Unbiased Bases (MUBs) is a set of bases such that each two distinct bases Bi, Bj ∈ B are mutually unbiased. The bounds on the number of MUBs, dependent on the dimension n, will be derived. Also a construction for MUBs in Cp, with p prime, will be showed. Finally, some open problems will be discussed.

•Jan 1, 2009•0 citations
Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].
Two orthogonal bases A and B of an n-dimensional Hilbert space are called Mutually Unbiased if for ai ∈ A and bj ∈ B holds: |(ai, bj)| = 1 n for each i, j ∈ {1, . . . , n}. A set B of Mutually Unbiased Bases (MUBs) is a set of bases such that each two distinct bases Bi, Bj ∈ B are mutually unbiased. The bounds on the number of MUBs, dependent on the dimension n, will be derived. Also a construction for MUBs in Cp, with p prime, will be showed. Finally, some open problems will be discussed.