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

Entropy

Equiangular Vectors Approach to Mutually Unbiased Bases

M. Kibler

Published May 8, 2013• 4 citations
Publisher

Abstract

Two orthonormal bases in the d-dimensional Hilbert space are said to be unbiased if the square modulus of the inner product of any vector of one basis with any vector of the other equals 1 d. The presence of a modulus in the problem of finding a set of mutually unbiased bases constitutes a source of complications from the numerical point of view. Therefore, we may ask the question: Is it possible to get rid of the modulus? After a short review of various constructions of mutually unbiased bases in Cd, we show how to transform the problem of finding d + 1 mutually unbiased bases in the d-dimensional space Cd (with a modulus for the inner product) into the one of finding d(d+1) vectors in the d2-dimensional space Cd2 (without a modulus for the inner product). The transformation from Cd to Cd2 corresponds to the passage from equiangular lines to equiangular vectors. The transformation formulas are discussed in the case where d is a prime number.

DOI
10.3390/e15051726

Related papers

On mutually unbiased bases

Rahim Taghikhani

Two orthonormal bases in the complex space of dimension d, are said to be mutually unbiased if the square of the magnitude of the inner product of any vector from one basis with any vector in other basis is equal to the reciprocal of the dimension d. Mutually unbiased bases are used for optimal state determination of mixed quantum states. It is known that in any dimension d, the number of mutually unbiased bases is at most d+1. Ivanovic found a complete set of mutually unbiased bases for prime dimensions. His construction was generalized by Wootters and Fields for prime power dimensions. There is a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. Based on this connection, there exits a constructive proof of the existence of a complete set of mutually unbiased bases for prime power dimensions. This thesis is an exploration on construction of mutually unbiased bases.

•Aug 26, 2013•1 citation

Constructions of Mutually Unbiased Bases

Andreas Klappenecker, Martin Roetteler

Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if ||^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of C^d cannot exceed d+1. If d is a power of a prime, then extremal sets containing d+1 mutually unbiased bases are known to exist. We give a simplified proof of this fact based on the estimation of exponential sums. We discuss conjectures and open problems concerning the maximal number of mutually unbiased bases for arbitrary dimensions.

arXiv:quant-ph/0309120•Sep 15, 2003•120 citations

On mutually unbiased bases: Passing from d to d**2

M. Kibler

We show how to transform the problem of finding d+1 mutually unbiased bases in the d-dimensional Hilbert space into the one of finding d(d+1) vectors in the N-dimensional Hilbert space with N=d**2. The transformation formulas admit a solution when d is a prime number.

arXiv:1210.8173•Oct 30, 2012•1 citation

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

There is no generalization of known formulas for mutually unbiased bases

Claude Archer

In a quantum system having a finite number N of orthogonal states, two orthonormal bases {ai} and {bj} are called mutually unbiased if all inner products ⟨ai∣bj⟩ have the same modulus 1∕N. This concept appears in several quantum information problems. The number of pairwise mutually unbiased bases is at most N+1 and various constructions of such N+1 bases have been found when N is a power of a prime number. We study families of formulas that generalize these constructions to arbitrary dimensions using finite rings. We then prove that there exists a set of N+1 mutually unbiased bases described by such formulas, if and only if N is a power of a prime number.

arXiv:quant-ph/0312204•Journal of Mathematical Physics•Feb 1, 2005•94 citations

Regular structures of lines in complex spaces

Mahdad Khatirinejad Fard

We study the properties of regular structures of lines, such as equiangular sets of lines and mutually unbiased bases (MUBs) in a general setting that includes real, complex and quaternionic spaces. We formulate a common generalization of several results in real and complex spaces that also hold in the quaternionic space. A set of lines is called equiangular if the angle between each pair is the same. A set of MUBs is a collection of orthonormal bases such that the angle between vectors from different bases is constant. Regular structures of lines have been studied in several fields such as digital communication, quantum computing, discrete mathematics and analysis. Our new concept of a multipartite equiangular set of lines is a common generalization of equiangular lines and MUBs. We prove a bound on the size of such set of lines, which generalizes the well-known absolute upper bounds. The existence of d + 1 MUBs in Cd is only known for prime power dimensions. We study sets of d + 1 MUBs that are the union of a standard basis and an orbit of the Weyl-Heisenberg group. As an example, we construct such MUBs in prime power dimensions. We also show connections between spherical 2-designs and other structures of lines. Fiducial vectors have been widely used to construct large sets of equiangular lines. A complex vector is fiducial if its orbit under a Weyl-Heisenberg group is an equiangular set of d2 lines. We give a new characterization of fiducial vectors, one that simplifies and significantly reduces the number of equations that must be solved to find a fiducial vector. We consider some possible classes of fiducial vectors and prove several nonexistence results. For example, using our new characterization we prove that the construction of fiducial vectors in small prime dimensions by Appleby (2005) essentially does not generalize. Finally, we give some methods for constructing equiangular sets of lines in complex and quaternionic spaces. We also find numerical fiducial vectors with high precision in Cd , d ≤ 21.

