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:1706.04446

nnn-fold unbiased bases: an extension of the MUB condition

Máté Farkas

Published Jun 14, 2017• 4 citations
arXivHTMLPDF

Abstract

I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases $n$-fold unbiased. They naturally appear while optimizing generic $n$-to-one quantum random access code (QRAC) strategies. While their existence in general dimensions is an open question, they nevertheless give close-to-tight upper bounds on QRAC success probabilities, and raise fundamental questions about the geometry of quantum states.

DOI
10.48550/arxiv.1706.04446

Related papers

Quantum Random Access Codes with Mutually Unbiased Bases in Three-Dimensional Hilbert Space

Qian-Kun Yao, Yuqian Zhou, Ya-Qi Dong

Quantum random access codes (QRACs) are key tools for a variety of protocols in quantum information theory. This paper gives an upper bound on the guessing success probability in the classical case of random access codes using mutually unbiased bases as measurement bases in a 3-dimensional Hilbert space and gives an encoding strategy capable of exceeding the classical bound. This encoding strategy holds for both 3-1 and 4-1 QRACs. This result is useful in areas such as random number expansion.

IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)•Dec 1, 2022•0 citations

High-dimensional multi-input quantum random access codes and mutually unbiased bases

Rui-Heng Miao, Zhao‐Di Liu, Yong-Nan Sun +3 more

Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and application of high-dimensional $(d)$ multi-input $(n)\phantom{\rule{4pt}{0ex}}{n}^{(d)}\ensuremath{\rightarrow}1$ QRACs are still lacking. Here, we present a general method to find the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. In particular, we give the analytical solution for maximum success probability of ${3}^{(d)}\ensuremath{\rightarrow}1$ QRACs when measurement bases are mutually unbiased bases (MUBs). Based on the analytical solution, we show the relationship between MUBs and ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. First, we provide a systematic method of searching for the operational inequivalence of MUBs (OI-MUBs) when the dimension $d$ is a prime power. Second, we theoretically prove that, surprisingly, the commonly used Galois MUBs are not the optimal measurement bases to obtain the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs, which indicates a breakthrough according to the traditional conjecture regarding the optimal measurement bases. Furthermore, based on high-fidelity high-dimensional quantum states of orbital angular momentum, we experimentally achieve two-input and three-input QRACs up to dimension 11. We experimentally confirm the OI-MUBs when $d=5$. Our results open alternative avenues for investigating the foundational properties of quantum mechanics and quantum network coding.

arXiv:2111.08890•Physical Review A•Oct 14, 2022•7 citations

The mutually unbiased bases revisited

Monique Combescure

