Quantum Information : A Brief Overview and Some Mathematical Aspects

The aim of the present paper is twofold. First, to give the main ideas behind quantum computing and quantum information, a field based on quantum-mechanical phenomena. Therefore, a short review is devoted to (i) quantum bits or qubits (and more generally qudits), the analogues of the usual bits 0 and 1 of the classical information theory, and to (ii) two characteristics of quantum mechanics, namely, linearity, which manifests itself through the superposition of qubits and the action of unitary operators on qubits, and entanglement of certain multi-qubit states, a resource that is specific to quantum mechanics. A, second, focus is on some mathematical problems related to the so-called mutually unbiased bases used in quantum computing and quantum information processing. In this direction, the construction of mutually unbiased bases is presented via two distinct approaches: one based on the group SU(2) and the other on Galois fields and Galois rings.


Introduction
In the present days, there is a growing interest for the field of quantum information and quantum computing.Such a field emerged at the beginning of the 1980s when Feynman and other scientists asked the question: is it possible to simulate the behaviour of a quantum system by using a classical computer?Then, the question evolved towards how to use quantum systems to do computations.This led to the idea of a quantum computer based on quantum physics with the hope to solve problems that would be intractable or difficult to solve with a classical computer.A fact in favour of a quantum computer is the law by Moore according to which the size of electronic and spintronic devices for a classical computer should approach 10 nm in 2020, the scale where quantum effects become important.The field of quantum information and quantum computing is at the crossroads of experimental and theoretical quantum physical sciences (physics and chemistry), discrete mathematics and informatics with the aim of building a quantum computer.We note in passing that physics, mathematics, informatics and engineering have already greatly benefited from the enormous amount of works achieved along the line of quantum information and quantum computing.
The unit of classical information is the bit (possible values 0 and 1).In a quantum computer, classical bits (0 and 1) are replaced by quantum bits or qubits (that interpolate in some sense between 0 and 1).The most general qubit is a normalized vector |ψ in the two-dimensional Hilbert space C 2 where |0 and |1 are the elements of an orthonormal basis in C 2 .The result of a measurement of |ψ is not deterministic since it gives |0 or |1 with the probability |a| 2 or |b| 2 , respectively.The consideration of N qubits leads to work in the 2 N -dimensional Hilbert space C 2 N .Note that the notion of qubit, corresponding to C 2 , is a particular case of the one of qudit, corresponding to C d (d not necessarily in the form 2 N ).A system of N qudits is associated with the Hilbert space C d N .In this connection, the techniques developed for finite-dimensional Hilbert spaces are of paramount importance in quantum computation and quantum computing.
From a formal point of view, a quantum computer is a system producing qubits, the state of which can be controlled and manipulated via unitary transformations.These transformations correspond to the product of elementary unitary operators called quantum gates (the analogues of the logic gates of a classical computer) acting on one, two or more qubits.Measurement of the qubits out-coming from a quantum circuit of quantum gates yields the result of a (quantum) computation.In other words, a realization of quantum information processing can be performed by preparing a quantum system in a quantum state, then submitting this state to unitary transformations and, finally, reading the outcome from a measurement.
The two basic characteristics of quantum mechanics used in a quantum computer are linearity (principle of superposition of quantum states) and entanglement.The superposition principle gives resources: the quantum computer can be in several states at the same time.This leads to a massive quantum parallelism with a speed up of computations (for N qubits, 2 N computations can be achieved in parallel through the use of quantum algorithms).Entanglement, i.e., the fact that certain quantum systems made of two or more sub-systems behave as an indissociable entity, is at the root of quantum computing and quantum teleportation.In quantum mechanics, each measurement on a quantum system perturbs the system and the superposition principle makes impossible to duplicate a quantum state (no-cloning theorem).The two latter points and the use of the so-called mutually unbiased bases (MUBs), to be defined in Section 3, are the basic ingredients of quantum cryptography (illustrated by the BB84 protocol, the first protocol of quantum cryptography).
The aim of this paper is to present to a community of computer engineers and mathematicians the basic grounds of quantum information and quantum computing as well as some mathematical aspects and related open problems.
This paper is organized as follows.Section 2 deals with the general framework of quantum information and quantum computing (i.e., information and computing based on quantum physics): some of the concepts and ideas evoked above are further described.In Section 3, we address some mathematical aspects of quantum information; in particular, we review some of the methods for constructing mutually unbiased bases (more precisely, methods based on the group SU (2) and on Galois rings and Galois fields).Sections 2 and 3 are mainly based on References [1,2], respectively.References  constitute an incomplete list (in chronological order) of original works of relevance for an in-depth study of Sections 2 and 3. Finally, the reader will find in Reference [78] some calculations with the help of the Python language illustrating the derivation of mutually unbiased bases according to the methods described in Section 3.

Quantum Mechanics in a Few Words
Classical physics does not apply in the microscopic world.It is not appropriate for describing, explaining and predicting physical and chemical phenomena at the atomic and sub-atomic level.The convenient theory for quantum systems (i.e., molecules, atoms, nuclei and elementary particles) is quantum mechanics, an extension of the old quantum theory mainly due to Planck, Einstein, Bohr and Sommerfeld (the word quantum comes from the fact that the energy exchanges between light and matter occur in a quantized form).Quantum mechanics, which is often used in conjunction with some other theories like relativity and quantum field theory, can be presented in two equivalent ways: wave mechanics initiated by de Broglie and Schrödinger and matrix mechanics pioneered by Heisenberg, Born and Jordan.It is not our purpose to list in detail the postulates of quantum mechanics.We shall restrict ourselves with four aspects of the Copenhagen interpretation which are indispensable in quantum information and quantum computing.

•
In both presentations of quantum mechanics, the state of a closed quantum system is described by a vector (in matrix mechanics) or a wave function (in wave mechanics), noted |ψ in both cases, belonging to a finite or infinite Hilbert space H.

