∗ Department of Computer Science, University of Verona, Italy† Department of Mathematics, University of Auckland,
Private Bag 92019, Auckland, New Zealand
Abstract
We give a holomorphic quartic polynomial
in the overlap variables whose zeros on the torus are precisely the
Weyl-Heisenberg SICs (symmetric informationally complete positive
operator valued measures).
By way of comparison, all the other known systems of equations
that determine a Weyl-Heisenberg SIC involve variables and their complex
conjugates.
We also give a related interesting result about the powers of the projective
Fourier transform of the group .
Throughout fix the integer , and let
be the primitive -th root of unity .
We think of vectors in as periodic signals on the group
, and hence index vectors and matrices by elements of .
A set of unit vectors in (or the lines that they
determine) is said to be equiangular if
(1.1)
In quantum information theory, the
corresponding rank one orthogonal projections
are said to be a symmetric informationally complete positive operator
valued measure, or a SIC for short.
The existence of a
SIC for every dimension is known as Zauner’s conjecture
(from his 1999 thesis, see [Zau10]),
or as the SIC problem.
There are high precision numerical constructions of SICs
[RBKSC04], [SG10], [Sco17],
and exact SICs in various dimensions [ACFW18], [GS17].
In all of these constructions, the SIC is a Weyl-Heisenberg SIC,
i.e., is the orbit of
a fiducial vector under the unitary irreducible projective
representation
of
with Schur multiplier given by
(1.2)
where is the cyclic shift matrix
and is the diagonal
(modulation) matrix .
In this case, the equiangularity condition (1.1) becomes
(1.3)
In this paper, we consider equations in the variables
(1.4)
which determine a (Weyl-Heisenberg) SIC. These variables (or scalar multiples
of them) are called the overlaps of the SIC. They
depend only on the fiducial projector .
The original attempts to find numerical and exact SIC fiducials
(using Groebner basis methods)
involved polynomial equations
in the variables and
, such as
the equiangularity condition (1.3),
the equations (see [BW07], [Kha08], [ADF14])
(1.5)
and the variational characterisation (used for finding numerical SICs)
(1.6)
More recent exact constructions of SICs
[ACFW18]
have been in the overlap variables
(utilising a natural Galois action on them).
Clearly the giving a SIC fiducial projector via (1.4)
must satisfy
(1.7)
and also, by the rule ,
(1.8)
These conditions on the overlap variables are not enough to guarantee
that they come from a fiducial projector (and hence prove Zauner’s conjecture).
In Section 2, we define a linear operator , which is
an example of the projective Fourier transform, which allows us
to reconstruct the fiducial projector as from a suitable .
We prove that
in addition to
(1.7) and (1.8),
the simple condition
ensures that a gives a SIC fiducial (Theorem 2.1).
We then give some examples, and describe the action of the Clifford group
on the SIC fiducials give by overlaps .
In Section 3, we give some interesting properties of , i.e.,
the projective Fourier transform of . In particular,
we show that ,
and a variant has order .
To our knowledge, this is only
the second example of a Fourier transform of finite order,
after
the (discrete) Fourier
transform for a finite abelian group (which satisfies ).
In Section 4, we give another system of equations in the overlaps
that determine a SIC.
These involve the symbol (–transform) of the rows of .
The symbols for giving a SIC turn out
to have interesting Riesz-type factorisation properties.
We use these to describe the (sporadic) SICs for ,
which are parametrised by a hypocycloid.
2 The reconstruction operator
Since the of (1.2) is a unitary irreducible projective
representation of dimension , it follows that
is a tight frame
(called a nice error frame with index group [CW17])
for the matrices
with the Frobenius inner product
i.e.,
(2.9)
In this particular case,
is an orthogonal basis.
Taking above gives the following formula for reconstruction from the overlaps
since ,
and gives
Motivated by this, we define a linear map
by
(2.10)
This can be viewed as the -Fourier transform of [Wal20]
(for a Schur multiplier ) which is a map
,
where counts over the irreducible projective representations
of with multiplier (and dimension ).
Here has just one
such representation, the of (1.2),
and of
at the unitary representation is
Thus is the projective Fourier transform for the group .
For this particular group, we can view the image of a vector in
as being in , and as a result it is natural
to consider powers of the Fourier transform. The only other case that
we know of where this can be done is for the ordinary representations of
a finite abelian group (where the representations give the character
group , which can be identified with ). In this case the
(discrete) Fourier transform has order .
We now use to characterise those vectors (matrices)
which give a fiducial
projector .
Proof: Firstly, observe (i) implies that is Hermitian, since
Since , ,
we calculate using (ii) that
The so called –trace of is equal to
.
Since is Hermitian, ,
and by the orthogonality of the , we calculate
Now by (ii) and (iii),
and so
.
Theorem 2.1
Let be given by (2.10).
Then a matrix determines
a fiducial projector for a Weyl-Heisenberg SIC by
if and only if
(i)
(ii)
(iii)
,
(iv)
Moreover this fiducial satisfies
and if then is given by
Proof:
By Lemma 2.1,
the eigenvalues of the Hermitian matrix satisfy
so that . Thus , with equality if
and only if . But
so that , , and we must have for
some , and for all others, i.e.,
is rank one, say
Since is orthogonal, taking the inner product
of the above
with gives
Finally, with the standard basis vectors, we calculate
From the proof, we see that (iv) can
be replaced by various equivalent conditions, e.g.,
(iv)′The characteristic polynomial of has the form
(iv)′′,
since given (i), (ii), (ii),
(iv)′′ (iv)
has eigenvalues (iv)′ (iv)′′.
By condition (ii), we may set , to obtain the following
characterisation.
Corollary 2.1
The overlaps of a Weyl-Heisenberg SIC are precisely the
zeros of the polynomial on the torus
The condition (i) allows further variables to be
eliminated. When is odd, half of the
variables , , can be eliminated. For even,
half of the variables , ,
can be eliminated, and
(2.11)
so that , and
is in for even,
and is in for odd.
Example 2.1
For , the conditions (2.11) of (i) give
, , .
Hence imposing the conditions (ii) and (iii),
we have eight possibilities
(2.12)
Taking the ‘’ choice above gives
which satisfies , and so gives a
Weyl-Heisenberg SIC
In fact all eight choices give SICs which are equivalent, as we
now explain.
The group generated by and is called the Heisenberg group,
and its normaliser in the unitary matrices is the Clifford group.
Indeed, if a , then
where is matrix multiplication by an element of .
The Clifford group maps SIC fiducials to SIC fiducials, via the
action
The induced action on the overlaps of the fiducial is given by
In [BW19], it is shown that the Clifford group is generated
by the scalar matrices, , ,
the Fourier transform and the Zauner matrix , where
When a (Weyl-Heisenberg) SIC fiducial is known,
there is always appears to be one which is given by an
eigenvector of (indeed these are often searched for
directly). Correspondingly, the overlaps satisfy
, i.e., the equations
which allows a further reduction of the variables .
3 Properties of the projective Fourier transform
Here we consider some properties of
given by (2.10),
i.e.,
the projective Fourier transform of .
It follows from the Plancherel formula for projective representations
[Wal20], or (2.9)
that is unitary.
Indeed, (2.9)
can be written as , where
satisfies
so that is unitary, and hence is unitary.
We now show that has finite order ( or ), i.e.,
the projective Fourier transform for of (1.2)
has finite order (Theorem 3.1).
To do this, we need a technical lemma (Lemma 3.1),
based on the Zauner matrix (of order ), which can be factored
where is the Fourier matrix, and is diagonal.
The strong form of Zauner’s conjecture is that there is
a SIC fiducial which is an eigenvector of ,
for every dimension .
Lemma 3.1
For any , we have that
and, in particular
Proof:
Write , . Since and , we have
Since the permutation matrix commutes with (or any power of ),
we have
where .
Since , we obtain
which completes the proof.
Theorem 3.1
The reconstruction operator of (2.10) has finite order, i.e.,
Proof: We consider with respect to the standard
basis for matrices, ordered so that the
coordinates of have the block structure
, where is the -th column
of the matrix (this is the order of matlab’s
reshape(c,d^2,1)).
The -block of the (block) matrix representation
of is given by
so that
The -block of is given by
The -block of is given by
so that
It therefore follows,
that is block diagonal, with diagonal blocks
Thus is block diagonal,
and, by Lemma 3.1,
its diagonal blocks simplify to
i.e., .
Since the projective representation (1.2) of
is not an ordinary representation,
there is no canonical presentation of the
projective Fourier transform at , as with the Fourier transform for
, which gives (of order ), by taking .
Indeed, one could take ,
for any unit scalars , with a corresponding -transform
(reconstruction operator)
For a general choice for , is again unitary,
but not of finite order. During our investigation,
we came across various
choices giving operators of finite order, in particular
(3.13)
It can be shown that has the compact form
(3.14)
where is the Hadamard product.
From this, we obtain the following.
Define the operation
of conjugation by the
permutation matrix of order .
This distributes over matrix multiplication,
the Hadamard product, leaving (and its powers) unchanged, so that
, and
where
Thus, , which gives
and .
4 Equivalent equations for Heisenberg frames
In this section, we give another condition that ensures has rank one,
which leads to a set of equations for which express in terms of
polynomials which are –transforms of the rows of .
These polynomials have interesting Riesz–type factorisation
properties, which we use to find a solution for .
We use the following condition which ensures that
a matrix has rank one.
Conversely, suppose that (4.15) holds with ,
then clearly for
In particular,
for some with if and only if
and
(4.16)
We now express (4.16) in terms of the following –transform.
Definition 4.1
For ,
the –th symbol of is defined to be the polynomial
This is the –transform of the –th row of the
matrix , since
We think of as being defined only on , since
each polynomial of degree is uniquely determined by its values
at the –th roots of unity. Clearly, we can recover
from the values , .
Using (LABEL:Tcjk), we calculate
The symbols corresponding to a solution have interesting
Riesz–type factorisation properties, which, for simplicity,
we illustrate when .
Corollary 4.1
for with if and only if the symbols of satisfy
(4.18)
Moreover, these have the factorisations
(4.19)
and the following invariant
(4.20)
Proof: For (4.18) take
in Theorem 4.1.
Now re-index to get
and take the modulus squared of both sides
But, from in the first equation,
so that
i.e., setting
Take the product over of the re-indexed equation
(since each and its conjugate appears exactly once in
the product). Thus, by (4.19)
For completeness, we note that the Hermitian
condition of Lemma 2.1 can also be succinctly expressed
in terms of row symbols.
Lemma 4.2
is Hermitian if and only if
the symbols of satisfy
Proof:
From the definition, we calculate
and so, by equating the coefficients of ,
the Hermitian condition is
equivalent to equality of the above symbols.
5 The Special Case of
This case already has some interesting geometric features.
Solving the basic equations for the is also
geometrically interesting.
Proposition 5.1
For ,
generates a Heisenberg frame with if and only if
(a)
and
(Hermitian conditions)
(b)
(Riesz factorization)
(c)
(invariant condition)
(d)
Proof:
By Lemma 4.2, the conditions for to be Hermitian are
Since ,
the first equation is satisfied provided
The second and third are equivalent, since substituting
for in the third gives
Hence (a) is equivalent to being Hermitian with ,
and implies .
By Corollary 4.1,
(a),(b),(c), (d) hold for a Heisenberg frame with .
For the converse, suppose that (a),(b),(c), (d) hold.
Then by (a), is Hermitian with , and ,
so that (d) gives , .
Hence Lemma 2.1, gives
In view of Theorem 2.1, with condition (iv)′, we need only
show that .
Since , condition (a) gives
Since , the invariant condition gives
, and we calculate
and so
Applying the Riesz factorisation to the last three terms we then obtain
(need to check !)
We now use Proposition 5.1 to find the solutions for .
First we consider the Riesz–type factorisation
.
Note that , and the variable of our symbols
satisfies , . Hence multiplying out gives
and
Hence, equating the coefficients of , gives
Since , the first equation is
automatically satisfied. Further, the second and third are conjugates of
each other, and so we have only one equation (for the Riesz–type
factorisations)
Setting , this becomes
Since , this can be rewritten as
Now we set , so that our equation becomes
(5.21)
We proceed to analyze both sides of this equation.
Lemma 5.1
The curve
is a –cusped hypocycloid (or deltoid).
Proof:
Recall that the standard parametric equations
for a hypocycloid with radii
and with are (see, e.g. [Wik23])
and if is an integer, it is –cusped.
Now
which has Cartesian coordinates
and so is a –cusped hypocycloid with radii and .
Figure 1: The Hypocycloid
For the left side, note that the product of the
three terms
Lemma 5.2
The set of complex numbers
is the interior and boundary of the –cusped hypocycloid
given by the right side, i.e.,
In particular, points on the boundary have the form
or
Proof:
Since , we can write a point in the set as
Now fix , and let vary.
Let and be the points on
the hypocycloid for and , i.e.,
We claim (cf. Figure 2) that as varies traces out the line segment connecting
and , precisely
which we verify by multiplying out
Further we note that this line segment is tangent to
the point where , i.e.,
Indeed the tangent to the hypocyloid at this point is
which is collinear with the line segment, except when
, the three cusps of the hypocycloid.
At the cusp corresponding to , and
, and thus the line segment connecting and is
also “tangent” at that cusp. The other cusps are handled similarly.
Figure 2: Points A and B on the Hypocycloid
Thus, from equation (5.21), it follows that
and
are boundary points of the hypocyloid. Solutions may be obtained as follows. Pick one of the boundary solutions, e.g., where so that
These can be solved using one of them as a free parameter, i.e.,
In this way we arrive at a continuum of parameterized solutions for the overlaps of a SIC in dimension
6 Closing Comment
It has sometimes been remarked that the overlaps are zeros of a self-reciprocal polynomial () with integer coefficients. The fact that the coefficients are integers is notable and perhaps important. However being self-reciprocal is not. Indeed if they are roots of a polynomial of degree then they are also automatically roots of and this latter polynomial is self-reciprocal.
7 Acknowledgement
We would like to thank
Marcus Appleby
for many helpful discussions related to SICs.
References
[ACFW18]
Marcus Appleby, Tuan-Yow Chien, Steven Flammia, and Shayne Waldron.
Constructing exact symmetric informationally complete measurements
from numerical solutions.
J. Phys. A, 51(16):165302, 40, 2018.
[ADF14]
D. Marcus Appleby, Hoan Bui Dang, and Christopher A. Fuchs.
Symmetric informationally-complete quantum states as analogues to
orthonormal bases and minimum-uncertainty states.
Entropy, 16(3):1484–1492, 2014.
[BW07]
Len Bos and Shayne Waldron.
Some remarks on Heisenberg frames and sets of equiangular lines.
New Zealand J. Math., 36:113–137, 2007.
[BW19]
Len Bos and Shayne Waldron.
SICs and the elements of order three in the Clifford group.
J. Phys. A, 52(10):105301, 31, 2019.
[CW17]
Tuan-Yow Chien and Shayne Waldron.
Nice error frames, canonical abstract error groups and the
construction of SICs.
Linear Algebra Appl., 516:93–117, 2017.
[GS17]
M. Grassl and A. J. Scott.
Fibonacci-Lucas SIC-POVMs.
ArXiv e-prints, July 2017.
[Kha08]
Mahdad Khatirinejad.
On Weyl-Heisenberg orbits of equiangular lines.
J. Algebraic Combin., 28(3):333–349, 2008.
[RBKSC04]
Joseph M. Renes, Robin Blume-Kohout, A. J. Scott, and Carlton M. Caves.
Symmetric informationally complete quantum measurements.
J. Math. Phys., 45(6):2171–2180, 2004.
[Sco17]
A. J. Scott.
SICs: Extending the list of solutions.
ArXiv e-prints, March 2017.
[SG10]
A. J. Scott and M. Grassl.
Symmetric informationally complete positive-operator-valued measures:
a new computer study.
J. Math. Phys., 51(4):042203, 16, 2010.
[Wal18]
Shayne F. D. Waldron.
An introduction to finite tight frames.
Applied and Numerical Harmonic Analysis. Birkhäuser/Springer, New
York, 2018.
[Wal20]
Shayne Waldron.
The Fourier transform of a projective group frame.
Appl. Comput. Harmon. Anal., 49(1):74–98, 2020.
[Zau10]
Gerhard Zauner.
Quantum Designs: Foundations of a non-commutative Design
Theory.
PhD thesis, University of Vienna, 1 2010.
English translation of 1999 Doctoral thesis including a new preface.