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

Optimality beyond the Welch bound: orthoplectic Grassmannian frames as weighted complex projective 2-designs

Bernhard G. Bodmann

Published Jan 1, 2016• 0 citations
OpenAlex

Abstract

Despite being pursued with a lot of dedication in frame theory and quantum information theory, maximal equiangular tight frames have only been confirmed to exist for lowest dimensions. This is especially puzzling since maximal sets of mutually unbiased bases, which are also known to be optimal packings but have a slightly larger number of vectors, are known to exist in complex Hilbert spaces of any prime power dimension. This talk presents a method by which we can construct a set of $M^2+1$ vectors in $M$ complex dimensions that form a tight complex orthoplectic Grassmannian frame that is in addition related to a weighted complex projective 2-design with optimality properties for quantum state tomography.

Related papers

Mutually unbiased bases, spherical designs, and frames

Andreas Klappenecker, Martin Roetteler

The principle of complementarity lies at the heart of quantum mechanics. In finite dimensional quantum systems this principle is captured by pairs of observables which are given by mutually unbiased bases (MUBs). Two orthonormal bases B and C of Cd are mutually unbiased if |<b|c>|2 = 1/d holds for all vectors b ∈ B and c ∈ C. This implies that whenever we are given a vector from one of these bases and perform a measurement with respect to any other of the bases, then there is no information gained from this measurement. A basic question about MUBs is how many of them can be found in a given dimension d. While constructions of maximal sets of d+1 such bases are known for system of prime power dimension d, it is unknown whether this bound can be achieved for any non-prime power dimension. We review the known constructions of MUBs and demonstrate that maximal sets of MUBs come with a rich combinatorial structure by showing that they actually are the same objects as the complex projective 2-designs with angle set {0,1/d}. Furthermore, we address the problem of constructing positive operator-valued measures (POVMs) in finite dimension d consisting of d2 operators of rank one which have an inner product equal to uniform or very close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. We also give a simple proof of the fact that symmetric informationally complete POVMs are complex projective 2-designs with angle set {1/(d+1)}. Moreover, we show that MUBs and SIC-POVMs form uniform tight frames in Cd.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 18, 2005•25 citations

Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements

Aidan Roy, A. J. Scott

We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as generalizations of complete sets of mutually unbiased bases, being equivalent whenever the design is composed of d+1 bases in dimension d. We show that, for the purpose of quantum state determination, these designs specify an optimal collection of orthogonal measurements. Using highly nonlinear functions on Abelian groups, we construct explicit examples from d+2 orthonormal bases whenever d+1 is a prime power, covering dimensions d=6, 10, and 12, for example, where no complete sets of mutually unbiased bases have thus far been found.

arXiv:quant-ph/0703025•Journal of Mathematical Physics•Jul 1, 2007•102 citations

On mutually unbiased bases

Rahim Taghikhani

Two orthonormal bases in the complex space of dimension d, are said to be mutually unbiased if the square of the magnitude of the inner product of any vector from one basis with any vector in other basis is equal to the reciprocal of the dimension d. Mutually unbiased bases are used for optimal state determination of mixed quantum states. It is known that in any dimension d, the number of mutually unbiased bases is at most d+1. Ivanovic found a complete set of mutually unbiased bases for prime dimensions. His construction was generalized by Wootters and Fields for prime power dimensions. There is a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. Based on this connection, there exits a constructive proof of the existence of a complete set of mutually unbiased bases for prime power dimensions. This thesis is an exploration on construction of mutually unbiased bases.

•Aug 26, 2013•1 citation

A genetic algorithm to generate maximally orthogonal frames in complex space

Sebastián Roca-Jerat, Juan Román-Roche

Abstract A frame is a generalization of a basis of a vector space to a redundant overspanning set whose vectors are linearly dependent. Frames find applications in signal processing and quantum information theory. We present a genetic algorithm that can generate maximally orthogonal frames (MOFs) of arbitrary size n in d-dimensional complex space. First, we formalize the concept of MOF and demonstrate that it depends on the choice of an energy function to weigh the different pairwise overlaps between vectors. Then, we discuss the relation between different energy functions and well-known frame varieties such as tight and Grassmannian frames and complex projective p-designs. Obtaining MOFs poses a global non-convex minimization problem. We discuss the relation with established numerical problems such as the Thomson problem and the problem of finding optimal packings in complex projective space. To tackle the minimization, we design a hybrid genetic algorithm that features local optimization of the parents. To assess the performance of the algorithm, we propose two visualization techniques that allow us to analyze the coherence and uniformity of high-dimensional frames. The genetic algorithm is able to produce highly-symmetric universal frames, such as equiangular tight frames, symmetric, informationally complete, positive operator-valued measurements and maximal sets of mutually unbiased bases, for configurations of up to d = 6 and n = 36, with runtimes of the order of several minutes on a regular desktop computer for the largest configurations.

