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.
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.
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.
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.
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.
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′ are said mutually unbiased if ∀b∈B,b′∈B′ the scalar product b⋅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 ψ∈Cd when measured in the mutually unbiased bases B_jofCd. 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.
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions d that are powers of prime numbers, there exists a set of up to d+1 bases that form an MUB set. However, the maximum number of MUBs in dimensions that are not powers of prime numbers is not known. To address this issue, we introduce three algorithms based on First-Order Logic that can determine the maximum number of bases in an MUB set without numerical approximation. Our algorithms can prove this result in finite time, although the required time is impractical. Additionally, we present a heuristic approach to solve the semi-decision problem of determining if there are k MUBs in a given dimension d. As a byproduct of our research, we demonstrate that the maximum number of MUBs in any dimension can be achieved with definable complex parameters, computable complex parameters, and other similar fields.
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.