•
In quantum information and quantum computing, the space H is finite-dimensional (isomorphic to C 2 for qubits or C d for qudits) and the (normalized) vector |ψ , defined up to a phase factor, can be the result (arising from an evolution or transformation of a vector |ψ ) |ψ = U|ψ of the action of a unitary operator U (or quantum gate) on |ψ .(We are not concerned here with dynamical systems for which the time evolution of ψ in the wave picture is given by the Schrödinger equation, in the non-relativistic case, or the Dirac equation, in the relativistic case, two linear equations.) In quantum information and quantum computing, |ψ is given by a linear combination of the eigenvectors of an observable in the matrix formulation.An observable A is associated with a measurable physical quantity (energy, position, impulsion, spin, etc.).It is represented by a self-adjoint operator A acting on the space H.The possible outcomes of a measurement of an observable A are the real eigenvalues of the operator A. Measurement in quantum mechanics exhibits a probabilistic nature.More precisely, if (in the case of the finite-dimensional Hilbert space where the ϕ n given by are the orthormalized eigenvectors of A, then a measurement of A will give λ k with the probability where ϕ k |ψ stands for the inner product of |ψ by |ϕ k (we suppose that the spectrum of A is non-degenerate).Hence, before measurement, the quantum system is in several states being a linear combination of the states |ϕ n and, after measurement, the quantum system is in a well-defined state |ϕ k .Measurement leads to a reduction of the wave packet or wave function collapse.In terms of measurement of qudits, what precedes can be formulated as follows.Let |ψ as given by Equation (2) be a qudit describing a quantum system before measurement.A measurement of |ψ in a basis {ϕ i : Observe that the factor ϕ i |ψ | ϕ i |ψ | −1 is a simple phase factor without importance.By way of example, in the case of C 2 , measurement of the qubit |ψ = a|0 + b|1 in the basis {|0 , |1 } of C 2 yields |0 or |1 (up to unimportant phase factors) with the probabilities |a| 2 or |b| 2 , respectively.
• A postulate of quantum mechanics of considerable interest in quantum information and quantum computing concerns the description of a system composed of several sub-systems.The state vector for the system is build from tensors products of the state vectors of the various sub-systems.This may lead to entangled vector states for the composite system.Entanglement constitutes another important resource for quantum information and quantum computing besides the linearity and the non deterministic nature of quantum mechanics.As an example, suppose we have a system of qubits made of two two-level sub-systems.The Hilbert space for the system is where the first and second C 2 corresponds to the first and second sub-systems, respectively.By the tensor product, we can take as a basis for C 4 , where the indices 1 and 2 refer to the first and the second qubits, respectively.Two kinds of states can be considered in C 4 , namely separable or non entangled states as and non separable or entangled states as For the non entangled state |ψ s , measurement of the qubit 1 yields |0 1 with the probability 1 while measurement of the qubit 2 leads either to |0 2 with the probability 1  4 or to |1 2 with the probability 3  4 ; therefore, the result of a measurement for one qubit does not depend on the result of a measurement for the other qubit.The situation turns out to be entirely different for the entangled state |ψ ns : a measurement of the first qubit leads either to |0 1 with the probability 1  2 or to |1 1 with the probability 1  2 ; once one of the two results has been obtained, we immediately know what would be the result if we perform a measurement on the second qubit; it is thus unnecessary to make a measurement on the second qubit and this may be sum up as follows: result of a measurement of qubit 1 ⇒ state of qubit 2 (without measurement) and conversely result of a measurement of qubit 2 ⇒ state of qubit 1 (without measurement) Entanglement may also occur for more than two qubits.For entangled states, there are strong correlations between the results of measurements of the qubits.This effect is essential for quantum information and quantum computing.
Unfortunately, "something is rotten in the state of Denmark" (where the Copenhagen interpretation developed).In fact, entanglement is also an inconvenience: entanglement of qubits with their environment leads to errors.This is known as the effect of decoherence an important drawback for the building of a quantum computer.One way to fight against errors due to decoherence and other effects of noise is to develop quantum error-correcting codes.
From a group-theoretical point of view, |0 and |1 can be considered as the basis vectors for the fundamental irreducible representation 1  2 of SU(2), in the chain SU(2) ⊃ U(1), with in the notations of quantum angular momentum theory.
The state |ψ can be associated with a point (x, y, z, t) of the sphere S 3 in R 4 according to with a = x + iy and b = z + it.In fact, the point (x, y, z, t) can be visualized as a point (1, θ, ϕ) of the sphere S 2 in R 3 , referred to as the Bloch sphere, since ψ can be re-written as up to a global multiplicative phase factor.The application corresponds to the first Hopf fibration S 3 S 1 −→ S 2 of compact fibre S 1 .Any qubit as given by Equation ( 4) can be represented by a point on the Bloch sphere.Table 1 gives the correspondence between some remarkable qubits |ψ and points on the Bloch sphere.Any unitary transformation acting on a qubit |ψ corresponds to a rotation around an axis passing through the centre of the Bloch sphere.
Note that the sets appearing in Table 1 are three orthonormal bases of the space C 2 .In addition, the vectors in B 0 , B 1 and B 2 are eigenvectors of the Pauli matrices σ 1 , σ 2 and σ 3 (defined in Equation ( 9) below), respectively.The bases B 0 , B 1 and B 2 constitute the simplest example of the so-called MUBs to be studied in Section 3.

Qudits
The generalisation from the two-dimensional Hilbert space C 2 to the d-dimensional Hilbert space C d (d > 2) is immediate.Given an orthonormal basis (called the computational basis) From the point of view of quantum mechanics, the states |n can be realized as generalized angular momentum states with where for fixed j, the index m takes the values −j, −j + 1, • • • , j.This yields the correspondence In the case where d = 2 N , the corresponding qudits can be obtained from tensor products.For example, for d = 4 a basis of Then, the most general quartit |ψ is made of the superposition of tensor products of two qubits.In detail, we have where a, b, c, d ∈ C (usually, in |i ⊗ |j the state |i refers to the first qubit and |j to the second).
It is interesting to remark that the vectors |ψ for d = 2, 2 2 and 2 3 are associated with the Hopf fibrations S 3 S 1 −→ S 2 (connected to complex numbers), S 7 S 3 −→ S 4 (connected to quaternions) and S 15 S 7 −→ S 8 (connected to octonions).Entanglement for d = 2 2 and 2 3 can be discussed in terms of fibrations on spheres [21].In the same vein, we may ask the question of the interest for entanglement of Cayley-Dickson algebras for d = 2 N with N > 3 and of fibrations on hyperboloids [13].

Physical Realizations of Qubits
According to R. Landauer, information is physical so that qubits are realised by quantum systems, more specifically by two-level quantum systems, the qubits |0 and |1 corresponding to two different (energy) levels.We shall not be concerned here with the physical realization of qubits (and qudits).It is enough to say that any two-level quantum system may be considered as a qubit.Therefore, qubits can be carried out by nuclear spins, ultra-cold trapped ions, neutral atoms and Bose-Einstein condensates, two different polarizations of a photon, and Josephson tunnel nanojunctions.For instance, in nuclear magnetic resonance, the nuclear spins of an atom in an organic molecule can be aligned (giving the state |0 ) or anti-aligned (giving the state |1 ) with an applied constant magnetic field; in generalized angular momentum terminology, we have the quantum states given by Equation (3) and corresponding to the spin j = 1 2 .Similarly, for an ion cooled and trapped by electric fields in a cavity, qubits can be implemented as electronic states (ground state for |0 , excited state for |1 ).Vibrational states can also be used for realizing qubits (zero-phonon state for |0 , one-phonon state for |1 ).

Generalities
Entanglement occurs only in quantum physics.It has no analogue in classical physics.The notion of entanglement goes back to the famous paper by Einstein, Poldosky and Rosen.In quantum physics, two (or more than two) particles are said to be entangled if the quantum state of each particle depends of the quantum state(s) of the other(s) or cannot be described independently of the quantum state(s) of the other(s).In other words, there exist correlations between the physical properties of a system of entangled particles.More generally, two entangled sub-systems S 1 and S 2 are not independent so that the global system {S 1 , S 2 } must be considered as a whole even after separation by an arbitrary distance.Then, a measurement made on one sub-system gives an information on the other (without measurement on the other sub-system).On the contrary, for a non entangled system consisting of two sub-systems, a measurement on one sub-system does not give in general an information on the other sub-system.
As an example, let us consider a system consisting of two particles, system having a total spin equal to 0. If the spin of one particle is measured to be 1  2 on a certain axis, then we know (without any measurement) that the spin on the other particle on the same axis is − 1 2 because The two particles are not independent, even after separation.They still behave like an indivisible system of spin 0.
Entanglement contradicts the principle of locality.There is non locality in the sense that what happens in some place depends of what happens in another place.Indeed, quantum mechanics is a non local, non deterministic and linear physical theory.

Entanglement of Qubits
In quantum information, the notion of entanglement occurs for multi-qubit systems.Let us consider a two-qubit system.There are two possibilities.

•
The system is non entangled (or separable); it is then described by a state |ψ s ∈ C 2 ⊗ C 2 such that which can be re-written as where a|0 + b|1 and c|0 + d|1 refer to the first and second qubit, respectively.

•
The system is entangled (or non separable); it is then described by a state |ψ ns ∈ C 4 such that cannot be written as the tensor product of two qubits in C 2 .
It is clear that a necessary and sufficient condition for an arbitrary two-qubit state Therefore, if αδ − βγ = 0, then the state is entangled.The degree of entanglement of an arbitrary normalized two-qubit state |ψ is characterized by the concurrence defined by Non entangled states correspond to C = 0, maximally entangled states to C = 1 2 .(A maximally entangled state is such that the density operator for each qubit is half the identity operator; it corresponds to a maximum value of the entropy.)Equation ( 8) can be straightforwardly generalized to the case of two qudits for which the concurrence C is defined as in agreement with Equation (8) for d = 2.
Example 1.Let us consider the four states (⊕ stands for the addition modulo 2) called Bell states (in reference to the work on the so-called Bell inequalities) or EPR pairs (in reference to the paper by Einstein, Poldosky and Rosen).As a particular case where the first qubit (qubit 1) and the second one (qubit 2) are clearly emphasized in order to avoid confusion.The result of a measurement of the qubit 1 gives • either |0 1 (with the probability 1 2 ) so that the qubit 2 is a priori (without measurement) in the state |1 2 • or |1 1 (with the probability 1 2 ) so that the qubit 2 is a priori (without measurement) in the state |0 2 but no measurement can lead to both qubits 1 and 2 in the same state (|0 or |1 ).The result of a measurement of the qubit 1 provides information on the qubit 2 and reciprocally.It is then unnecessary to make a measurement of one qubit once the result of the measurement of the other is known.Similar conclusions can be obtained for the three other Bell states β 00 , β 10 and β 11 .The four Bell states are maximally entangled (they correspond to C = 1 2 ).In passing note that where σ 0 , σ 1 and σ 3 are three of the four Pauli matrices Thus, any Bell state |β xy can be obtained from |β 00 .
Example 2. Let us consider the separable state tensor product of two normalized qubits.A measurement of the first qubit gives either |0 with the probability | 2 while a measurement of the second qubit gives either |0 with the probability . Therefore, a measurement on one qubit does not provide information on the other qubit (the state |ψ corresponds to C = 0).
It is important to realize that entanglement of qubits (as in Example 1) and more generally of qudits has no analogue for classical bits.To be clear, the bits in 00 or 01 or 10 or 11 are not correlated.This is not the case for the quantum bits in any of the Bell states β xy .

One-Qubit Gates
In a classical computer, bits are handled with the help of logic gates (there exist seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR).A quantum computer processes qubits arranged in registers.It is equipped with quantum gates which perform unitary transformations on qubits.Quantum gates can be represented by unitary matrices.Table 2 gives some examples of quantum gates [G] for one-qubit systems together with their matrix representations G.The actions of the one-qubit gates of Table 2 on the qubit |x (with x = 0 or 1) are given by Therefore, by linearity (the last circuit reflects that H 2 = I).Note that the most general qubit can be obtained from the sequence or S π 2 +ϕ HS 2θ H|0 = cos θ|0 + e iϕ sin θ|1 up to the phase factor e iθ .
Table 2. Four basic quantum gates for one-qubit systems; the gates [I] and [NOT] also denoted [X] are associated with the Pauli matrices σ 0 or I and σ 1 or σ x , respectively; the two other Pauli matrices σ 2 or σ y and σ 3 or σ z define two further one-qubit gates denoted as [Y] and [Z], respectively.

Gate [G] Identity Gate [I] Not Gate [NOT] Phase Gate [S θ ] Hadamard Gate [H]
Quantum gates for two-qubit systems are important.For example, let us mention the controlled-NOT gate [C NOT ] defined via where the first input qubit |x and the second input qubit |y are called control qubit and target qubit, respectively.Here, the corresponding quantum circuit has two inputs (|x and |y ) and two outputs (|x and |y ⊕ x ).In matrix form, we have the permutation matrix where x = 0 or 1; however, this result does not mean that an arbitrary state |ψ = a|0 + b|1 can be cloned by using the gate [C NOT ] since we generally have (see Section 2.6) to be compared with Equation (10).Note also that or in an equivalent way where f stands for the function There exist other two-qubit gates.Moreover, use is also made of n-qubit gates (n > 2).The advantage of the quantum gates over the classical logic gates is that all the quantum gates are reversible or invertible due to the unitary property of the matrices representing quantum gates; this is not always the case for classical logic gates.
The preceding examples are sufficient for illustrating how works the algorithm set up by Deutsch and Jozsa [1].

Quantum Computing Algorithms
The Deutsch-Jozsa algorithm addresses the following problem: to find with only one measurement if the function . The classical algorithm requires 2 n−1 + 1 evaluations of f whereas only one measurement is necessary in order to get the answer.For n = 1, the proof based on the quantum circuit Then, the result of a single measurement of the first output qubit can be Therefore, a single measurement (instead of two in the classical case) is sufficient for getting the answer.The Deutsch-Jozsa algorithm is of little interest.However, it shows the superiority of the quantum approach on the classical one (namely, only one measurement instead of 2 n−1 + 1 evaluations in the general case where f : {0, 1} ⊗n → {0, 1}).
Let us briefly mention two other historical algorithms, viz, the Shor algorithm and the Grover algorithm [1].The Shor algorithm concerns the search of the period of a periodic function and is used for the factorization of a composite integer into prime factors.It constitutes an alternative to the classical RSA code.The Grover algorithm makes it possible to find an item in an unstructured data basis consisting of n entries; the quantum speed up for this algorithm is n → √ n (O(n) researches for the classical case and O( √ n) for the quantum case).The two preceding algorithms are based on the massive quantum parallelism.They formally show the superiority of a (still hypothetical) quantum computer on a classical one.The present evolution is towards quantum cryptography.

No-Cloning Theorem
We may ask the question: does there exist a unitary operator (or quantum gate) U such that U|ψ ⊗ |0 = |ψ ⊗ |ψ (11) where |ψ = a|0 + b|1 is an arbitrary qubit.As a consequence of the linearity of quantum mechanics, the answer is no: it is not possible to clone an arbitrary qubit |ψ [8].This result can be proved in the following way.Suppose that there exists U such that Equation ( 11) is true.Then, by linearity On another side, we have Compatibility between Equations ( 12) and ( 13) yields The sole solutions are (a = 1, b = 0) and (a = 0, b = 1) in agreement with Equation (10).There are no solution in the general case.This proves the no-cloning theorem (a theorem that does not have an analogue in classical information).
Another way to understand this result is to realize that in order to clone an arbitrary state |ψ = a|0 + b|1 one must measure it so that one gets |0 or |1 , two states that differ from |ψ in general.

Quantum Teleportation
It is not possible to clone an arbitrary quantum state.However, it is feasible to teleporte it, i.e., to transfer it from one place to another without an effective transportation.In other words, without a material transportation of a qubit, it is possible to transmit at distance the information contained in the qubit.We shall not deal here with some physical device making teleportation possible.We shall rather limit ourselves to the corresponding quantum algorithm [15].Suppose someone, Alice, wants to send a qubit |ψ = a|0 + b|1 (for which she does not know a and b) to somebody, Bob, by a quantum circuit and the possibility of using a classical communication channel.The only requirement for Bob and Alice is to dispose of and EPR pair |β 00 , the first qubit of which belongs to Alice and the second one to Bob.Thus, the entry |ϕ 0 of the quantum circuit is where qubits 1 and 2 refer to the Alice qubit and qubit 3 to the Bob qubit.Then, Alice sends her qubits to a controlled-NOT gate producing the state Next, qubit 1 goes to an Hadamard gate giving which can be re-arranged as then Bob would obtain a|0 3 + b|1 3 after the use of the gates [X] or [Z] or [T] with T = ZX on the states a|1 3 + b|0 3 or a|0 3 − b|1 3 or a|1 3 − b|0 3 , respectively.In all cases, the qubit |ψ = a|0 + b|1 has been teleported.This proof shows that entanglement (via the EPR pair) plays a crucial role in teleportation.

Generalities about MUBs
Unitary operator bases in the Hilbert space C d are of pivotal importance for quantum information and quantum computing as well as for quantum mechanics in general.The interest for unitary operator bases started with the seminal work by Schwinger [5].In this connection, MUBs play a key role in quantum information and quantum computing.Two distinct orthonormal bases of C d are said to be unbiased if and only if the modulus of the inner product of any vector of one basis with any vector of the other one is equal to 1

√ d
(see the detailed definition in Section 3.1.2).MUBs proved to be useful in classical information theory (network communication protocols) [17,47].They play an important role in quantum mechanics as for the discrete Wigner function [11,29,34,42,43,55,62], for the solution of the Mean King problem [20,26,33,34,43], for the understanding of the Feynman path integral formalism [57,63] and potentially for studies of the Weyl-Heisenberg group in connection with quantum optics.MUBs are of central importance in quantum information theory as for instance in quantum state tomography (deciphering an unknown quantum state) [38,56,77], quantum cryptography (secure quantum key exchange) [9,25] and quantum teleportation [15].Along this line, measurements corresponding to MUBs are appropriate for an optimal determination of the density matrix of a quantum system and the use of MUBs ensure the maximum of security for quantum communication (especially in the BB84 quantum cryptography protocol).Let us also mention that MUBs are connected with the notion of maximal entanglement of quantum states a result of great importance for quantum computing.
Here, it is not our purpose to give some details about all the applications listed above.The interested reader may consult the quoted original references for a full description of each application.It is enough to say that a central common point to all the applications is given by Equation ( 15) that reflects the uniform probability nature of the results of measurements using MUBs.This is especially obvious in the BB84 protocol where the probability of detection of Eve (a spy) on a quantum communication channel between Alice and Bob is maximum when Alice and Bob use MUBs.

Definition of MUBs
Definition 1.Let B a and B b two distinct orthonormal bases where | denotes the inner product of C d [5,6,10,11].In other words, the inner product aα|bβ has a modulus independent of α and β.The relation makes it possible to describe both the cases B a = B b and B a = B b .
As a typical example, the bases B 0 , B 1 and B 2 of C 2 , see Equation ( 5), constitute a set of three MUBS whose basis vectors are specific qubits.

Well-Known Results about MUBs
The main results concerning MUBs are [6,14,19,35,37 By way of illustration, let us mention the following cases.

•
In the particular composite case d = 6 = 2 × 3, we have and it was conjectured that N(6) = 3.Indeed, in spite of an enormous amount of computational works, no more than three MUBs were found for d = 6.

•
For d = 676 = 2 2 × 13 2 , we have but it is known how to construct at least six MUBs.
A set of d + 1 MUBs in C d is referred to as a complete set.Such sets exist for d = p m (p prime, m positive integer) and this result opens the way to establish a link between MUBs and Galois fields and/or Galois rings.
For d composite (different from a power of a prime), the question to know if there exist complete sets in dimension d, i.e., to know if N(d) can be equal to d + 1, is still an open problem (in 2018).Indeed, for d different from a power of a prime, it was conjectured (SPR conjecture [32]) that the problem of the existence of a set of d + 1 MUBs in C d is equivalent to the problem of whether there exist a projective plane of order d.As another conjecture for d composite (different from a power of a prime), the problem of the existence of a set of d + 1 MUBs in C d is equivalent to the one of the existence of a decomposition of the Lie algebra of SU(d) into d + 1 Cartan subalgebras of dimension d − 1.

Interests of MUBs
MUBs are or relevance in advanced quantum mechanics.From a very general point of view, MUBs are closely connected to the principle of complementarity introduced by Bohr in the early days of quantum mechanics.This principle, quite familiar in terms of observables like position and momentum, tells that for two non-commuting observables, if we have a complete knowledge of one observable, then we have a total uncertainty of the other.Equation (14) indicates that the development in the basis B a of any vector of the basis B b is such that each vector of B a appears in the development with the probability 1  d .This is especially interesting when translated in terms of measurements, the bases B a and B b corresponding to the (non-degenerate) eigenvectors of two non-commuting observables.
A significance of MUBs in terms of quantum measurements can be seen as follows.Let A and B be two non-degenerate (i.e., with multiplicity-free eigenvalues) self-adjoint (or hermitian) operators associated with two observables A and B of a quantum system with the Hilbert space C d of dimension d.Suppose that the eigenvectors of A and B yield two unbiased bases B a and B b , respectively.When the quantum system is prepared in an eigenvector |bβ of the observable B, no information can be obtained from a measurement of the observable A. This result follows from the development in the basis B a of any vector of the basis B b of obtaining any state vector |aα in a measurement of A are equal.Indeed, the two operators A and B do not commute.The two corresponding observables A and B are said to be complementary (Bohr's principle of complementarity introduced in the early days of quantum mechanics): a precise knowledge of one of them implies a total uncertainty of the other (or, all possible results of measurements of the other one are equally probable).This can be made more explicit through the generalized Heisenberg uncertainty principle.Let A and B be two hermitian operators associated with two observables and |ψ a vector of C d .The generalized Heisenberg uncertainty principle can be expressed as h so that more precise is ∆x more imprecise is ∆p x and vice versa.)Therefore, if A and B correspond to observables generating MUBs, then a precise knowledge of A yields a complete indeterminacy of B and vice versa.
Note that is the number of different measurements to fully determine a quantum state for a quantum system in dimension d. (This follows from the fact that a d × d density matrix, that is to say an Hermitian matrix with a trace equal to 1, contains d 2 − 1 real parameters and each measurement gives d − 1 real parameters.)Note also that d 2 − 1 and d − 1 are the number of generators and the rank of the special unitary group SU(d) in d dimensions, respectively, and that for d = p (prime number) their ratio p + 1 is the number of disjoint sets of p − 1 commuting generators of SU(p).The rest of the paper is structured in the following way.In Section 3.2, we give a complete solution, based on a nonstandard approach to the Lie algebra of the group SU(2) (equivalently, to the quantum theory of angular momentum), for the construction of MUBs in the case where d = p is a prime number.Further developments are discussed in Section 3.3 in relation with Weyl pairs.Sections 3.4 and 3.5 are concerned with the construction of MUBs from Galois fields (for d = p m , a power of an odd prime number) and Galois rings (for d = 2 m , a power of the even prime number), respectively.(See Refs.[31,46,48] for the formalism of Galois quantum systems.)

Standard Basis for SU(2)
Equation (7) shows that the vectors |n (with n = 0, 1, • • • , d − 1) of the computational basis (6) can be viewed as the basis vectors |j, m (with m = j, j − 1, • • • , −j) for the irreducible representation (j) of SU(2) in the chain SU(2) ⊃ U(1).In the language of group theory (and quantum angular momentum theory), the vector |j, m is a common eigenvector of the Casimir operator J 2 (the square of an angular momentum) and of a Cartan generator J z (the z component of the angular momentum) of the Lie algebra A 1 of the group SU(2).More precisely, we have the eigenvalue equations In other words, the computational basis B d can be visualized as the basis known as the standard basis for the irreducible representation (j) of SU (2) or the angular momentum basis corresponding to the angular momentum quantum number j, referred to as spin angular momentum for j = 1 2 .

Nonstandard Bases for SU(2)
As far as the representation theory of SU( 2) is concerned, we can replace the complete set {J 2 , J z } by another complete set of two commuting operators.For instance, we may consider the set {J 2 , v a }, where the unitary operator v a is defined by 2j+1 is a primitive (2j + 1)-th root of unity and a is a fixed parameter in the ring Z 2j+1 .The operator v a takes its origin in a polar decomposition of the two generators E ± = J ± of the group SU(2).For fixed a, the common eigenvectors of J 2 and v a provide an alternative basis to that given by the common eigenstates of J 2 and J z .This can be made precise by the following result.Proposition 1.For fixed j and a (with 2j ∈ N * and a ∈ Z 2j+1 ), the 2j + 1 common eigenvectors of J 2 and v a can be taken in the form The corresponding eigenvalues of v a are given by v a |jα; a = ω ja−α |jα; a Then, the spectrum of v a is non-degenerate.

Bases in Quantum Information
We now go back to quantum information.By introducing |aα = |jα; a together with the change of notations (7), the eigenvectors of v a can be written as where ω = e i 2π d .The vector |aα satisfies the eigenvalue equation The operator v a can be represented by a d-dimensional unitary matrix V a .The matrix V a , built on the basis B d with the ordering 0, 1, • • • , d − 1 for the lines and columns, reads The eigenvectors of V a are The vectors φ(aα) satisfy the eigenvalue equation with the orthonormality relation The matrix V a can be diagonalized by means of the d-dimensional matrix H a of elements with the lines and columns of H a arranged from left to right and from top to bottom in the order n, α = 0, 1, • • • , d − 1.Indeed, by introducing the d × d permutation matrix from which we recover the eigenvalues of V a .Note that the complex matrix H a is a unitary matrix for which each entry has a modulus equal to 1 √ d . Thus, H a is a generalized Hadamard matrix.This establishes a connection between MUBs and Hadamard matrices [35,51,52,60,64,66,73].

MUBs for d = p (p Prime)
Going back to the case where d is arbitrary, we now examine an important property for the couple (B a , B d ) and its generalization to couples (B a , B b ) with b = a (a, b = 0, 1, • • • , d − 1).For fixed d and a, we verify that  Proof.First, the computational basis B p is clearly unbiased to any of the p bases B 0 , Second, let us consider for b = a.The inner product aα|bβ can be rewritten by making use of the generalized quadratic Gauss sum [18] S(u, v, w) where u, v and w are integers such that u and w are co-prime, uw is non-vanishing and uw + v is even.This leads to This completes the proof.
In many of the papers dealing with the construction of MUBs for d = p a prime number or d = p m a power of a prime number, the explicit derivation of the bases requires the diagonalization of a set of matrices.Equation ( 16) arises from the diagonalization of a single matrix.It allows to derive in one step the p(p + 1) vectors (or qupits, i.e., qudits with d = p) of a complete set of p + 1 MUBs in C p via a single formula easily encodable on a classical computer.
Note that, for d arbitrary, the inner product aα|bβ can be rewritten as in terms of the generalized Hadamard matrices H a and H b .In the case where d = p is a prime number, we find that Therefore, the product H a † H b is another generalized Hadamard matrix [64].
Finally note that the passage, given by Equation ( 16), from the computational basis B p = {|n : n = 0, 1, • • • , p − 1} to the the basis B 0 = {|0α : α = 0, 1, • • • , p − 1} corresponds to a discrete Fourier transform.Similarly, the passage from the basis B p to the the basis B a = {|aα Example 3. d = 2.In this case, relevant for a spin j = 1 2 or for a qubit, we have ω = e iπ and a, α ∈ F 2 .The matrices of the operators v a are The d + 1 = 3 MUBs B 0 , B 1 and B 2 are the following: to be compared with Equation ( 5).
Example 4. d = 3.This case corresponds to an angular momentum j = 1 or to a qutrit.Here, we have ω = e i 2π 3 and a, α ∈ F 3 .The matrices of the operators v a are The d + 1 = 4 MUBs B 0 , B 1 , B 2 and B 3 are the following: This can be transcribed in terms of column vectors as follows: To close this section, note that it is not necessary to treat separately the cases p odd and p even: Equation ( 16) for |aα is valid both for p even prime (p = 2) and for p odd prime.In the case where p is odd, there exists a useful alternative formula to Equation ( 16) as shown in the next section.provides an alternative to Equation ( 16).Indeed, it can be shown that where a can take any of the values 0, 1, • • • , p − 1 constitutes an orthonormal basis of C d and that the p bases B a (a = 0, 1, • • • , p − 1) form, with the computational basis B p , a complete set of p + 1 MUBs.The proof, based on the properties of Gauss sums, is analogous to that given in Section 3.2.4.It is to be emphasized that for p even prime (p = 2) the bases B 0 , B 1 and B 2 do not form a complete set of MUBs while the proposition given in Section 3.2.4 is valid for p odd prime and equally well for p even prime.The interest of Equation ( 17) is that it can be easily extended in the case where F p is replaced by the Galois field GF(p m ) with m > 1.

MUBs for d Power of a Prime
We may ask what becomes the proposition in Section 3.2.4 when the prime number p is replaced by an arbitrary (not prime) number d.In this case, Equation ( 16), with p replaced by d, does not provide a complete set of d + 1 MUBs.However, it is easy to verify that the bases B 0 , B 1 and B d are three MUBs in C d , in agreement with the well-known result according to which the number of MUBs in C d , with d arbitrary, is greater than or equal to 3.
Equation (16) for C p can be used for deriving a complete set of p m + 1 MUBs in C p m (p prime and m ≥ 2) by tensor products of order m of vectors in C p .The general case is very much involved.Hence, we shall limit ourselves to the case d = 2 2 .
The case d = 4 corresponds to the spin angular momentum j = 3 2 .The four bases B a for a = 0, 1, 2, 3 consisting of the vectors |aα calculated for d = 4 from Section 3.2.3 and the computational basis B 4 do not constitute a complete set of d + 1 = 5 MUBs.Nevertheless, it is possible to find d + 1 = 5 MUBs because d = 2 2 is the power of a prime number.Indeed, another way to deal with the search for MUBs in C 4 is to consider two systems of qubits associated with the spin angular momenta Then, bases of C 4 can be constructed from tensor products |aα ⊗ |bβ which are eigenvectors of the operator v a ⊗ v b , where v a corresponds to the first system of qubits and v b to the second one.Obviously, the set A similar result holds for the two bases B 01 and B 10 .However, the four bases B 00 , B 11 , B 01 and B 10 are not mutually unbiased.A possible way to overcome this no-go result is to keep the bases B 00 and B 11 intact and to re-organize the vectors inside the bases B 01 and B 10 in order to obtain four MUBs.We are thus left with the four bases W 00 ≡ B 00 , W 11 ≡ B 11 , W 01 , W 10 which together with the computational basis B 4 give five MUBs.In detail, we have where the addition ⊕ should be understood modulo 4; furthermore and the vectors of type |aα are given by Equation ( 16).As a résumé, only two formulas are necessary for obtaining the d 2 = 16 vectors |ab; αβ for the bases W ab , namely A simple development of W 00 , W 11 , W 01 and W 10 gives the following expressions.
The W 00 basis: The W 11 basis: The W 01 basis: The W 10 basis: The computational basis: It is to be noted that the vectors of the bases W 00 and W 11 are not entangled (i.e., each vector is the tensor product of two vectors) while the vectors of the bases W 01 and W 10 are entangled (i.e., each vector is not the tensor product of two vectors).In fact, all the state vectors for W 01 and W 10 are maximally entangled (the entanglement entropy is maximum for W 01 and W 10 and vanishes for W 00 and W 11 ).
Generalization of the formulas given above for two systems of qubits can be obtained in more complicated situations (two systems of qupits, three systems of qubits, etc.).The generalization of the bases W 00 and W 11 is immediate.The generalization of W 01 and W 10 can be achieved by taking linear combinations of vectors such that each linear combination is made of vectors corresponding to the same eigenvalue of the relevant tensor product of operators of type v a .

Shift and Phase Operators
Let us go back to the case d arbitrary.The matrix V a can be decomposed as The matrices X and Z satisfy The linear operators corresponding to the matrices X and Z are known in quantum information as flip or shift and clock or phase operators, respectively.The unitary matrices X and Z ω-commute in the sense that In addition, they satisfy where I d and O d are the d-dimensional unity and zero matrices, respectively.The last two equations show that X and Z constitute a so-called Weyl pair [3].
Note that the Weyl pair (X, Z) can be deduced from the master matrix V a via which shows a further interest of the matrix V a .Indeed, the matrix V a condensates all that can be done with the matrices X and Z.This has been seen in Section 3.2.4 with the derivation of a single formula for the determination from V a of a complete set of p + 1 MUBs when d = p is prime whereas many other determinations of such a complete set needs repeated use of the matrices X and Z.
A connection between X and Z can be deduced from the expression of (H a P) † V a (H a P) given in Section 3.2.3.By taking a = 0, we obtain where H 0 is the matrix of a discrete Fourier transform that allows to pass from the vectors cf. the expression of φ(a, α) in Section 3.2.3.

Generalized Pauli Matrices
For d arbitrary, let us define the matrices The matrices U ab belong to the unitary group U(d).The so that the matrices X and Z generate the ordinary Pauli matrices.Indeed, we have in terms of the usual (Hermitian and unitary) Pauli matrices.
Example 6.The case d = 3 ⇔ j = 1 (⇒ ω = e i 2π 3 and a, b = 0, 1, 2) yields nine three-dimensional matrices.More precisely, the matrices X and Z generate In the detail, the matrices X a Z b are They constitute a natural extension in dimension d = 3 of the usual Pauli matrices.

Weyl Pair and Groups
For arbitrary d, the Weyl pair The matrices V abc are unitary and satisfy In addition, we have the following result.Moreover, the Pauli group is connected to the Heisenberg-Weyl group.In fact, the group P d corresponds to a discretization of the Heisenberg-Weyl group HW(R).From an abstract point of view, the group HW(R) is the set S = {(x, y, z) : x, y, z ∈ R} equipped with the internal law S × S → S defined via (x, y, z)(x , y , z ) = (x + x − zy , y + y , z + z ) This group is a non-commutative Lie group of order 3.It is non-compact and nilpotent with a nilpotency class equal to 3. The passage from HW(R) to P d amounts to replace the infinite field R by the finite ring Z d so that HW(R) gives HW(Z d ) ≡ P d .
The three generators of HW(R) are They satisfy the commutation relations Therefore, the Lie algebra hw(R) of HW(R) is a three-dimensional nilpotent Lie algebra with nilpotency class equal to 3. The commutation relations of Q, P and H are reminiscent of the Heisenberg commutation relations.As a matter of fact, the Heisenberg commutation relations correspond to an infinite-dimensional irreducible representation by Hermitian matrices of hw(R).The Lie algebra hw(R) also admits finite-dimensional irreducible representations at the price to abandon the Hermitian character of the representation matrices.
The linear group.The Weyl pair consisting of the generalized Pauli matrices X and Z in d dimensions can be used for constructing a basis of the Lie algebra of U(d).More precisely, we have the two following propositions.
where each of the p + 1 subalgebras V 0 , V 1 , • • • , V p is a Cartan subalgebra generated by a set of p − 1 commuting matrices.
A similar result holds for d = p m , a power of a prime number [7,12,16,53,64].The decomposition of sl(p, C), called orthogonal decomposition of sl(p, C), is trivial for p = 2.In fact, for p = 2 we have the following decomposition su(2) = σ 1 ⊕ σ 2 ⊕ σ 3 in terms of vector space sum.

MUBs and the Special Linear Group
According to the orthogonal decomposition proposition, in the case where d = p is a prime number (even or odd), the set {X a Z b : a, b ∈ Z p } \ {X 0 Z 0 } of cardinality p 2 − 1 can be partitioned into p + 1 subsets containing each p − 1 commuting matrices.
As an example, let us consider the case d = 5.For this case, we are left with the six following sets of four commuting matrices where ab is used as an abbreviation of X a Z b .
More generally, for d = p with p prime, the p + 1 sets of p − 1 commuting matrices are easily seen to be be put in a one-to-one correspondence with one basis of the complete set of p + 1 MUBs.In fact, V 0 is associated with the computational basis while V 1 , V 2 , • • • , V p are associated with the p remaining MUBs in view of The eigenvectors of the p + 1 unitary operators Z, X, XZ, • • • , XZ p−1 generate p + 1 MUBs (one basis is associated with each of the p + 1 operators).

Galois Field Approach to MUBs
The existence of a complete set of p m + 1 MUBS in C p m (p prime and m positive integer) is an indication of a possible utility of Galois fields and Galois rings for the construction of MUBs in C p m (p prime, m ≥ 2).Indeed, the passage from the case d = p to the case d = p m (p prime, m ≥ 2) can be achieved by considering the Galois field GF(p m ) for p odd prime and the Galois ring GR(2 2 , m) for p = 2 [2,28].In this section, we shall deal with the construction of a complete set of p m + 1 MUBs in C p m , corresponding to the case of m qupits, via the use of the Galois field GF(p m ) for p odd prime and m greater than 1.

The Computational Basis
We first have to define the computational basis B p m in the framework of GF(p m ), p odd prime and m ≥ 2. The vectors of the basis B p m of the Hilbert space C p m can be labeled by the elements x of the Galois field GF(p m ).This can be done in two ways according to as the elements x are taken in the monomial form ( In both cases, we have in terms of vectors or column vectors.More precisely, this can be achieved as follows.

•
In the monomial form, we define the vectors of B p m via the correspondences where α is a primitive element of GF(p m ).

•
In the polynomial form, we can range the vectors of B p m in the order 0, 1, • • • , p m − 1 by adopting the lexicographical order for the elements These notations are reminiscent of those employed for the computational basis corresponding to the limit case m = 1.

Shift and Phase Operators for GF(p m )
The notion of Weyl pair can be extended to any Galois field GF(p m ) with p (even or odd) prime and m ≥ 2. Let x and y be two elements of GF(p m ) and φ y be the basis column vector of B p m associated with y.For fixed x, we define the matrices Xx (shift operators) and Ẑx (phase operators) via the actions Xx φ y = φ y−x , Ẑx φ y = χ(xy)φ y = e We might use the Weyl pair (X x , Z y ) defined in the framework of GF(p m ), see Section 3.4.2,for determining a complete set of p m + 1 MUBs in C p m in a way similar to that used for m = 1 with the help of the matrix V a for a in F p .However, it is quicker to start from Equation (17) giving MUBs in C p in order to generate a formula for C p m giving back Equation ( 17) in C p in the limit case m = 1.In this direction, a possible way to pass from the basis vector Proof.See the proof of the next proposition.
Note that for m = 1 Tr(ax 2 + αx) = ax 2 + αx so that the vector |aα coincides with the vector |aα derived in Section 3.2.5.This explains why we chose to extend Equation ( 17) valid for C p to the case C p m .Indeed, the same kind of extension applied to Equation ( 16) is not possible since Tr[ 1 2 n(p − n)a + nα] does not make sense.
which shows that B a is an orthonormal basis and that the couple (B a , B b ) with b = a is a couple of unbiased bases.Of course, each basis B a is unbiased to the computational basis B p m .We thus end up with a total of p m + 1 MUBs as desired.
The previous result applies in the limit case m = 1 for which we recover the p + 1 MUBs in C p .

Galois Ring Approach to MUBs
In dimension d = 2 m , m ≥ 2, the use of the Galois field GF(2 m ) for constructing a complete set of 2 m + 1 MUBs in C 2 m according to the method employed in Section 3.4 for d = p m , p odd prime, would lead to a no-win situation because gcd(2, 2 m ) = 1 (while gcd(2, p m ) = 1 for p odd prime).For d = 2 m , which corresponds to the case of m qubits, we can use the Galois ring GR(2 2 , m), denoted R 4 m too, for constructing MUBs in C 2 m .
where χ is an additive character vector of GR(2 2 , m) and the trace takes its values in Z 4 .For fixed a in T m , the set B a = {|aα : α ∈ T m } constitutes an orthonormal basis of C 2 m .
Proof.See the proof of the next proposition.Note that for m = 1 Tr(ax to be compared with the vector given by Equation (16).In view of the fact that i ax+2αx = i ax(2−x)+2αx for x = 0 and x = 1, the two vectors |aα in Equations ( 18) and ( 19) are the same up to an interchange of the vectors |0 and |1 .
which shows that B a is an orthonormal basis and that the couple (B a , B b ) with b = a is a couple of unbiased bases.Of course, each basis B a is unbiased to the computational basis B 2 m .We thus end up with a total of 2 m + 1 MUBs and we are done.
The previous result applies in the limit case m = 1 for which we can recover the 2 + 1 MUBs in C 2 .

One-Qubit System
For m = 1, the 2 m = 2 vectors of the computational basis B 2 are labeled with the help of the two elements of the Teichmüller set T 1 = Z 2 of the Galois ring GR(2 2 , 1) = Z 2 2 .Thus, the basis B 2 is The vectors |aα of the basis B a (a ∈ T 1 ) are given by (see Section 3.5.1) This yields the two unbiased bases which, together with the computational basis B 2 , form a complete set of 2 + 1 = 3 MUBs in C 2 .Note that the bases B 0 and B 1 are in agreement (up to phase factors and a rearrangement of the vectors inside B 1 ) with the bases B 0 and B 1 derived in Section 3.2.4.

Closing Remarks
During the last two decades, quantum information and quantum computing have been the object of considerable progresses both in theoretical and experimental physical sciences, scientific engineering, discrete mathematics and quantum informatics.In the present days, there exit several quantum computer languages and, although quantum devices are mainly developed in academic and private laboratories, the scientific community has access to some quantum computers (e.g., access to the 5-qubit quantum computer of the IBM Quantum Experience [79]) and to quantum simulators (e.g., access to the 41-qubit ATOS Quantum Learning Machine [80]).In the medium term, the accent shall be put, among others, on (i) the development of new quantum algorithms that outperform classical ones, (ii) the production of qubits robust to decoherence (with coherence time greater than 500 ms), (iii) the increase of the lifetime of quantum memories, (iv) the development of quantum networks working over a few thousands of kilometres (v) the realization of 50-100 qubit computers, and (vi) the test of quantum supremacy.There is a long way before the realization of a universal quantum computer!From the side of the mathematical aspects of MUBs, some further developments and a few open problems should be mentioned.It would be interesting to see if Cayley-Dickson algebras of dimension d = 2 N could be used for providing a geometrical approach to entanglement of N qubits with N > 3. Furthermore, the problem of the determination of the maximum number N(d) of MUBs in composite dimension d is still an unsolved problem (except in the case where d is a power of a prime number).The two conjectures listed in Section 3.1.3do not very much help, probably because they lead to two equivalent problems for which the solutions are as difficult to find as those of the initial problem.As far as the second conjecture is concerned, the recent work [76] on orthogonal decompositions of sl(n, R) over a finite commutative ring with identity R is very appealing.Finally, even in the simplest case where d = 6, the maximum number N(6) of MUBs is not known (to the best of the author knowledge).However, for d = 6 there are numerous numerical evidences that N(6) = 3 [19,37,52,54,59,60,70,71].The number N(6) = 3 is equal indeed to the number of weak mutually unbiased bases associated with the smallest prime divisor of 6 (the recently introduced notion of weak MUBs in dimension d corresponds to the Definition (14) where √ d is replaced by f where f is a prime divisor of d [69,75]).
of the Hilbert space C d .The bases B a and B b (a = b) are said to be unbiased if and only if where [A, B] − = AB − BA and ∆O stands for the standard deviation ∆O = ψ|O 2 |ψ − ψ|O|ψ 2 of the operator O = A or B. (The most familiar example is for d infinite.The position A = x and the momentum B = p x , along the x direction, of a particle are complementary observables.They satisfy the commutation relations [x, p x ] − = ih, where h is the Planck constant.Hence, ∆x∆p x ≥ 1 2
B a and B d are two unbiased bases of the Hilbert space C d .Other examples of unbiased bases can be obtained for d = 2 and 3. We easily check that the bases B 0 and B 1 for d = 2 are unbiased.Similarly, the bases B 0 , B 1 and B 2 for d = 3 are mutually unbiased.Therefore, by taking into account the computational basis B d , we end up with d + 1 = 3 MUBs for d = 2 and d + 1 = 4 MUBs for d = 3.This is in agreement with the general result according to which, in dimension d, the maximum number d + 1 of MUBs is attained when d is a prime number or a power of a prime number.The results for d = 2 and 3 can be generalized through the following proposition.

3. 2 . 5 . 1 √
MUBs for d = p (p Odd Prime) In the special case where d = p is an odd prime number, the formula |aα = is an orthonormal basis of C 4 .Four of the five MUBs for d = 2 2 = 4 can be constructed from the various bases B ab .It is evident that B 00 and B 11 are two unbiased bases since the modulus of the inner product of |1α ⊗ |1β by |0α ⊗ |0β is

Example 5 .
d 2 matrices U ab are called generalized Pauli matrices in dimension d.They satisfy the trace relation tr U ab † U a b = d δ a,a δ b,b Thus, the set {U ab : a, b ∈ Z d } of unitary matrices is an orthogonal set with respect to the Hilbert-Schmidt inner product.Consequently, the d 2 pairwise orthogonal matrices U ab can be used as a basis of C d×d .The case d = 2 ⇔ j = 1 2 (⇒ ω = e iπ and a, b = 0, 1) corresponds to the two-dimensional ordinary Pauli matrices of quantum mechanics.The matrices X a Z b are is a basic ingredient for generating the Pauli group P d in d dimensions and the Lie algebra of the linear group GL(d, C) in d dimensions, groups of central interest in group theory, quantum mechanics and quantum information.The Pauli group.For arbitrary d, let us define the matrices

Proposition 3 .
The set {V abc : a, b, c ∈ Z d } is a finite group of order d 3 , denoted P d , for the internal law (matrix multiplication)V abc V a b c = V a b c , a = a + a − cb , b = b + b , c = c + cIt is a non-commutative (for d ≥ 2) nilpotent group with nilpotency class equal to 3. The group P d is called the Pauli group in dimension d.It is of considerable importance in quantum information, especially for quantum computation and for quantum error-correcting codes.The group P d is a sub-group of the unitary group U(d).The normalizer of P d in U(d) is called Clifford group (denoted as C d ) in d dimensions.More precisely, C d is the set {U ∈ U(d) : UP d U † = P d } endowed with matrix multiplication.The Pauli group P d as well as any other invariant sub-group of C d are useful for quantum error-correcting codes in the case of N-qubit systems corresponding to d = 2 N .

Proposition 4 .Proposition 5 .
For arbitrary d, the set {X a Z b : a, b ∈ Z d } forms a basis for the Lie algebra gl(d, C) of the linear group GL(d, C) or for the Lie algebra u(d) of the unitary group U(d).The Lie brackets of gl(d, C) in such a basis are [X a Z b , X e Z f ] − = ∑ i∈Z d ∑ j∈Z d (ab, e f ; ij)X i Z j with the structure constants (ab, e f ; ij) = δ i,a+e δ j,b+ f ω −be − ω −a f where a, b, e, f , i, j ∈ Z d .Note that the commutator [U ab , U e f ] − = U ab U e f − U e f U ab and the anti-commutator [U ab , U e f ] + = U ab U e f + U e f U ab of U ab and U e f are given by[U ab , U e f ] ± = ω −be ± ω −a f U ij , i = a + e, j = b + f Consequently, [U ab , U e f ] − = 0 if and only if a f − be = 0 (mod d) and [U ab , U e f ] + = 0 if and only if a f − be = 1 2 d (mod d).Therefore, all anti-commutators [U ab , U e f ] + are different from 0 if d is an odd integer.For d = p, with p a prime number, the simple Lie algebra sl(p, C) of the special linear group SL(p, C) or its compact real form su(d) of the special unitary group SU(d) can be decomposed into a sum of p + 1 Abelian subalgebras of dimension p − 1 sl i 2π p Tr(xy) φ y where y is arbitrary.One easily verifies the properties Xx+y = Xx Xy = Xy Xx , Ẑx+y = Ẑx Ẑy = Ẑy Ẑx and Xx Ẑy − χ(xy) Ẑy Xx = O p m , χ(xy) = e i 2π p Tr(xy) In the limit case m = 1 (i.e., for the base field F p ) the matrices X = X1 , Z = Ẑ1 corresponding to x = y = 1 satisfy XZ − e i 2π p ZX = O p to be compared with the relations satisfied by the Weyl pair (X, Z) defined in Section 3.3.1.3.4.3.Bases in the Frame of GF(p m )

pProposition 6 .p
(ax+α)x |x of C p to a basis vector of C p m is to replacee i 2π p (ax+α)x , a, α, x ∈ F p by χ(ax 2 + αx) = e i 2π p Tr(ax 2 +αx) , a, α, x ∈ GF(p m )where χ is the canonical additive character of GF(p m ).This yields the two following propositions.For p odd prime and m ≥ 2, the setB a = {|aα : α ∈ GF(p m )} Tr(ax 2 +αx) |x , a ∈ GF(p m )constitutes an orthonormal basis of C p m .

3. 4 . 4 .Proposition 7 .pp
MUBs in the Frame of GF(p m ) For p odd prime and m ≥ 2, the p m bases B a , a ranging in GF(p m ), constitute with the computational basis B p m a complete set of p m + 1 MUBs in C p m .Proof.Let |aα and |bβ two vectors belonging to the bases B a and B b , respectively.We have Tr[(b−a)x 2 +(β−α)x] , a, b, α, β ∈ GF(p m ) Tr(ux 2 +vx) = p m , u ∈ GF(p m ) * , v ∈ GF(p m ) (valid for p odd prime), we obtain

3. 5 . 1 .Proposition 8 .
Bases in the Frame of GR(2 2 , m) We start with the residue class ring GR(2 2 , m) = Z 2 2 [ξ]/ P m (ξ)where P m (x) is a monic basic irreducible polynomial of degree m (i.e., its restriction P m (x) = P m (x) modulo 2 is irreducible over Z 2 ).The 2 m vectors of the computational basis B 2 m are labeled by the 2 m elements of the Teichmüller set T m associated with the ring Z 2 2 [ξ]/ P m (ξ) .ThusB 2 m = {|x : x ∈ T m }(the set T m and the ring GR(2 2 , m) contain 2 m and 4 m elements, respectively).For a and α in T m , let

3. 5 . 2 .Proposition 9 .2 m if u = 0 √ 2
MUBs in the Frame of GR(2 2 , m) The 2 m bases B a , with m ≥ 2 and a ranging in the Teichüller set T m associated with the Galois ring GR(2 2 , m), constitute with the computational basis B 2 m a complete set of2 m + 1 MUBs in C 2 m .Proof.Let |aα and |bβ two vectors belonging to the bases B a and B b , respectively.We have u ∈ 2T m , u = 0

Table 1 .
Correspondence between qubits |ψ = cos θ 2 |0 + e iϕ sin θ 2 |1 and points (ξ qubits 1 and 2 by Alice can give |0 1 ⊗ |0 2 with the probability 1 4 , |0 1 ⊗ |1 2 with the probability 1 4|1 1 ⊗ |0 2 with the probability14 , |1 1 ⊗ |1 2 with the probability1   4Suppose Alice gets |0 1 ⊗ |0 2 .Then, she communicates this result to Bob by a classical channel (telephone or mail).Thus, Bob knows that |ψ is a|0 3 When d is a composite number, N(d) is not known but it can be shown that3 ≤ N(d) ≤ d + 1As a more accurate result, for d = ∏ i p m i i with p i prime and m i positive integer, we have d cannot exceed d + 1.Thus N(d) ≤ d + 1 3.The maximum number d + 1 of MUBs is attained when d is a power p m (m ≥ 1) of a prime number p. Thus N(p m ) = p m + 1 4.