arXiv:2504.21084•Machine Learning Science and Technology•Jul 28, 2025•1 citation

Welch Bounds and Quantum State Tomography

Aleksandrs Belovs

In this thesis we investigate complete systems of MUBs and SIC-POVMs. These are highly \nsymmetric sets of vectors in Hilbert space, interesting because of their applications in quantum \ntomography, quantum cryptography and other areas. It is known that these objects \nform complex projective 2-designs, that is, they satisfy Welch bounds for k = 2 with equality. \nUsing this fact, we derive a necessary and sufficient condition for a set of vectors to be \na complete system of MUBs or a SIC-POVM. This condition uses the orthonormality of a \nspecific set of vectors. \nThen we define homogeneous systems, as a special case of systems of vectors for which \nthe condition takes an especially elegant form. We show how known results and some new \nresults naturally follow from this construction.

•Dec 22, 2008•8 citations

Stronger Welch Bounds and Optimal Approximate kkk-Designs

Riccardo Castellano, Dmitry Grinko, Sadra Boreiri +2 more

The question of how well a finite ensemble of quantum states can approximate Haar randomness is relevant in many areas of quantum physics. Here we consider this problem from a geometrical perspective, via the notion of Welch bounds. The latter are a set of inequalities, originally derived in the context of signal processing, which precisely characterize exact k-designs, i.e. a finite ensemble of states that exactly reproduces the k-th moment of the Haar measure. We derive stronger Welch bounds which enable a quantitative and operationally meaningful characterisation of approximate k-designs. Our new bounds are often tight, allowing us to characterize optimal approximate designs in regimes where the cardinality of the ensemble is small. A notable example is complete sets of mutually unbiased bases (MUBs), which form an optimal approximate 3-design among 1-designs of their cardinality. This leads to a new variational approach to determine the existence of complete sets of MUBs, which we explore numerically in dimension six. We highlight a connection to shadow tomography, relating our bounds to the shadow norm. We comment on how the method extends to other types of designs, including toric and unitary designs. A key technical ingredient, is the computation of the complete spectrum of the partially transposed symmetric-subspace projector, including multiplicities and eigenvectors, which may find further applications.

