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:2512.04543

Efficient Identification the Inequivalence of Mutually Unbiased Bases via Finite Operators

Jianxin Song, Zhen-Peng Xu, Changliang Ren

quant-phSubmitted Dec 4, 2025• Announced Dec 5, 2025• 0 citations
arXivHTMLPDF

Abstract

The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely limited by computational resources and suffer from the numerical precision problem. Here we introduce an operational approach to identify the inequivalence of MUBs subsets, which has less time complexity and entirely avoids the computational precision issues. For arbitrary MUBs subsets of $k$ elements in any prime dimension, this method yields a universal analytical upper bound for the amount of MUBs equivalence classes. By applying this method through simple iterations, we further obtain tighter classification upper bounds for any prime dimension $d\leq 37$. Crucially, the comparison of these upper bounds with existing lower bounds successfully determines the exact classification for all MUBs subsets in any dimension $d \leq 17$. We further extend this method to the case that the dimension is a power of prime number. This general and scalable framework for the classification of MUBs subsets sheds new light on related applications.

Related papers

Towards exact algorithmic proofs of maximal mutually unbiased bases sets in arbitrary integer dimension

Santiago Cifuentes, Nicolás Ciancaglini, Guido Bellomo +2 more

In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set. However, the maximum number of MUBs in dimensions that are not powers of prime numbers is not known. To address this issue, we introduce three algorithms based on First-Order Logic that can determine the maximum number of bases in an MUB set without numerical approximation. Our algorithms can prove this result in finite time, although the required time is impractical. Additionally, we present a heuristic approach to solve the semi-decision problem of determining if there are $k$ MUBs in a given dimension $d$. As a byproduct of our research, we demonstrate that the maximum number of MUBs in any dimension can be achieved with definable complex parameters, computable complex parameters, and other similar fields.

arXiv:2309.12399•Sep 21, 2023•0 citations

Generalized Numerical Construction of MUBs: A Group Theoretical Investigation

B. Gültekin, S. B. Samuel, Z. Gedik

Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of maximal sets of MUBs are well-known and standard construction relies on the Weyl-Heisenberg (WH) group and finite fields. In non-prime-power dimensions, on the other hand, the existence of such maximal sets remains an open question. We present a generalized numerical method of constructing MUBs without any reliance on \textit{a priori} group structure or specific algebraic frameworks. Formulating the problem at the level of Gram matrix, we reduce the search for complete sets of d+1 MUBs to a phase space optimisation problem. We use the fact that the MUB Gram matrix is a projection matrix, and the third- and fourth-order trace constraints are necessary and sufficient conditions for a projection matrix. We further develop a classification framework based on third-order Bargmann invariants and automorphism groups, allowing us to probe the underlying algebraic and geometric structure of the resulting configurations. Numerical applications of this method in dimensions $3$, $4$, and $5$ demonstrate that all numerically constructed solutions are mutually isomorphic, are isolated points in phase space, and possess automorphism groups that coincide exactly with the Clifford group, the normalizer of the WH group. In the lowest non-prime-power dimension $6$ where the existence of a complete set remains open, our numerical search yields no solution. However, for incomplete sets of solutions, our search finds no set of four MUBs, but it yields several inequivalent triples, which we classify and whose neighbourhood we then investigate.

quant-pharXiv:2604.04164•Journal of Physics A Mathematical and Theoretical•Apr 7, 2026•0 citations

Quantifying Measurement Incompatibility of Mutually Unbiased Bases

