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

Characterizing the generalized complementarity polytope with extractable information from MUBs

Gautam Sharma

Published Sep 1, 2021• 0 citations
arXivHTMLPDF

Abstract

Complementarity polytope is a geometric structure that exists in N2-1 dimensional space for an N dimensional Hilbert space. The existence of N + 1 mutually unbiased bases(MUBs) is possible, if such a polytope can be shown to be a subset of density matrices, which is a very difficult task. With the hope of simplifying this task, we have shown in this work that, the complementarity polytope can be characterized by the total extractable information from N+1 MUBs. We also demonstrate that t less than (N+1) number of MUBs also form a polytope that exists in t(N-1) dimensional space, which we refer to as generalized complementarity polytope. The generalized complementarity polytope can also be characterized by total extractable information from t MUBs.

DOI
10.48550/arxiv.2109.00507

Related papers

Mutually Unbiased Bases and the Complementarity Polytope

Ingemar Bengtsson, Åsa Ericsson

A complete set of N + 1 mutually unbiased bases (MUBs) forms a convex polytope in the N2 - 1 dimensional space of N × N Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown whether it can be made to lie within the body of density matrices unless N = pk, where p is prime. We investigate the polytope in order to see if some values of N are geometrically singled out. One such feature is found: It is possible to select N2 facets in such a way that their centers form a regular simplex if and only if there exists an affine plane of order N. Affine planes of order N are known to exist if N = pk; perhaps they do not exist otherwise. However, the link to the existence of MUBs — if any — remains to be found.

arXiv:quant-ph/0410120•Open Systems & Information Dynamics•May 31, 2005•58 citations

MUBs, Polytopes, and Finite Geometries

Ingemar Bengtsson

A complete set of N + 1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = pk, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = pk. The existence of MUBs for other values of N is an open question, and the same is true for finite affine planes. I explore the question whether the existence of complete sets of MUBs is directly related to the existence of finite affine planes. Both questions can be shown to be geometrical questions about a convex polytope, but not in any obvious way the same question.

arXiv:quant-ph/0406174•AIP conference proceedings•Jan 1, 2005•45 citations

Efficient Identification the Inequivalence of Mutually Unbiased Bases via Finite Operators

Jianxin Song, Zhen-Peng Xu, Changliang Ren

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.

quant-pharXiv:2512.04543•Science China Physics Mechanics and Astronomy•Dec 5, 2025•1 citation

MUBS, POLYTOPES, AND FINITE GEOMETRIES 1

Ingemar Bengtsson

A complete set of N+1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = p^k, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = p^k. The existence of MUBs for other values of N is an open question, and the same is true for finite affine planes. I explore the question whether the existence of complete sets of MUBs is directly related to the existence of finite affine planes. Both questions can be shown to be geometrical questions about a convex polytope, but not in any obvious way the same question.

•Jun 23, 2004•27 citations

Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding

Máté Farkas, Jędrzej Kaniewski, Ashwin Nayak

Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced generalisation of MUBs called mutually unbiased measurements (MUMs). These measurements inherit the essential property of complementarity from MUBs, but the Hilbert space dimension is no longer required to match the number of outcomes. This operational complementarity property renders MUMs highly useful for device-independent quantum information processing. It has been shown that MUMs are strictly more general than MUBs. In this work we provide a complete proof of the characterisation of MUMs that are direct sums of MUBs. We then construct new examples of MUMs that are not direct sums of MUBs. A crucial technical tool for this construction is a correspondence with quaternionic Hadamard matrices, which allows us to map known examples of such matrices to MUMs that are not direct sums of MUBs. Furthermore, we show that—in stark contrast with MUBs—the number of MUMs for a fixed outcome number is unbounded. Next, we focus on the use of MUMs in quantum communication. We demonstrate how any pair of MUMs with$d$outcomes defines a$d$-dimensional superdense coding protocol. Using MUMs that are not direct sums of MUBs, we disprove a recent conjecture due to Nayak and Yuen on the rigidity of superdense coding, for infinitely many dimensions. The superdense coding protocols arising in the refutation reveal how shared entanglement may be used in a manner heretofore unknown.

arXiv:2204.11886•IEEE Transactions on Information Theory•Apr 24, 2023•11 citations