•Jan 1, 2008•9 citations
Two orthonormal bases in the d-dimensional Hilbert space are said to be unbiased if the square modulus of the inner product of any vector of one basis with any vector of the other equals 1 d. The presence of a modulus in the problem of finding a set of mutually unbiased bases constitutes a source of complications from the numerical point of view. Therefore, we may ask the question: Is it possible to get rid of the modulus? After a short review of various constructions of mutually unbiased bases in Cd, we show how to transform the problem of finding d + 1 mutually unbiased bases in the d-dimensional space Cd (with a modulus for the inner product) into the one of finding d(d+1) vectors in the d2-dimensional space Cd2 (without a modulus for the inner product). The transformation from Cd to Cd2 corresponds to the passage from equiangular lines to equiangular vectors. The transformation formulas are discussed in the case where d is a prime number.
Two orthonormal bases in the complex space of dimension d, are said to be mutually unbiased if the square of the magnitude of the inner product of any vector from one basis with any vector in other basis is equal to the reciprocal of the dimension d. Mutually unbiased bases are used for optimal state determination of mixed quantum states. It is known that in any dimension d, the number of mutually unbiased bases is at most d+1. Ivanovic found a complete set of mutually unbiased bases for prime dimensions. His construction was generalized by Wootters and Fields for prime power dimensions. There is a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. Based on this connection, there exits a constructive proof of the existence of a complete set of mutually unbiased bases for prime power dimensions. This thesis is an exploration on construction of mutually unbiased bases.
Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if ||^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of C^d cannot exceed d+1. If d is a power of a prime, then extremal sets containing d+1 mutually unbiased bases are known to exist. We give a simplified proof of this fact based on the estimation of exponential sums. We discuss conjectures and open problems concerning the maximal number of mutually unbiased bases for arbitrary dimensions.
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.
In a quantum system having a finite number N of orthogonal states, two orthonormal bases {ai} and {bj} are called mutually unbiased if all inner products ⟨ai∣bj⟩ have the same modulus 1∕N. This concept appears in several quantum information problems. The number of pairwise mutually unbiased bases is at most N+1 and various constructions of such N+1 bases have been found when N is a power of a prime number. We study families of formulas that generalize these constructions to arbitrary dimensions using finite rings. We then prove that there exists a set of N+1 mutually unbiased bases described by such formulas, if and only if N is a power of a prime number.
We study the properties of regular structures of lines, such as equiangular sets of lines and mutually unbiased bases (MUBs) in a general setting that includes real, complex and quaternionic spaces. We formulate a common generalization of several results in real and complex spaces that also hold in the quaternionic space. A set of lines is called equiangular if the angle between each pair is the same. A set of MUBs is a collection of orthonormal bases such that the angle between vectors from different bases is constant. Regular structures of lines have been studied in several fields such as digital communication, quantum computing, discrete mathematics and analysis. Our new concept of a multipartite equiangular set of lines is a common generalization of equiangular lines and MUBs. We prove a bound on the size of such set of lines, which generalizes the well-known absolute upper bounds. The existence of d + 1 MUBs in Cd is only known for prime power dimensions. We study sets of d + 1 MUBs that are the union of a standard basis and an orbit of the Weyl-Heisenberg group. As an example, we construct such MUBs in prime power dimensions. We also show connections between spherical 2-designs and other structures of lines. Fiducial vectors have been widely used to construct large sets of equiangular lines. A complex vector is fiducial if its orbit under a Weyl-Heisenberg group is an equiangular set of d2 lines. We give a new characterization of fiducial vectors, one that simplifies and significantly reduces the number of equations that must be solved to find a fiducial vector. We consider some possible classes of fiducial vectors and prove several nonexistence results. For example, using our new characterization we prove that the construction of fiducial vectors in small prime dimensions by Appleby (2005) essentially does not generalize. Finally, we give some methods for constructing equiangular sets of lines in complex and quaternionic spaces. We also find numerical fiducial vectors with high precision in Cd , d ≤ 21.