The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in $\mathbb C^d, B {and} B'$ are said mutually unbiased if $\forall b\in B, b'\in B'$ the scalar product $b\cdot b'$ has modulus $d^{-1/2}$. In particular this property has been introduced in order to allow an optimization of the measurement-driven quantum evolution process of any state $ψ\in \mathbb C^d$ when measured in the mutually unbiased bases $B\_{j} {of} \mathbb C^d$. At present it is an open problem to find the maximal umber of mutually Unbiased Bases when $d$ is not a power of a prime number. \noindent In this article, we revisit the problem of finding Mutually Unbiased Bases (MUB's) in any dimension $d$. The method is very elementary, using the simple unitary matrices introduced by Schwinger in 1960, together with their diagonalizations. The Vandermonde matrix based on the $d$-th roots of unity plays a major role. This allows us to show the existence of a set of 3 MUB's in any dimension, to give conditions for existence of more than 3 MUB's for $d$ even or odd number, and to recover the known result of existence of $d+1$ MUB's for $d$ a prime number. Furthermore the construction of these MUB's is very explicit. As a by-product, we recover results about Gauss Sums, known in number theory, but which have apparently not been previously derived from MUB properties.

arXiv:quant-ph/0605090•Contemporary mathematics - American Mathematical Society•Jan 1, 2007•27 citations

ON MUTUALLY UNBIASED BASES

Thomas Durt, Berthold‐Georg Englert, Ingemar Bengtsson +1 more

Mutually unbiased bases for quantum degrees of freedom are central to all theoretical investigations and practical exploitations of complementary properties. Much is known about mutually unbiased bases, but there are also a fair number of important questions that have not been answered in full as yet. In particular, one can find maximal sets of N + 1 mutually unbiased bases in Hilbert spaces of prime-power dimension N = p M , with p prime and M a positive integer, and there is a continuum of mutually unbiased bases for a continuous degree of freedom, such as motion along a line. But not a single example of a maximal set is known if the dimension is another composite number (N = 6, 10, 12,…). In this review, we present a unified approach in which the basis states are labeled by numbers 0, 1, 2, …, N - 1 that are both elements of a Galois field and ordinary integers. This dual nature permits a compact systematic construction of maximal sets of mutually unbiased bases when they are known to exist but throws no light on the open existence problem in other cases. We show how to use the thus constructed mutually unbiased bases in quantum-informatics applications, including dense coding, teleportation, entanglement swapping, covariant cloning, and state tomography, all of which rely on an explicit set of maximally entangled states (generalizations of the familiar two–q-bit Bell states) that are related to the mutually unbiased bases. There is a link to the mathematics of finite affine planes. We also exploit the one-to-one correspondence between unbiased bases and the complex Hadamard matrices that turn the bases into each other. The ultimate hope, not yet fulfilled, is that open questions about mutually unbiased bases can be related to open questions about Hadamard matrices or affine planes, in particular the notorious existence problem for dimensions that are not a power of a prime. The Hadamard-matrix approach is instrumental in the very recent advance, surveyed here, of our understanding of the N = 6 situation. All evidence indicates that a maximal set of seven mutually unbiased bases does not exist — one can find no more than three pairwise unbiased bases — although there is currently no clear-cut demonstration of the case.

arXiv:1004.3348•International Journal of Quantum Information•Jun 1, 2010•751 citations

Measures to characterise Approximate Mutually Unbiased Bases

Ajeet Kumar, Uditanshu Sadual

Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.

quant-pharXiv:2512.12828•Dec 16, 2025•0 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
I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases nnn-fold unbiased. They naturally appear while optimizing generic nnn-to-one quantum random access code (QRAC) strategies. While their existence in general dimensions is an open question, they nevertheless give close-to-tight upper bounds on QRAC success probabilities, and raise fundamental questions about the geometry of quantum states.
Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and application of high-dimensional (d)(d)(d) multi-input $(n)\phantom{\rule{4pt}{0ex}}{n}^{(d)}\ensuremath{\rightarrow}1$ QRACs are still lacking. Here, we present a general method to find the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. In particular, we give the analytical solution for maximum success probability of ${3}^{(d)}\ensuremath{\rightarrow}1$ QRACs when measurement bases are mutually unbiased bases (MUBs). Based on the analytical solution, we show the relationship between MUBs and ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. First, we provide a systematic method of searching for the operational inequivalence of MUBs (OI-MUBs) when the dimension ddd is a prime power. Second, we theoretically prove that, surprisingly, the commonly used Galois MUBs are not the optimal measurement bases to obtain the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs, which indicates a breakthrough according to the traditional conjecture regarding the optimal measurement bases. Furthermore, based on high-fidelity high-dimensional quantum states of orbital angular momentum, we experimentally achieve two-input and three-input QRACs up to dimension 11. We experimentally confirm the OI-MUBs when d=5d=5d=5. Our results open alternative avenues for investigating the foundational properties of quantum mechanics and quantum network coding.
The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in Cd,BandB′\mathbb C^d, B {and} B'Cd,BandB′ are said mutually unbiased if ∀b∈B,b′∈B′\forall b\in B, b'\in B'∀b∈B,b′∈B′ the scalar product b⋅b′b\cdot b'b⋅b′ has modulus d−1/2d^{-1/2}d−1/2. In particular this property has been introduced in order to allow an optimization of the measurement-driven quantum evolution process of any state ψ∈Cdψ\in \mathbb C^dψ∈Cd when measured in the mutually unbiased bases B_jofCdB\_{j} {of} \mathbb C^dB_jofCd. At present it is an open problem to find the maximal umber of mutually Unbiased Bases when ddd is not a power of a prime number. \noindent In this article, we revisit the problem of finding Mutually Unbiased Bases (MUB's) in any dimension ddd. The method is very elementary, using the simple unitary matrices introduced by Schwinger in 1960, together with their diagonalizations. The Vandermonde matrix based on the ddd-th roots of unity plays a major role. This allows us to show the existence of a set of 3 MUB's in any dimension, to give conditions for existence of more than 3 MUB's for ddd even or odd number, and to recover the known result of existence of d+1d+1d+1 MUB's for ddd a prime number. Furthermore the construction of these MUB's is very explicit. As a by-product, we recover results about Gauss Sums, known in number theory, but which have apparently not been previously derived from MUB properties.
Mutually unbiased bases for quantum degrees of freedom are central to all theoretical investigations and practical exploitations of complementary properties. Much is known about mutually unbiased bases, but there are also a fair number of important questions that have not been answered in full as yet. In particular, one can find maximal sets of N + 1 mutually unbiased bases in Hilbert spaces of prime-power dimension N = p M , with p prime and M a positive integer, and there is a continuum of mutually unbiased bases for a continuous degree of freedom, such as motion along a line. But not a single example of a maximal set is known if the dimension is another composite number (N = 6, 10, 12,…). In this review, we present a unified approach in which the basis states are labeled by numbers 0, 1, 2, …, N - 1 that are both elements of a Galois field and ordinary integers. This dual nature permits a compact systematic construction of maximal sets of mutually unbiased bases when they are known to exist but throws no light on the open existence problem in other cases. We show how to use the thus constructed mutually unbiased bases in quantum-informatics applications, including dense coding, teleportation, entanglement swapping, covariant cloning, and state tomography, all of which rely on an explicit set of maximally entangled states (generalizations of the familiar two–q-bit Bell states) that are related to the mutually unbiased bases. There is a link to the mathematics of finite affine planes. We also exploit the one-to-one correspondence between unbiased bases and the complex Hadamard matrices that turn the bases into each other. The ultimate hope, not yet fulfilled, is that open questions about mutually unbiased bases can be related to open questions about Hadamard matrices or affine planes, in particular the notorious existence problem for dimensions that are not a power of a prime. The Hadamard-matrix approach is instrumental in the very recent advance, surveyed here, of our understanding of the N = 6 situation. All evidence indicates that a maximal set of seven mutually unbiased bases does not exist — one can find no more than three pairwise unbiased bases — although there is currently no clear-cut demonstration of the case.
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.
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.