Next Article in Journal
Bayesian and Quasi-Bayesian Estimators for Mutual Information from Discrete Data
Next Article in Special Issue
Quantum Entanglement Concentration Based on Nonlinear Optics for Quantum Communications
Previous Article in Journal
Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations
Previous Article in Special Issue
All-Optically Controlled Quantum Memory for Light with a Cavity-Optomechanical System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Equiangular Vectors Approach to Mutually Unbiased Bases

by
Maurice R. Kibler
1,2,3
1
Faculté des Sciences et Technologies, Université de Lyon, 37 rue du repos, 69361 Lyon, France
2
Département de Physique, Université Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, 69622 Villeurbanne, France
3
Groupe Théorie, Institut de Physique Nucléaire, CNRS/IN2P3, 4 rue Enrico Fermi, 69622 Villeurbanne, France
Entropy 2013, 15(5), 1726-1737; https://doi.org/10.3390/e15051726
Submission received: 26 April 2013 / Accepted: 6 May 2013 / Published: 8 May 2013
(This article belongs to the Special Issue Quantum Information 2012)

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 C d , we show how to transform the problem of finding d + 1 mutually unbiased bases in the d-dimensional space C d (with a modulus for the inner product) into the one of finding d(d + 1) vectors in the d2-dimensional space C d 2 (without a modulus for the inner product). The transformation from C d to C d 2 corresponds to the passage from equiangular lines to equiangular vectors. The transformation formulas are discussed in the case where d is a prime number.

1. Introduction

We start by revisiting a definition. Two distinct orthonormal bases of the C d Hilbert space, say,
B a = { | a α : α = 0 , 1 , , d 1 }
and
B b = { | b β : β = 0 , 1 , , d 1 }
(with ab and d ≥ 2) are said to be unbiased if the modulus of the a α | b β inner product is independent of α and β. In other words
a α | a β = b α | b β = δ α , β
and
| a α | b β | = 1 d
for α , β Z / d Z . (An exhaustive, although incomplete, set of references concerning unbiased bases is given in what follows. References therein should be consulted too.)
The concept of unbiased bases and, more generally, of a set of mutually unbiased bases (MUBs) takes its origin in the work by Schwinger [1] on unitary operator bases (see also [2,3,4]). It is of paramount importance in quantum mechanics. It makes it possible to transcribe the Bohr complementary principle to finite quantum mechanics so that the idea of complementarity can be applied also to finite quantum systems [5,6]. Furthermore, MUBs turn out to be useful for discrete Wigner functions [3,7,8], the solution of the mean King problem [9], and the understanding of the Feynman path integral formalism in terms of temporally proximal bases [10]. Many of the applications of MUBs concern classical information (coding theory [11]) and quantum information (quantum cryptography [12] and quantum state tomography [13]). They are also useful in quantum computing, a field where intrication of qupits [14] plays a crucial role.
Three important results on MUBs are known. First, the maximum number N of MUBs in a d-dimensional Hilbert space is N = d + 1 [2,4]. Thus, the number of MUBs in C d cannot exceed d + 1. (A set containing d + 1 MUBs is called a complete set.) Second, this maximum number, i.e., N = d + 1, is reached when d is a prime number (noted p) or any power of a prime number (noted p n with n ≥ 2) [2,4]. Indeed, it is possible to construct several complete sets of MUBs when d is prime or prime power. Third, when d is a composite number ( d = p 1 e 1 p 2 e 2 p r e r with p 1 , p 2 , , p r prime integers and e 1 , e 2 , , e r strictly positive integers), we have (see for instance [15])
min i = 1 r p i e i + 1 N d + 1
but the value of N is unknown. More precisely, it is not known if it is possible to construct a complete set of MUBs in C d in the case where d is not a prime or the power of a prime. Equation (5) reflects the fact that it is always possible to construct three MUBs when d is a composite number. For example in the d = 2 × 3 = 6 case, several sets of three MUBs are known but no set with more than three MUBs were found in spite of an enormous number of numerical studies [16,17,18,19,20,21]; in the present days, there is a consensus according to which no complete set (with seven MUBs) exists for d = 6 and it is widely believed that only sets with three MUBs exist in this case (cf. the Zauner conjecture [22]).
From a mathematical point of view, it is remarkable that MUBs may be connected to many disciplinary fields. A non-exhaustive list is: theory of finite fields, group theory, Lie and Clifford algebras, finite geometries, combinatorics and graph theory, frames and 2-designs, and Hopf fibrations. This can be illustrated by some of the numerous ways of constructing sets of MUBs. Most of them are based on discrete Fourier transform over Galois fields and Galois rings [4,6,7,23], discrete Wigner distribution [3,7,8], generalized Pauli spin operators [24,25,26,27,28], generalized Hadamard matrices [15,17], mutually orthogonal Latin squares [15,29,30], finite geometry methods [30,31,32], projective 2-designs [5,15,22], angular momentum theory and quadratic discrete Fourier transform [33,34,35], finite group approaches [23,28], Lie-like approaches [28,34,35,36,37], and phase states associated with a generalized Weyl–Heisenberg algebra [38]. (For a review on the subject, see [39].)
It is the aim of the present paper to emphasize another approach for the search of MUBs. Instead of looking for equiangular lines in C d satisfying Equation (4), we deal here with the search of equiangular vectors in C d 2 satisfying a relation of type Equation (4) without a modulus for the inner product. The transformation that makes it possible to pass from C d to C d 2 is given in Section 2. The reverse problem is the object of Section 3. Finally, some conclusions are drawn in Section 4. A preliminary note on some of the results of this paper was posted on arXiv [40].

