Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois field GF(4) and show that the solutions of this system are sufficient for obtaining the most general set of mutually unbiased bases. Further, our algorithm is applied to an example and we show that there are three possible solutions of the system of four equations, each solution leading to a different set of mutually unbiased bases.
For a system of
N qubits, living in a Hilbert space of dimension
d=2N, it is known that there exists
d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases with different properties as far as separability is concerned. Here we derive four sets of nine bases for three qubits, and show how they are unitarily related. We also briefly discuss the four-qubit case, give the entanglement structure of 16 sets of bases, and show some of them and their interrelations, as examples. The extension of the method to the general case of
N qubits is outlined.
We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase parametrization, we derive explicit analytical conditions for mutual unbiasedness in dimension 4, providing a tractable system of trigonometric constraints on the phase parameters. We then explore a tensor-product construction via Pauli operators, highlighting the algebraic and group-theoretical origin of MUBs in two-qubit systems, and demonstrating how these constructions yield a complete set of 5 MUBs in dimension 4. Extending our approach, we investigate the Fourier-family method in dimension 6, where the absence of a prime-power structure imposes strong rigidity constraints and limits the known constructions to sets of 3 MUBs. We provide a systematic computational framework for testing candidate phase vectors, bridging the gap between analytical insight and numerical exploration. Finally, we generalize the discussion to arbitrary prime-power dimensions, emphasizing the role of finite-field structures, Heisenberg-Weyl operators, and discrete symmetries in generating complete sets of MUBs. Our work offers a transparent, line-by-line verification methodology, highlighting both the geometric and algebraic richness of MUBs, and clarifying why certain dimensions resist full analytical constructions. This study serves as a comprehensive resource for researchers seeking both theoretical understanding and practical construction of MUBs in quantum information science.
It is known that there exists 2N+ 1 mutually unbiased bases for N qubits system. Between the different MUB construction algorithms of the three-qubit case, we focus on Wootters method with discrete phase space that leads naturally to a complete set of 2N+ 1 mutually unbiased bases for the state space. We construct discrete Wigner function using mutually unbiased bases from the discrete phase space for three-qubit system by explicitly calculating the Wigner functions for exemplary three-qubit pure states such as the GHZ state, the W state and the embedded Bell state. We also highlight some quasi-probability characteristics of these entangled states.
We propose a unifying phase-space approach to the construction of mutually unbiased bases for a two-qubit system. It is based on an explicit classification of the geometrical structures compatible with the notion of unbiasedness. These consist of bundles of discrete curves intersecting only at the origin and satisfying certain additional properties. We also consider the feasible transformations between different kinds of curves and show that they correspond to local rotations around the Bloch-sphere principal axes. We suggest how to generalize the method to systems in dimensions that are powers of a prime.
Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing
2n+1 MUB circuits provides a minimal and optimal measurement strategy for reconstructing all
n-qubit unknown states. It significantly reduces the number of measurements compared to the traditional
4n Pauli observables, also enhancing the robustness of quantum key distribution (QKD) protocols. Previous circuit designs that rely on a single generator can result in exponential gate costs for some MUB circuits. In this work, we present an efficient algorithm to generate each of the
2n+1 quantum MUB circuits on
n-qubit systems within
O(n3) time. The algorithm features a three-stage structure, and we have calculated the average number of different gates for random sampling. Additionally, we have identified two linear properties: the entanglement part can be directly defined into
2n−3 fixed sub-parts, and the knowledge of
n special MUB circuits is sufficient to construct all
2n+1 MUB circuits. This new efficient and simple circuit construction paves the way for the implementation of a complete set of MUBs in diverse quantum information processing tasks on high-dimensional quantum systems.