Sébastien Designolle, Paul Skrzypczyk, Florian Fröwis +1 more

Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of k MUB in dimension d, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of k=d+1 MUB (using the standard construction for d being a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of k MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.

arXiv:1805.09609•Physical Review Letters•Feb 6, 2019•77 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

Measures to characterise Approximate Mutually Unbiased Bases

Ajeet Kumar, Uditanshu Sadual

Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.

quant-pharXiv:2512.12828•Dec 16, 2025•0 citations

Equivalence of mutually unbiased bases via orbits: general theory and a d = 4 case study

Amit Te’eni, Eliahu Cohen

Abstract In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases (ONBs) that are as ‘far apart’ as possible, and their classification reveals rich underlying geometric structure. Given a complex inner product space, we construct the space of its ONBs as a discrete quotient of the complete flag manifold. We introduce a metric on this space, which corresponds to the ‘MUBness’ distance. This allows us to describe equivalence between sets of MUBs in terms of the geometry of this space. The subspace of bases that are unbiased with respect to the standard basis decomposes into orbits under a certain group action, and this decomposition corresponds to the classification of complex Hadamard matrices. More generally, we consider a list of k MUBs, that one wishes to extend. The candidates are points in the subspace comprising all bases which are unbiased with respect to the entire list. This space also decomposes into orbits under a group action, and we prove that points in distinct orbits yield inequivalent MUB lists. Thus, we generalize the relation between complex Hadamard matrices and MUBs. As an application, we identify new symmetries that reduce the parameter space of MUB triples in dimension 4 by a factor of 4.

arXiv:2508.15412•Journal of Physics A Mathematical and Theoretical•Feb 6, 2026•0 citations
The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely limited by computational resources and suffer from the numerical precision problem. Here we introduce an operational approach to identify the inequivalence of MUBs subsets, which has less time complexity and entirely avoids the computational precision issues. For arbitrary MUBs subsets of kkk elements in any prime dimension, this method yields a universal analytical upper bound for the amount of MUBs equivalence classes. By applying this method through simple iterations, we further obtain tighter classification upper bounds for any prime dimension d≤37d\leq 37d≤37. Crucially, the comparison of these upper bounds with existing lower bounds successfully determines the exact classification for all MUBs subsets in any dimension d≤17d \leq 17d≤17. We further extend this method to the case that the dimension is a power of prime number. This general and scalable framework for the classification of MUBs subsets sheds new light on related applications.
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions ddd that are powers of prime numbers, there exists a set of up to d+1d+1d+1 bases that form an MUB set. However, the maximum number of MUBs in dimensions that are not powers of prime numbers is not known. To address this issue, we introduce three algorithms based on First-Order Logic that can determine the maximum number of bases in an MUB set without numerical approximation. Our algorithms can prove this result in finite time, although the required time is impractical. Additionally, we present a heuristic approach to solve the semi-decision problem of determining if there are kkk MUBs in a given dimension ddd. As a byproduct of our research, we demonstrate that the maximum number of MUBs in any dimension can be achieved with definable complex parameters, computable complex parameters, and other similar fields.
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of maximal sets of MUBs are well-known and standard construction relies on the Weyl-Heisenberg (WH) group and finite fields. In non-prime-power dimensions, on the other hand, the existence of such maximal sets remains an open question. We present a generalized numerical method of constructing MUBs without any reliance on \textit{a priori} group structure or specific algebraic frameworks. Formulating the problem at the level of Gram matrix, we reduce the search for complete sets of d+1 MUBs to a phase space optimisation problem. We use the fact that the MUB Gram matrix is a projection matrix, and the third- and fourth-order trace constraints are necessary and sufficient conditions for a projection matrix. We further develop a classification framework based on third-order Bargmann invariants and automorphism groups, allowing us to probe the underlying algebraic and geometric structure of the resulting configurations. Numerical applications of this method in dimensions 333, 444, and 555 demonstrate that all numerically constructed solutions are mutually isomorphic, are isolated points in phase space, and possess automorphism groups that coincide exactly with the Clifford group, the normalizer of the WH group. In the lowest non-prime-power dimension 666 where the existence of a complete set remains open, our numerical search yields no solution. However, for incomplete sets of solutions, our search finds no set of four MUBs, but it yields several inequivalent triples, which we classify and whose neighbourhood we then investigate.
Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of k MUB in dimension d, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of k=d+1 MUB (using the standard construction for d being a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of k MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.
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.
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.
Abstract In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases (ONBs) that are as ‘far apart’ as possible, and their classification reveals rich underlying geometric structure. Given a complex inner product space, we construct the space of its ONBs as a discrete quotient of the complete flag manifold. We introduce a metric on this space, which corresponds to the ‘MUBness’ distance. This allows us to describe equivalence between sets of MUBs in terms of the geometry of this space. The subspace of bases that are unbiased with respect to the standard basis decomposes into orbits under a certain group action, and this decomposition corresponds to the classification of complex Hadamard matrices. More generally, we consider a list of k MUBs, that one wishes to extend. The candidates are points in the subspace comprising all bases which are unbiased with respect to the entire list. This space also decomposes into orbits under a group action, and we prove that points in distinct orbits yield inequivalent MUB lists. Thus, we generalize the relation between complex Hadamard matrices and MUBs. As an application, we identify new symmetries that reduce the parameter space of MUB triples in dimension 4 by a factor of 4.