Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1302.3709 · Quantum Information and Computation

Unextendible mutually unbiased bases from Pauli C\classes

Prabha Mandayam, Somshubhro Bandyopadhyay, Markus Grassl, William K. Wootters

Published Jul 1, 2014• 18 citations
arXivHTMLPDF

Abstract

We provide a construction of sets of $d/2+1$ mutually unbiased bases (MUBs) in dimensions $d=4,8$ using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the Pauli group. Moreover, specific examples of sets of MUBs obtained using our construction are shown to be {\it strongly unextendible}; that is, there does not exist another vector that is unbiased with respect to the elements in the set. We conjecture the existence of such unextendible sets in higher dimensions $d=2^{n} (n>3) $ as well.} {Furthermore, we note an interesting connection between these unextendible sets and state-independent proofs of the Kochen-Specker Theorem for two-qubit systems. Our construction also leads to a proof of the tightness of a $H_{2}$ entropic uncertainty relation for any set of three MUBs constructed from Pauli classes in $d=4$.

DOI
10.26421/qic14.9-10-8

Related papers

Unextendible mutually unbiased bases in prime-squared dimensions

Vishakh Hegde, Prabha Mandayam

A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions ($d=p^{2}$) that cannot be extended to a complete set using the generalized Pauli operators. We further observe an interesting connection between the existence of unextendible sets and the tightness of entropic uncertainty relations (EURs) in these dimensions. In particular, we show that our construction of unextendible sets of MUBs naturally leads to sets of $p+1$ MUBs that saturate both a Shannon ($H_{1}$) and a collision ($H_{2}$) entropic lower bound. Such an identification of smaller sets of MUBs satisfying tight EURs is crucial for cryptographic applications as well as constructing optimal entanglement witnesses for higher dimensional systems.

arXiv:1508.05892•Aug 24, 2015•5 citations

Complete sets of cyclic mutually unbiased bases in even prime-power dimensions

O. Kern, Kedar S. Ranade, Ulrich Seyfarth

We present a construction method for complete sets of cyclic mutually unbiased bases (MUBs) in Hilbert spaces of even prime-power dimensions. In comparison to the usual complete sets of MUBs, complete cyclic sets possess the additional property of being generated by a single unitary operator. The construction method is based on the idea of obtaining a partition of multi-qubit Pauli operators into maximal commuting sets of operators with the help of a suitable element of the Clifford group. As a consequence, we explicitly obtain complete sets of cyclic MUBs generated by a single element of the Clifford group in dimensions 2 m for m = 1, 2, …, 24.

arXiv:0912.4661•Journal of Physics A Mathematical and Theoretical•Jun 11, 2010•14 citations

Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs

Andrés García, Pablo Carlos López Vázquez

We propose a method, based on the search and identification of complete subgraphs of a regular graph, to obtain sets of Pauli operators whose eigenstates form unextendible complete sets of mutually unbiased bases of n-qubit systems. With this method we can obtain results for complete and inextensible sets of mubs for 2, 3, 4 and 5 qubits.

Mathematics•Jun 15, 2021•1 citation

An infinite family of strongly unextendible mutually unbiased bases in $\mathbb{C}^{2^{2h}}$

Jonathan Jedwab, Lily Yen

A set of $b$ mutually unbiased bases (MUBs) in $\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct bases is $\arccos(1/\sqrt{d})$. The largest number $μ(d)$ of MUBs that can exist in $\mathbb{C}^d$ is at most $d+1$, but constructions attaining this bound are known only when $d$ is a prime power. A set of $b$ MUBs in $\mathbb{C}^d$ that cannot be enlarged, even by the first vector of a potential $(b+1)$-th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions $d$ containing $b(d)$ strongly unextendible MUBs in $\mathbb{C}^d$ satisfying $b(d) < μ(d)$ was known, this family, due to Szántó, is asymptotically "large" in the sense that $b(d)/μ(d) \to 1$ as $d \to \infty$. However, the existence of $2^{m-1}+1$ strongly unextendible MUBs in $\mathbb{C}^{2^m}$ for each integer $m > 1$ has been conjectured by Mandayam et al. We prove their conjecture for all even values of $m$, using only elementary linear algebra. The existence of this "small" new infinite family suggests, contrary to widespread belief, that $μ(d)$ for non-prime-powers $d$ might be significantly larger than the size of particular unextendible sets.

arXiv:1604.04797•Apr 16, 2016•3 citations

Mutually unbiased unextendible maximally entangled bases in Cd ⊗ Cq(d+1)

Liang Bao Tang, Yi Xiang, Zhiwen Mo +1 more

Quantum measurements based on mutually unbiased base (MUB) are commonly used in quantum information processing. Firstly, we construct two completed unextendible maximally entangled bases (UMEBs) in bipartite systems [Formula: see text]. Then, the sufficient and necessary conditions of these two UMEBs develop into MUB can be obtained. Finally, we present some UMEBs that are mutually unbiased in concrete bipartite systems. These results provide a method to construct the best measurement bases.

Modern Physics Letters B•Oct 20, 2020•3 citations

Explicit constructions of mutually unbiased bases via Hadamard matrices

Jean-Christophe Pain

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.

quant-pharXiv:2604.02234•Apr 3, 2026•0 citations
We provide a construction of sets of d/2+1d/2+1d/2+1 mutually unbiased bases (MUBs) in dimensions d=4,8d=4,8d=4,8 using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the Pauli group. Moreover, specific examples of sets of MUBs obtained using our construction are shown to be {\it strongly unextendible}; that is, there does not exist another vector that is unbiased with respect to the elements in the set. We conjecture the existence of such unextendible sets in higher dimensions d=2n(n>3)d=2^{n} (n>3) d=2n(n>3) as well.} {Furthermore, we note an interesting connection between these unextendible sets and state-independent proofs of the Kochen-Specker Theorem for two-qubit systems. Our construction also leads to a proof of the tightness of a H2H_{2}H2​ entropic uncertainty relation for any set of three MUBs constructed from Pauli classes in d=4d=4d=4.
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions (d=p2d=p^{2}d=p2) that cannot be extended to a complete set using the generalized Pauli operators. We further observe an interesting connection between the existence of unextendible sets and the tightness of entropic uncertainty relations (EURs) in these dimensions. In particular, we show that our construction of unextendible sets of MUBs naturally leads to sets of p+1p+1p+1 MUBs that saturate both a Shannon (H1H_{1}H1​) and a collision (H2H_{2}H2​) entropic lower bound. Such an identification of smaller sets of MUBs satisfying tight EURs is crucial for cryptographic applications as well as constructing optimal entanglement witnesses for higher dimensional systems.
We present a construction method for complete sets of cyclic mutually unbiased bases (MUBs) in Hilbert spaces of even prime-power dimensions. In comparison to the usual complete sets of MUBs, complete cyclic sets possess the additional property of being generated by a single unitary operator. The construction method is based on the idea of obtaining a partition of multi-qubit Pauli operators into maximal commuting sets of operators with the help of a suitable element of the Clifford group. As a consequence, we explicitly obtain complete sets of cyclic MUBs generated by a single element of the Clifford group in dimensions 2 m for m = 1, 2, …, 24.
An infinite family of strongly unextendible mutually unbiased bases in C22h\mathbb{C}^{2^{2h}}C22h
A set of bbb mutually unbiased bases (MUBs) in Cd\mathbb{C}^dCd (for d>1d > 1d>1) comprises bdbdbd vectors in Cd\mathbb{C}^dCd, partitioned into bbb orthogonal bases for Cd\mathbb{C}^dCd such that the pairwise angle between all vectors from distinct bases is arccos⁡(1/d)\arccos(1/\sqrt{d})arccos(1/d​). The largest number μ(d)μ(d)μ(d) of MUBs that can exist in Cd\mathbb{C}^dCd is at most d+1d+1d+1, but constructions attaining this bound are known only when ddd is a prime power. A set of bbb MUBs in Cd\mathbb{C}^dCd that cannot be enlarged, even by the first vector of a potential (b+1)(b+1)(b+1)-th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions ddd containing b(d)b(d)b(d) strongly unextendible MUBs in Cd\mathbb{C}^dCd satisfying b(d)<μ(d)b(d) < μ(d)b(d)<μ(d) was known, this family, due to Szántó, is asymptotically "large" in the sense that b(d)/μ(d)→1b(d)/μ(d) \to 1b(d)/μ(d)→1 as d→∞d \to \inftyd→∞. However, the existence of 2m−1+12^{m-1}+12m−1+1 strongly unextendible MUBs in C2m\mathbb{C}^{2^m}C2m for each integer m>1m > 1m>1 has been conjectured by Mandayam et al. We prove their conjecture for all even values of mmm, using only elementary linear algebra. The existence of this "small" new infinite family suggests, contrary to widespread belief, that μ(d)μ(d)μ(d) for non-prime-powers ddd might be significantly larger than the size of particular unextendible sets.
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.