2. The Passage from C d to C d 2

If we include the a = b case, Equation (3) leads to
| a α | b β | = δ α , β δ a , b + 1 d ( 1 δ a , b )
or equivalently
| a α | b β | 2 = δ α , β δ a , b + 1 d ( 1 δ a , b )
The problem of finding a complete set of d + 1 MUBs in C d amounts to finding d(d + 1) vectors | a α satisfying Equation (7), where a = 0 , 1 , , d and α = 0 , 1 , , d 1 (the indexes of type a refer to the bases and, for fixed a, the index α refers to one of the d vectors of the basis corresponding to a). By following the approach developed in [41] for positive operator valued measures and MUBs, we can transform this problem into a (possibly) simpler one (not involving a square modulus like in Equation (7)). The idea of the transformation is to introduce a projection operator associated with the | a α vector. This yields the following proposition.
Proposition 1. For d 2 , finding d + 1 MUBs in C d (if they exist) is equivalent to finding d ( d + 1 ) vectors w ( a α ) in C d 2 , of components w p q ( a α ) such that
w p q ( a α ) = w q p ( a α ) ¯ , p , q = 0 , 1 , , d 1
satisfying
p = 0 d 1 w p p ( a α ) = 1
and the inner product relations
w ( a α ) · w ( a β ) = δ α , β
and
w ( a α ) · w ( b β ) = 1 d for a b
where a , b = 0 , 1 , , d and α = 0 , 1 , , d 1 .
Proof. A proof was given in [41] by making use of Racah operators, which are useful tools in spectroscopy. Here we give a new proof based on the canonical generators of the GL( d , C ) linear group, which are simpler to handle and more adapted for applications. Let us suppose that it is possible to find d + 1 sets B a (with a = 0 , 1 , , d ) of vectors of C d such that Equation (7) is satisfied. It is thus possible to construct d(d + 1) projection operators
Π a α = | a α a α | , a = 0 , 1 , , d , α = 0 , 1 , , d 1
From Equations (7) and (12), it is clear that the Π a α operators (of rank 1) satisfy the trace conditions
Tr Π a α Π b β = δ α , β δ a , b + 1 d ( 1 δ a , b )
and
Tr Π a α = 1
where the traces are taken over C d (see also [26]). Each operator Π a α can be developed on an orthonormal basis { E p q : p , q = 0 , 1 , , d 1 } of the space of linear operators on C d (orthonormal with respect to the Hilbert–Schmidt inner product), that is,
Π a α = p = 0 d 1 q = 0 d 1 w p q ( a α ) E p q
The E p q operators are generators of the GL( d , C ) complex Lie group. Their main properties are
E p q = E q p , E p q E r s = δ q , r E p s , Tr E p q = δ p , q , Tr E p q E r s = δ p , r δ q , s , p , q , r , s Z / d Z
and they can be represented by the projectors
E p q = | p q | , p , q Z / d Z
The w p q ( a α ) expansion coefficients in Equation (15) are complex numbers such that
w p q ( a α ) ¯ = w q p ( a α ) , p , q Z / d Z
where the bar denotes complex conjugation. By combining Equations (13) and (15), we get
p = 0 d 1 q = 0 d 1 w p q ( a α ) ¯ w p q ( b β ) = δ α , β δ a , b + 1 d ( 1 δ a , b )
The Π a α operators can be considered as vectors
w ( a α ) = w 00 ( a α ) , w 01 ( a α ) , , w m m ( a α ) , m = d 1
in the Hilbert space C d 2 (not C d ) of dimension d 2 endowed with the usual inner product
w ( a α ) · w ( b β ) = p = 0 d 1 q = 0 d 1 w p q ( a α ) ¯ w p q ( b β )
In Equation (20), we use the dictionary order for ordering the components of w ( a α ) . Equation (19) can then be rewritten as
w ( a α ) · w ( b β ) = δ α , β δ a , b + 1 d ( 1 δ a , b )
to be compared with Equation (7). The determination of the Π a α operators is equivalent to the determination of the w p q ( a α ) components of the w ( a α ) vectors in C d 2 . This completes the proof.
For ab, Equations (10) and (11) show that angle ω a α b β between any vector w ( a α ) and any vector w ( b β ) is
ω a α b β = cos 1 ( 1 d )
and therefore does not depend on a, α, b and β. This justifies the terminology equiangular vectors in the title of this paper. Note also that Equation (23) is connected to the fact that mutually unbiased bases are complex projective 2-designs [5].
Proposition 1 can be transcribed in terms of matrices. Let M a α be the Hermitian matrix of dimension d whose elements are w p q ( a α ) . To be more precise, we take
M a α p q = w p q ( a α ) , p , q Z / d Z
The M a α matrix is positive-semidefinite. Equation (21) can be rewritten as
w ( a α ) · w ( b β ) = Tr M a α M b β
Therefore, we have the following proposition.
Proposition 2. For d 2 , finding d + 1 MUBs in C d (if they exist) is equivalent to finding d ( d + 1 ) positive-semidefinite (and thus Hermitian) matrices M a α of dimension d satisfying the trace relations
Tr M a α = 1
and
Tr M a α M b β = δ α , β δ a , b + 1 d ( 1 δ a , b )
where a , b = 0 , 1 , , d and α , β = 0 , 1 , , d 1 .
Proof. The proof is trivial.
It is to be noted that Proposition 2 is in agreement with the result of [29] according to which a complete set of d + 1 MUBs forms a convex polytope in the set of Hermitian matrices of dimension d and unit trace.
Finally, as a test of the validity of Propositions 1 and 2, we have the following result.
Proposition 3. For d prime, Equations (8) to (11) admit the solution
w p q ( a α ) = 1 d e i π ( p q ) [ ( d 2 p q ) a 2 α ] / d , a , α , p , q Z / d Z
and
w p q ( d α ) = δ p , q δ p , α , α , p , q Z / d Z
for a = d.
Proof. Clearly the M a α corresponding matrix is Hermitian and it is a simple matter of long calculation to show that it is positive-semidefinite. The rest of the proof is based on the use of Gauss sums [42] in connection with ordinary [43] and quadratic [44] discrete Fourier transforms. Indeed, the principal task is to calculate w ( a α ) · w ( b β ) as given by (21) with the help of Equations (28) and (29) in the cases a = b (for a = 0 , 1 , , d ), ab (for a , b = 0 , 1 , , d 1 ) and ab (for a = 0 , 1 , , d 1 and b = d). The main steps are the following.
(i)
Case a = b = d: We have
w ( d α ) · w ( d β ) = p = 0 d 1 q = 0 d 1 δ p , q δ p , α δ p , β = δ α , β
(ii)
Case a = b = 0 , 1 , , d 1 : We have
w ( a α ) · w ( a β ) = 1 d 2 p = 0 d 1 q = 0 d 1 e i 2 π ( p q ) ( α β ) / d = δ α , β
(iii)
Case a b ( a = 0 , 1 , , d 1 and b = d ): We have
w ( a α ) · w ( d β ) = 1 d p = 0 d 1 q = 0 d 1 e i π ( p q ) [ ( d 2 p q ) a 2 α ] / d δ p , q δ p , α = 1 d p = 0 d 1 δ p , α = 1 d
(iv)
Case a b ( a , b = 0 , 1 , , d 1 ): We have
w ( a α ) · w ( b β ) = 1 d 2 p = 0 d 1 q = 0 d 1 e i π ( p q ) [ ( d 2 p q ) ( b a ) + 2 ( α β ) ] / d
The double sum in Equation (33) can be factored into the product of two sums. This leads to
w ( a α ) · w ( b β ) = 1 d 2 k = 0 d 1 e i π { ( a b ) k 2 + [ ( d 2 ) ( b a ) + 2 ( α β ) ] k } / d 2
By introducing the generalized Gauss sums [42]
S ( u , v , w ) = k = 0 | w | 1 e i π ( u k 2 + v k ) / w
where u, v and w are integers such that u and w are coprime, uw is nonvanishing and uw + v is even, we obtain
w ( a α ) · w ( b β ) = 1 d 2 | S ( u , v , w ) | 2
with
u = a b , v = ( a b ) ( d 2 ) + 2 ( α β ) , w = d
The S(u, v, w) Gauss sum in Equations (36,37) can be calculated from the methods in [42]; this yields
| S ( u , v , w ) | = d
for d prime, u and v integers, u and d coprime, ud ≠ 0, and ud + v even. Finally, we get
w ( a α ) · w ( b β ) = 1 d
which completes the proof.
Let us remark that the proof holds true for d = 2 (Equation (38) is valid for d = 2 in contrast with some other Gauss sums [2]).