quant-pharXiv:2602.13099•Feb 16, 2026•2 citations
Despite being pursued with a lot of dedication in frame theory and quantum information theory, maximal equiangular tight frames have only been confirmed to exist for lowest dimensions. This is especially puzzling since maximal sets of mutually unbiased bases, which are also known to be optimal packings but have a slightly larger number of vectors, are known to exist in complex Hilbert spaces of any prime power dimension. This talk presents a method by which we can construct a set of M2+1M^2+1M2+1 vectors in MMM complex dimensions that form a tight complex orthoplectic Grassmannian frame that is in addition related to a weighted complex projective 2-design with optimality properties for quantum state tomography.
The principle of complementarity lies at the heart of quantum mechanics. In finite dimensional quantum systems this principle is captured by pairs of observables which are given by mutually unbiased bases (MUBs). Two orthonormal bases B and C of Cd are mutually unbiased if |<b|c>|2 = 1/d holds for all vectors b ∈ B and c ∈ C. This implies that whenever we are given a vector from one of these bases and perform a measurement with respect to any other of the bases, then there is no information gained from this measurement. A basic question about MUBs is how many of them can be found in a given dimension d. While constructions of maximal sets of d+1 such bases are known for system of prime power dimension d, it is unknown whether this bound can be achieved for any non-prime power dimension. We review the known constructions of MUBs and demonstrate that maximal sets of MUBs come with a rich combinatorial structure by showing that they actually are the same objects as the complex projective 2-designs with angle set {0,1/d}. Furthermore, we address the problem of constructing positive operator-valued measures (POVMs) in finite dimension d consisting of d2 operators of rank one which have an inner product equal to uniform or very close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. We also give a simple proof of the fact that symmetric informationally complete POVMs are complex projective 2-designs with angle set {1/(d+1)}. Moreover, we show that MUBs and SIC-POVMs form uniform tight frames in Cd.
We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as generalizations of complete sets of mutually unbiased bases, being equivalent whenever the design is composed of d+1 bases in dimension d. We show that, for the purpose of quantum state determination, these designs specify an optimal collection of orthogonal measurements. Using highly nonlinear functions on Abelian groups, we construct explicit examples from d+2 orthonormal bases whenever d+1 is a prime power, covering dimensions d=6, 10, and 12, for example, where no complete sets of mutually unbiased bases have thus far been found.
Two orthonormal bases in the complex space of dimension d, are said to be mutually unbiased if the square of the magnitude of the inner product of any vector from one basis with any vector in other basis is equal to the reciprocal of the dimension d. Mutually unbiased bases are used for optimal state determination of mixed quantum states. It is known that in any dimension d, the number of mutually unbiased bases is at most d+1. Ivanovic found a complete set of mutually unbiased bases for prime dimensions. His construction was generalized by Wootters and Fields for prime power dimensions. There is a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. Based on this connection, there exits a constructive proof of the existence of a complete set of mutually unbiased bases for prime power dimensions. This thesis is an exploration on construction of mutually unbiased bases.
Abstract A frame is a generalization of a basis of a vector space to a redundant overspanning set whose vectors are linearly dependent. Frames find applications in signal processing and quantum information theory. We present a genetic algorithm that can generate maximally orthogonal frames (MOFs) of arbitrary size n in d-dimensional complex space. First, we formalize the concept of MOF and demonstrate that it depends on the choice of an energy function to weigh the different pairwise overlaps between vectors. Then, we discuss the relation between different energy functions and well-known frame varieties such as tight and Grassmannian frames and complex projective p-designs. Obtaining MOFs poses a global non-convex minimization problem. We discuss the relation with established numerical problems such as the Thomson problem and the problem of finding optimal packings in complex projective space. To tackle the minimization, we design a hybrid genetic algorithm that features local optimization of the parents. To assess the performance of the algorithm, we propose two visualization techniques that allow us to analyze the coherence and uniformity of high-dimensional frames. The genetic algorithm is able to produce highly-symmetric universal frames, such as equiangular tight frames, symmetric, informationally complete, positive operator-valued measurements and maximal sets of mutually unbiased bases, for configurations of up to d = 6 and n = 36, with runtimes of the order of several minutes on a regular desktop computer for the largest configurations.
In this thesis we investigate complete systems of MUBs and SIC-POVMs. These are highly \nsymmetric sets of vectors in Hilbert space, interesting because of their applications in quantum \ntomography, quantum cryptography and other areas. It is known that these objects \nform complex projective 2-designs, that is, they satisfy Welch bounds for k = 2 with equality. \nUsing this fact, we derive a necessary and sufficient condition for a set of vectors to be \na complete system of MUBs or a SIC-POVM. This condition uses the orthonormality of a \nspecific set of vectors. \nThen we define homogeneous systems, as a special case of systems of vectors for which \nthe condition takes an especially elegant form. We show how known results and some new \nresults naturally follow from this construction.
The question of how well a finite ensemble of quantum states can approximate Haar randomness is relevant in many areas of quantum physics. Here we consider this problem from a geometrical perspective, via the notion of Welch bounds. The latter are a set of inequalities, originally derived in the context of signal processing, which precisely characterize exact k-designs, i.e. a finite ensemble of states that exactly reproduces the k-th moment of the Haar measure. We derive stronger Welch bounds which enable a quantitative and operationally meaningful characterisation of approximate k-designs. Our new bounds are often tight, allowing us to characterize optimal approximate designs in regimes where the cardinality of the ensemble is small. A notable example is complete sets of mutually unbiased bases (MUBs), which form an optimal approximate 3-design among 1-designs of their cardinality. This leads to a new variational approach to determine the existence of complete sets of MUBs, which we explore numerically in dimension six. We highlight a connection to shadow tomography, relating our bounds to the shadow norm. We comment on how the method extends to other types of designs, including toric and unitary designs. A key technical ingredient, is the computation of the complete spectrum of the partially transposed symmetric-subspace projector, including multiplicities and eigenvectors, which may find further applications.