Mutually unbiased measurements in finite dimensions

Amir Kalev, Gilad Gour

We generalize the concept of mutually unbiased bases (MUB) to measurements which are not necessarily described by rank one projectors. As such, these measurements can be a useful tool to study the long-standing problem of the existence of MUB. We derive their general form, and show that in a finite, d -dimensional Hilbert space, one can construct a complete set of mutually unbiased measurements. Besides their intrinsic link to MUB, we show that these measurements' statistics provide complete information about the state of the system. Moreover, they capture the physical essence of unbiasedness, and in particular, they satisfy a non-trivial entropic uncertainty relation similar to MUB.

arXiv:1401.2706•New Journal of Physics•May 21, 2014•118 citations
Complementarity polytope is a geometric structure that exists in N2-1 dimensional space for an N dimensional Hilbert space. The existence of N + 1 mutually unbiased bases(MUBs) is possible, if such a polytope can be shown to be a subset of density matrices, which is a very difficult task. With the hope of simplifying this task, we have shown in this work that, the complementarity polytope can be characterized by the total extractable information from N+1 MUBs. We also demonstrate that t less than (N+1) number of MUBs also form a polytope that exists in t(N-1) dimensional space, which we refer to as generalized complementarity polytope. The generalized complementarity polytope can also be characterized by total extractable information from t MUBs.
A complete set of N + 1 mutually unbiased bases (MUBs) forms a convex polytope in the N2 - 1 dimensional space of N × N Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown whether it can be made to lie within the body of density matrices unless N = pk, where p is prime. We investigate the polytope in order to see if some values of N are geometrically singled out. One such feature is found: It is possible to select N2 facets in such a way that their centers form a regular simplex if and only if there exists an affine plane of order N. Affine planes of order N are known to exist if N = pk; perhaps they do not exist otherwise. However, the link to the existence of MUBs — if any — remains to be found.
A complete set of N + 1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = pk, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = pk. The existence of MUBs for other values of N is an open question, and the same is true for finite affine planes. I explore the question whether the existence of complete sets of MUBs is directly related to the existence of finite affine planes. Both questions can be shown to be geometrical questions about a convex polytope, but not in any obvious way the same question.
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.
A complete set of N+1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = p^k, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = p^k. The existence of MUBs for other values of N is an open question, and the same is true for finite affine planes. I explore the question whether the existence of complete sets of MUBs is directly related to the existence of finite affine planes. Both questions can be shown to be geometrical questions about a convex polytope, but not in any obvious way the same question.
Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced generalisation of MUBs called mutually unbiased measurements (MUMs). These measurements inherit the essential property of complementarity from MUBs, but the Hilbert space dimension is no longer required to match the number of outcomes. This operational complementarity property renders MUMs highly useful for device-independent quantum information processing. It has been shown that MUMs are strictly more general than MUBs. In this work we provide a complete proof of the characterisation of MUMs that are direct sums of MUBs. We then construct new examples of MUMs that are not direct sums of MUBs. A crucial technical tool for this construction is a correspondence with quaternionic Hadamard matrices, which allows us to map known examples of such matrices to MUMs that are not direct sums of MUBs. Furthermore, we show that—in stark contrast with MUBs—the number of MUMs for a fixed outcome number is unbounded. Next, we focus on the use of MUMs in quantum communication. We demonstrate how any pair of MUMs withdddoutcomes defines addd-dimensional superdense coding protocol. Using MUMs that are not direct sums of MUBs, we disprove a recent conjecture due to Nayak and Yuen on the rigidity of superdense coding, for infinitely many dimensions. The superdense coding protocols arising in the refutation reveal how shared entanglement may be used in a manner heretofore unknown.
We generalize the concept of mutually unbiased bases (MUB) to measurements which are not necessarily described by rank one projectors. As such, these measurements can be a useful tool to study the long-standing problem of the existence of MUB. We derive their general form, and show that in a finite, d -dimensional Hilbert space, one can construct a complete set of mutually unbiased measurements. Besides their intrinsic link to MUB, we show that these measurements' statistics provide complete information about the state of the system. Moreover, they capture the physical essence of unbiasedness, and in particular, they satisfy a non-trivial entropic uncertainty relation similar to MUB.