3. The Reverse Problem

It is legitimate to consider the question: How to pass from the w ( a α ) to | a α vectors in the case where d is the power of a prime integer?
Suppose we find d(d + 1) vectors of type Equation (20) satisfying Equations (8) to (11). Then, the Π a α operators given by Equation (15) are known. A matrix realization of each Π a α operator immediately follows from the standard matrix realization of the generators of the GL( d , C ) group. (In order to set up the matrix of Π a α , remember that, in terms of matrices, the generators E p q of GL( d , C ) are matrices of dimension d × d, the elements of which are 1 at the intersection of row p and column q and 0 elsewhere. The matrix thus obtained is nothing but M a α .) The eigenvector of the matrix of Π a α corresponding to the eigenvalue equal to 1 gives the | a α vector. This leads to the following recipe.
Proposition 4. In the case where d is a prime power, from the knowledge of the w ( a α ) vectors, the matrices of the Π a α operators can be constructed via Equation (15) (for a = 0 , 1 , , d and α = 0 , 1 , 2 , , d 1 ) . The d + 1 MUBs are then given, as column vectors, by the eigenvectors (normalized to 1) of the matrices of Π a α corresponding to the eigenvalues equal to 1. For fixed a, the eigenvectors of Π a 0 , Π a 1 , , Π a d 1 associated with the eigenvalue 1 constitute one of the d + 1 MUBs.
Proof. The proof follows from the fact that each Π a α operator (or the M a α corresponding matrix) has d − 1 eigenvalues equal to 0 and one eigenvalue equal to 1.
Example. As a pedagogical example, let us consider the situation where d = 2. By taking w p q ( a α ) given by Equations (28) and (29), we have
w p q ( a α ) = 1 2 e i π ( p q ) [ ( p + q ) a + 2 α ] / 2 , a , α , p , q Z / 2 Z
and
w p q ( 2 α ) = δ p , q δ p , α , α , p , q Z / 2 Z
The cases a = 0, 1 and a = 2 need to be treated separately.
For a = 2, we get
Π 2 α = p = 0 1 q = 0 1 w p q ( 2 α ) E p q = δ 0 , α E 00 + δ 1 , α E 11
The normalized eigenvectors of Π 20 and Π 21 associated with the eigenvalue equal to 1 are
| 20 = 1 0 , | 21 = 0 1
For a = 0 and 1, we have
Π a α = p = 0 1 q = 0 1 w p q ( a α ) E p q = 1 2 E 00 + e i ( a + 2 α ) π / 2 E 01 + e i ( a + 2 α ) π / 2 E 10 + E 11
When a = 0, the diagonalization of
Π 00 = 1 2 E 00 + E 01 + E 10 + E 11
Π 01 = 1 2 E 00 E 01 E 10 + E 11
leads to
| 00 = 1 2 1 1 , | 01 = 1 2 1 1
Similarly for a = 1, the matrices
Π 10 = 1 2 E 00 + i E 01 i E 10 + E 11
Π 11 = 1 2 E 00 i E 01 + i E 10 + E 11
yield
| 10 = 1 2 1 i , | 11 = 1 2 1 i
The vectors (43), (47) and (50) correspond to the familiar bases of qubits associated with the eigenvectors of the Pauli matrices σ z , σ x and σ y , respectively.

