We describe sets of mutually unbiased bases (MUBs) for quantum states defined over the p-adic numbers Q_p, i.e. the states that can be described as elements of the (rigged) Hilbert space L2(Q_p). We find that for every prime p>2 there are at least p+1 MUBs, which is in contrast with the situation for quantum states defined over the real line R for which only 3 MUBs are known. We comment on the possible reason for the difference regarding MUBs between these two infinite dimensional Hilbert spaces.
We describe sets of mutually unbiased bases (MUBs) for quantum states defined over the p-adic numbers Q_p, i.e. the states that can be described as elements of the (rigged) Hilbert space L2(Q_p). We find that for every prime p>2 there are at least p+1 MUBs, which is in contrast with the situation for quantum states defined over the real line R for which only 3 MUBs are known. We comment on the possible reason for the difference regarding MUBs between these two infinite dimensional Hilbert spaces.
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.
A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis and an arbitrary element of the other basis coincide. In case the dimension, d, of the considered Hilbert space is a power of a prime number, complete sets of d+1 mutually unbiased bases (MUBs) exist. Here we present a method based on the graph-state formalism to construct such sets of MUBs. We show that for np-level systems, with p being prime, one particular graph suffices to easily construct a set of pn+1 MUBs. In fact, we show that a single n-dimensional vector, which is associated with this graph, can be used to generate a complete set of MUBs and demonstrate that this vector can be easily determined. Finally, we discuss some advantages of our formalism regarding the analysis of entanglement structures in MUBs, as well as experimental realizations.
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.
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 (MUBs), which are such that the inner product between two vectors in different orthogonal bases is a constant equal to 1/sqrt{d), with d the dimension of the finite Hilbert space, are becoming more and more studied for applications such as quantum tomography and cryptography, and in relation to entangled states and to the Heisenberg-Weil group of quantum optics. Complete sets of MUBs of cardinality d+1 have been derived for prime power dimensions d=p^m using the tools of abstract algebra. Presumably, for non prime dimensions the cardinality is much less. Here we reinterpret MUBs as quantum phase states, i.e. as eigenvectors of Hermitean phase operators generalizing those introduced by Pegg & Barnett in 1989. We relate MUB states to additive characters of Galois fields (in odd characteristic p) and to Galois rings (in characteristic 2). Quantum Fourier transforms of the components in vectors of the bases define a more general class of MUBs with multiplicative characters and additive ones altogether. We investigate the complementary properties of the above phase operator with respect to the number operator. We also study the phase probability distribution and variance for general pure quantum electromagnetic states and find them to be related to the Gauss sums, which are sums over all elements of the field (or of the ring) of the product of multiplicative and additive characters. Finally, we relate the concepts of mutual unbiasedness and maximal entanglement. This allows to use well studied algebraic concepts as efficient tools in the study of entanglement and its information aspects
Mutually unbiased bases is an important topic in the recent quantum system \nresearches. Although there is much work in this area, many problems \nrelated to mutually unbiased bases are still open. For example, constructing \na complete set of mutually unbiased bases in the Hilbert spaces with composite \ndimensions has not been achieved yet. This thesis defines a weaker \nconcept than mutually unbiased bases in the Hilbert spaces with composite \ndimensions. We call this concept, weak mutually unbiased bases. There is \na duality between such bases and the geometry of the phase space Zd × Zd, \nwhere d is the phase space dimension. To show this duality we study the \nproperties of lines through the origin in Zd × Zd, then we explain the correspondence \nbetween the properties of these lines and the properties of the \nweak mutually unbiased bases. We give an explicit construction of a complete \nset of weak mutually unbiased bases in the Hilbert space Hd, where \nd is odd and d = p1p2; p1, p2 are prime numbers. We apply the concept of \nweak mutually unbiased bases in the context of quantum tomography and \nquantum cryptography.