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:2202.13259 · Sampling Theory Signal Processing and Data Analysis

Dual bounds for the positive definite functions approach to mutually unbiased bases

Afonso S. Bandeira, Nikolaus Doppelbauer, Dmitriy Kunisky

Published Sep 22, 2022• 2 citations
arXivHTMLPDF
DOI
10.1007/s43670-022-00033-7

Related papers

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

An analytic function approach to weak mutually unbiased bases

T. Olupitan, C. Lei, Apostol Vourdas

arXiv:1606.08274•Annals of Physics•Apr 10, 2016•4 citations

Mutually unbiased bases and semi-definite programming

Stephen Brierley, Stefan Weigert

A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Gröbner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.

arXiv:1006.0093•Journal of Physics Conference Series•Nov 1, 2010•43 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

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

On the mathematical foundations of mutually unbiased bases

Koen Thas

arXiv:1409.3386•Quantum Information Processing•Dec 21, 2017•4 citations
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Gröbner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.
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.