4. Conclusions

In conclusion, we have found a transformation that allows to replace the search of d + 1 MUBs in C d by the determination of d(d + 1) vectors in C d 2 . Passing from C d to C d 2 amounts to replacing the square of the modulus of the inner product a α | b β in C d , see Equation (7), by the inner product w ( a α ) · w ( b β ) in C d 2 , see Equations (10) and (11). It is expected that the determination of the d(d + 1) vectors w ( a α ) satisfying Equations (8) to (11) (or the d(d + 1) corresponding Hermitian positive-semidefinite matrices M a α satisfying Equations (27) and (26)) should be easier than the determination of the d(d + 1) vectors | a α satisfying Equation (7). In this respect, the absence of a modulus in Equation (11) represents an incremental step.
Of course, the impossibility of finding d(d + 1) vectors w ( a α ) or d(d + 1) matrices M a α would mean that d + 1 MUBs do not exist in C d when d is not a strictly positive power of a prime. The techniques used in the determination of equiangular lines and equiangular tight frames [32,45] could perhaps be of value for determining the number of vectors in C d 2 satisfying Equation (23).
Transforming a given problem into another one is always interesting even in the case where the new problem does not lead to the solution of the first one. In this vein, the existence problem of MUBs in d dimensions was approached in the past from the points of view of various fields, e.g., finite geometry, Latin squares, Hadamard matrices, and Lie groups, just to name a few (see [39] and references therein), with some interesting developments both for MUBs and the involved fields. We hope that the results presented here will stimulate further works, especially a new way to handle the d = 6 unsolved problem.
To close, let us mention that it should be interesting to apply the developments above (especially Proposition 1) to the concept of weakly MUBs recently introduced for dealing in the Z / d Z × Z / d Z phase space [46]. In addition, the results presented in this paper might be of interest in studies involving the concept of constellations of MUBs introduced in [18].

