A new method of construction of all sets of mutually unbiased bases for two-qubit systems
arXiv:1312.2517 · doi:10.1088/1742-6596/338/1/012008
Abstract
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.
References in corpus (8)
- A new proof for the existence of mutually unbiased bases
- Quantum cryptography with 3-state systems
- Discrete phase space based on finite fields
- On the structure of the sets of mutually unbiased bases for N qubits
- Qubits in phase space: Wigner function approach to quantum error correction and the mean king problem
- Wigner-function description of quantum teleportation in arbitrary dimensions and continuous limit
- Optimal quantum state reconstruction for cold trapped ions
- Discrete phase-space structure of -qubit mutually unbiased bases