Acknowledgements

The author is indebted to Markus Grassl, Michel Planat, Apostol Vourdas, Stefan Weigert, and Karol Życzkowski for useful comments on a preliminary version of this paper.

References

  1. Schwinger, J. Unitary operator bases. Proc. Nat. Acad. Sci. USA 1960, 46, 570–579. [Google Scholar] [CrossRef] [PubMed]
  2. Ivanović, I.D. Geometrical description of quantum state determination. J. Phys. A-Math. Gen. 1981, 14, 3241–3245. [Google Scholar] [CrossRef]
  3. Wootters, W.K. A Wigner-function formulation of finite-state quantum mechanics. Ann. Phys. (N.Y.) 1987, 176, 1–21. [Google Scholar] [CrossRef]
  4. Wootters, W.K.; Fields, B.D. Optimal state-determination by mutually unbiased measurements. Ann. Phys. (N.Y.) 1989, 191, 363–381. [Google Scholar] [CrossRef]
  5. Klappenecker, A.; Rötteler, M. Mutually Unbiased Bases are Complex Projective 2-Designs. In Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT’05), Adelaide, Australia, 4–9 September 2005; pp. 1740–1744.
  6. Klimov, A.B.; Sánchez-Soto, L.L.; de Guise, H. Multicomplementary operators via finite Fourier transform. J. Phys. A-Math. Gen. 2005, 38, 2747–2760. [Google Scholar] [CrossRef]
  7. Gibbons, K.S.; Hoffman, M.J.; Wootters, W.K. Discrete phase space based on finite fields. Phys. Rev. A 2004, 70, 062101:1–062101:23. [Google Scholar] [CrossRef]
  8. Pittenger, A.O.; Rubin, M.H. Wigner functions and separability for finite systems. J. Phys. A-Math. Gen. 2005, 38, 6005–6036. [Google Scholar] [CrossRef]
  9. Englert, B.-G.; Aharonov, Y. The mean king’s problem: Prime degrees of freedom. Phys. Lett. A 2001, 284, 1–5. [Google Scholar] [CrossRef]
  10. Tolar, J.; Chadzitaskos, G. Feynman’s path integral and mutually unbiased bases. J. Phys. A-Math. Theor. 2009, 42, 245306:1–245306:11. [Google Scholar] [CrossRef]
  11. Calderbank, A.R.; Cameron, P.J.; Kantor, W.M.; Seidel, J.J. Z4-Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. Lond. Math. Soc. 1997, 75, 436–480. [Google Scholar] [CrossRef]
  12. Cerf, N.J.; Bourennane, M.; Karlsson, A.; Gisin, N. Security of quantum key distribution using d-level systems. Phys. Rev. Lett. 2002, 88, 127902:1–127902:4. [Google Scholar] [CrossRef] [PubMed]
  13. Grassl, M. Tomography of quantum states in small dimensions. Elec. Notes Discrete Math. 2005, 20, 151–164. [Google Scholar] [CrossRef]
  14. Lawrence, J. Entanglement patterns in mutually unbiased basis sets for N prime-state particles. 2011; arXiv:1103.3818 [quant-ph]. [Google Scholar]
  15. Wocjan, P.; Beth, T. New construction of mutually unbiased bases in square dimensions. Quantum Inf. Comput. 2005, 5, 93–101. [Google Scholar]
  16. Grassl, M. On SIC-POVMs and MUBs in dimension 6. In Proceedings of the ERATO Conference on Quantum Information Science (EQIS’04), Tokyo, Japan, 1–5 September 2004. arXiv:quant-ph/0406175.
  17. Bengtsson, I.; Bruzda, W.; Ericsson, Å.; Larsson, J.Å.; Tadej, W.; Życzkowski, K. Mutually unbiased bases and Hadamard matrices of order six. J. Math. Phys. 2007, 48, 052106:1–052106:21. [Google Scholar] [CrossRef]
  18. Brierley, S.; Weigert, S. Maximal sets of mutually unbiased quantum states in dimension 6. Phys. Rev. A 2008, 78, 042312:1–042312:8. [Google Scholar] [CrossRef]
  19. Brierley, S.; Weigert, S. Constructing mutually unbiased bases in dimension six. Phys. Rev. A 2009, 79, 052316:1–052316:13. [Google Scholar] [CrossRef]
  20. McNulty, D.; Weigert, S. The limited role of mutually unbiased product bases in dimension 6. J. Phys. A-Math. Theor. 2012, 45, 102001:1–102001:5. [Google Scholar] [CrossRef]
  21. McNulty, D.; Weigert, S. On the impossibility to extend triples of mutually unbiased product bases in dimension six. Int. J. Quantum Inf. 2012, 10, 1250056:1–1250056:11. [Google Scholar] [CrossRef]
  22. Zauner, G. Quantendesigns: Grundzuege einer nichtcommutativen Designtheorie. Dissertation, Universitaet Wien, Austria, 1999. [Google Scholar]
  23. Chaturvedi, S. Aspects of mutually unbiased bases in odd-prime-power dimensions. Phys. Rev. A 2002, 65, 044301:1–044301:3. [Google Scholar] [CrossRef]
  24. Bandyopadhyay, S.; Boykin, P.O.; Roychowdhury, V.; Vatan, F. A new proof for the existence of mutually unbiased bases. Algorithmica 2002, 34, 512–528. [Google Scholar]
  25. Lawrence, J.; Brukner, Č.; Zeilinger, A. Mutually unbiased binary observable sets on N qubits. Phys. Rev. A 2002, 65, 032320:1–032320:5. [Google Scholar] [CrossRef]
  26. Lawrence, J. Mutually unbiased bases and trinary operator sets for N qutrits. Phys. Rev. A 2004, 70, 012302:1–012302:10. [Google Scholar] [CrossRef]
  27. Pittenger, A.O.; Rubin, M.H. Mutually unbiased bases, generalized spin matrices and separability. Linear Alg. Appl. 2004, 390, 255–278. [Google Scholar] [CrossRef]
  28. Albouy, O.; Kibler, M.R. SU2 nonstandard bases: Case of mutually unbiased bases. SIGMA 2007, 3, 076:1–076:22. [Google Scholar] [CrossRef]
  29. Bengtsson, I. ; Ericsson, Å. Mutually unbiased bases and the complementary polytope. Open Syst. Inf. Dyn. 2005, 12, 107–120. [Google Scholar] [CrossRef]
  30. Bengtsson, I. MUBs, Polytopes, and Finite Geometries. In Proceedings of the AIP Conference 750, Vaxjo, Sweden, 7–12 June 2004; pp. 63–69.
  31. Saniga, M.; Planat, M.; Rosu, H. Mutually unbiased bases and finite projective planes. J. Opt. B Quantum Semiclassical Opt. 2004, 6, L19–L20. [Google Scholar] [CrossRef]
  32. Godsil, C.D.; Roy, A. Equiangular lines, mutually unbiased bases, and spin models. Eur. J. Combin. 2009, 30, 246–262. [Google Scholar] [CrossRef]
  33. Kibler, M.R. Angular momentum and mutually unbiased bases. Int. J. Mod. Phys. B 2006, 20, 1792–1801. [Google Scholar] [CrossRef]
  34. Kibler, M.R.; Planat, M. A SU(2) recipe for mutually unbiased bases. Int. J. Mod. Phys. B 2006, 20, 1802–1807. [Google Scholar] [CrossRef]
  35. Kibler, M.R. An angular momentum approach to quadratic Fourier transform, Hadamard matrices, Gauss sums, mutually unbiased bases, unitary group and Pauli group. J. Phys. A Math. Theor. 2009, 42, 353001:1–353001:28. [Google Scholar] [CrossRef] [Green Version]
  36. Boykin, P.O.; Sitharam, M.; Tiep, P.H.; Wocjan, P. Mutually unbiased bases and orthogonal decompositions of Lie algebras. J. Quantum Inform. Comput. 2007, 7, 371–382. [Google Scholar]
  37. Garcia, A.; Romero, J.L.; Klimov, A.B. Group-theoretical approach to the construction of bases in 2n-dimensional Hilbert space. Phys. Atom. Nuclei 2011, 74, 876–883. [Google Scholar] [CrossRef]
  38. Daoud, M.; Kibler, M.R. Phase operators, temporally stable phase states, mutually unbiased bases and exactly solvable quantum systems. J. Phys. A-Math. Theor. 2010, 43, 115303:1–115303:18. [Google Scholar] [CrossRef] [Green Version]
  39. Durt, T.; Englert, B.-G.; Bengtsson, I.; Życzkowski, K. On mutually unbiased bases. Int. J. Quantum Inf. 2010, 8, 535–640. [Google Scholar] [CrossRef]
  40. Kibler, M.R. On mutually unbiased bases: Passing from d to d**2. 2012; arXiv:1210.8173 [quantph]. [Google Scholar]
  41. Albouy, O.; Kibler, M.R. A unified approach to SIC-POVMs and MUBs. J. Russ. Laser Res. 2007, 28, 429–438. [Google Scholar] [CrossRef] [Green Version]
  42. Berndt, B.C.; Evans, R.J.; Williams, K.S. Gauss and Jacobi Sums; Wiley: New York, NY, USA, 1998. [Google Scholar]
  43. Vourdas, A. Quantum systems with finite Hilbert space. Rep. Prog. Phys. 2004, 67, 267–320. [Google Scholar] [CrossRef]
  44. Kibler, M.R. Quadratic Discrete Fourier Transform and Mutually Unbiased Bases. In Fourier Transforms-Approach to Scientific Principles; Nikolić, G.S., Ed.; InTech: Rijeka, Croatia, 2011; pp. 103–138. [Google Scholar]
  45. Mohammad-Abadi, S.A.; Najafi, M. Type of equiangular tight frames with n + 1 vectors in Rn. Int. J. Appl. Math. Res. 2012, 1, 391–401. [Google Scholar]
  46. Shalaby, M.; Vourdas, A. Weak mutually unbiased bases. J. Phys. A: Math. Theor. 2012, 45, 052001:1–052001:15. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Kibler, M.R. Equiangular Vectors Approach to Mutually Unbiased Bases. Entropy 2013, 15, 1726-1737. https://doi.org/10.3390/e15051726

AMA Style

Kibler MR. Equiangular Vectors Approach to Mutually Unbiased Bases. Entropy. 2013; 15(5):1726-1737. https://doi.org/10.3390/e15051726

Chicago/Turabian Style

Kibler, Maurice R. 2013. "Equiangular Vectors Approach to Mutually Unbiased Bases" Entropy 15, no. 5: 1726-1737. https://doi.org/10.3390/e15051726

APA Style

Kibler, M. R. (2013). Equiangular Vectors Approach to Mutually Unbiased Bases. Entropy, 15(5), 1726-1737. https://doi.org/10.3390/e15051726

Article Metrics

Back to TopTop