Invariants for maximally entangled vectors and unitary bases
Sibasish Ghosh, Ajit Iqbal Singh
Introduction
In Section 2 of the paper, we introduce fan representations of unitary bases. The concepts and results of Section 2 are illustrated via different examples in Section 3. Some of the ideas developed in Section 2 as well as the examples discussed in Section 3 are then applied in Section 4 to discuss the issue of quantum state tomography. Finally, we draw the conclusion in Section 5.
Unitary bases and their fan representation
We begin with some basic material. We shall freely use and in this section. Let be a -dimensional Hilbert space with and a set of elements such as or etc. .
Let be a unitary basis, in short, UB, i.e. a collection of unitary operators the -algebra of bounded linear operators on to itself, such that for
Rewording a part of the discussion after Proposition 9 , we call two unitary bases and equivalent if there exist unitaries in and a relabelling of such that for in
We recall a one-to-one linear correspondence (in terms of this maximally entangled vector in ) between and as set up in , Lemma 2 or , Proof of Theorem 1, for instance, via At times we express this as or, even and write
The map takes the set of maximally entangled vectors in to the set of unitaries on
The rank of and the Schmidt rank of are the same.
Entropy of or certain variants are in vogue as measures of entanglement of
A non-empty set of unitaries in indexed by will be called a unitary system, in short, US, if and for in The number will be called the size of
An abelian unitary system, in short, AUS, is a unitary system with for in
A maximal abelian subsystem of a unitary system in short, -MASS, is a subset of which is an AUS and maximal with this property.
A tagged unitary system, in short, TUS, is a triple where is a unitary system. We say is tagged at
Let be a tag at Set We set Then satisfies for and, therefore, is a UB. We call the -associated UB. On the other hand, given a UB for setting we have is a tag at It satisfies for where has been taken as We call the -associated tag at We note that in both cases, for Further, for if and only if We denote this condition by and call it by Twill. Really speaking, both the associations are on the left and have obvious right versions as well.
Let be a unitary system. Then for each in the linear span of So Also for in forces to be linearly independent. So we have and, thus, we may consider as a proper subset of if we like.
Given a US will be called the unitization of We note that is a system of mutually orthogonal unitaries and it is a UB if and only if the size of is
AUS of size have been very well utilized by Wootters and Fields and Bandyopadhyay et. al. to study mutually unbiased bases in see also , , , and . (, Lemma 3.1) records the basic fact that the size of an AUS can at most be
In fact, if is an AUS of size then there is a unitary on and mutually orthogonal operators represented by mutually orthogonal diagonal matrices with entries in the unit circle such that As a consequence, the matrix formed by the diagonals of and as rows is a partial complex Hadamard matrix in the sense that and for each entry of This forces History and development of Hadamard matrices is very long and fascinating. We just mention a few sources , , , and , , , which we can directly use.
Obstructions to construction of MUB have occupied many researchers, e.g., see , , , , , . Even when, say for, a prime power, complete systems of MUB’s exist, some subsystems of certain UB’s may not be extendable to complete systems of MUB’s, this is explained well by Mandayam, Bandyopadhyay, Grassl and Wootters for
Contents of the next three items are based on the fourth section of the second author’s preprint .
Let be subsets of
We say that is collectively unitarily equivalent to in short, CUE if there exists a such that We may say CUE via
In case and are decomposed as respectively, then we may require that for CUE via and say that CUE or, if no confusion arises CUE
In case and are indexed by a set as and respectively, then (as a special case of (ii) above) we may require that and say that CUE or, if no confusion arises, CUE
The operator in the definition above may not be unique. In fact, if for some then works fine too.
CUE if and only if CUE for some indexing and of and respectively by the same index set So we may fix some such indexing, if we like.
The relation CUE (in both the senses in Definition 2.4 above) is an equivalence relation.
It can be readily seen that if CUE and is a commuting family then so is
If CUE via then for each the spectrum and for for an eigenvalue of is an eigenvector for with eigenvalue if and only if is an eigenvector for with eigenvalue
If is a commuting -tuple of normal operators in then there exists a and an -tuple of operators () represented by diagonal matrices with respect to basis such that In other words, CUE The converse is also true.
Garcia and Tener (, Theorem 1.1) obtained a canonical decomposition for complex matrices which are UET, i.e., unitarily equivalent to their transposes we may call a tuple of matrices collectively unitarily equivalent to the respective transposes, in short, CUET, if CUE where
is not CUET where is a non-real complex number and is a complex number with
Garcia and Tener [, expressions (1.4), (1.5), (1.6)] note that if T=\left(\begin{array}[]{cc}A&B\\ D&A^{t}\end{array}\right), with matrices satisfying (to be called skew-Hamiltonian (SHM, in short)) then it is UET simply because with J=\left(\begin{array}[]{cc}0&I\\ -I&0\end{array}\right). We can now immediately strengthen this to : for every every non-empty collection of SHM’s is CUET via For more details one can see , particularly §6 and §7.
(, items 8.3, 8.4 and 8.5) tell us how to construct CUET tuples.
Let be a positive block matrix such that is CUET. Then is positive. To see this we first note that there is a unitary matrix such that for Let be the block matrix with for and for Then is unitary and So is positive.
Items (i)(b) and (ii) above can be put together to construct matrices with positive partial transposes, in short, PPT matrices.
Let be unitary bases for Then the following are equivalent.
is equivalent to
for some -associated tag and some -associated tag CUE
for each -associated tag there is a -associated tag such that CUE
(i) (iii), Suppose Then there exist and a relabelling of such that for Consider any and let be the -associated tag at and the -associated tag at Set Then and, therefore, for So CUE via
(iii) (ii) is trivial. (ii) (i), Let and be the -associated tag at and -associated tag at respectively with CUE Then by Remark 2.5(ii), there exist a and a bijective function on onto say such that for
Set Then Also Further, for
So is equivalent to ∎
Then there is a unique maximal family of -MASS’s, such that If each in has simple eigenvalues, then ’s are mutually disjoint.
Let be a unitary system and the family of -MASS’s as in (i). Then CUE via iff there is a bijective map on to say, such that CUE via
Let For any is an AUS Let and order it by inclusion. Then is made up of maximal elements of The second part follows from elementary Linear Algebra as indicated in Remark 2.9 (iv) below.
Suppose CUE via Then is a maximal family of -MASS’s with So, by uniqueness, each is some unique Set On the other hand, each is some unique So the map is bijective on to The converse part is trivial.
In view of Theorem 2.7, we may add a sixth condition to Theorem 1 of viz., collection of tagged unitary systems as follows: Tagged unitary systems i.e., any arbitrarily fixed a unitary and unitaries such that for in
Theorem 2.8 says that, to within CUE, we may think of as an invariant for a unitary system
The role of Hadamard matrices in these invariants has already been indicated above. To elaborate a bit, for each there is a unitary and a (partial) Hadamard matrix with such that consists of operators of the type is a diagonal matrix whose diagonal forms a row of The ordering of rows corresponds to that of operators in To within that is unique upto a permutation of columns, and the corresponding ’s will undergo changes accordingly. For each the augmented matrix formed by adding a top row of all ’s is also a Hadamard matrix and it arises from the -MASS with same in force.
It is now clear from (iii) above that if each in has simple eigenvalues, then ’s are mutually disjoint. This happens for the case and but may not be so for larger because the requirement is that eigenvalues of lie on the unit circle and (counted with multiplicities) add to zero. In the last section on examples for we give concrete situations. It is as if there is a fan of these subsets ’s (possibly overlapping) hinged at and, accordingly, a fan of abelian subspaces of (possibly overlapping), hinged at the linear span of
A -MASS of size together with generates a maximal abelian subalgebra of in short, a MASA in Theory of orthogonal MASA is well developed by , , . In fact, even defines an entropy between a pair of MASA’s and proves that are orthogonal if and only if takes the maximum value, and then the value is
Definitions and Discussion 2.10. (Fan representation & Hadamard fans).
In view of item 2.9 (iv) above, we call in Theorem 2.8 (i), the fan representation of One can figure out the -MASS fan representation through a common eigenvector system approach. It is neat when eigenvalues of each in are simple and becomes quite involved when some of them are multiple.
The family facilitated as in item 2.9 (iii) above, will be called the Hadamard fan of We note that if and are unitary systems with CUE then their Hadamard fans are the same to within a labelling of and permutation of rows and columns of
Let be a UB and is the tag of and Then will be called the fan system of We note that it follows from Theorem 2.7 and Theorem 2.8 that is an invariant for in the sense that if is a UB and is its fan system then if and only if to within CUE if and only if to within CUE
Let We call is the tag of the Hadamard fan system of We note that if and are UB’s with Hadamard fan systems and respectively, and if then The converse does not hold.
2.11. Maximally entangled state bases: The question that triggered this paper, in fact, is the following one in the context of maximally entangled states (MES) with phases. How to distinguish pairwise orthogonal systems of MES using local qantum operations supplemented by classical communication?
If one can figure out sets of pairwise orthogonal MES, locally unitarily connected up to global phases to the Bell basis then the task of distinguishing the states from the aforesaid sets is equivalent to that of distinguishing locally the Bell states.
(a) We now put the question in the language used in the beginning of this section. Let be an orthonormal basis in consisting of MES only. Do there exist unitaries a bijective function on to itself and a function on to such that where is the system as explained in Example 3.1(vii) in the next section.
(b) In view of the item 2.1 (v)(a), there exists a system of mutually orthogonal unitaries in such that for and further, by item 2.1(vii), for
Now is a unitary if is so. So the question reduces to: Do there exist unitaries and a function such that
In the terminology of item 2.1(ii): Does there exist a function on to such that is equivalent to We shall utilise the results and methods given above to answer this.
Definition 2.12. We call two unitary bases and phase-equivalent if there exists a function on to such that is equivalent to
Definition 2.13. For subsets and of we say is phase-collectively-unitarily equivalent to and write PCUE if there exists a function on to such that CUE where,
Remark 2.14. Let be a unitary system and be a function. Then
is a unitary system,
is abelian if and only if is abelian,
with is a -MASS if and only if is a -MASS, and
We can now have the obvious generalizations of Theorem 2.7, Theorem 2.8, item 2.9 and item 2.10 with obvious modifications of the corresponding proofs. Here is an illustration which will be strengthened further by examples in the next section.
Theorem 2.15. Let be unitary bases for Then the following are equivalent.
is phase equivalent to
For some -associated tag and some -associated tag PCUE
For each -associated tag there is a -associated tag such that PCUE
and have the same fan systems to within PCUE.
Examples
For let (or, at times, also written as or ) be the operator which takes to
Then is a UB. We note that its indexing set is Further, if and only if and for each In this case is a unitary system.
For we say commutes with and write it as if commutes with We now proceed to obtain maximal commuting subsets of (to be called -MASS’s) or, equivalently, of Let Then if and only if for if and only if for if and only if
and We call these conditions Latin criss-cross and Hadamard criss-cross respectively.
Latin squares. A latin square may be called a quasigroup in the sense that the binary operation ‘.’ on given by satisfies the condition that, given the equations and have unique solutions in one may see, for instance, the book by Smith for more details. Keeping this in mind we introduce a few notions for (a) An element of will be called a left identity if for in We note that a left identity, if it exists, is unique. Similar remarks apply to the notion and uniqueness of right identity. (b) is called associative if ‘’ is associative. (c) Elements in will be said to be commuting if (d) The centre of is We shall mainly consider latin squares arising from a group (with multiplication written as juxtaposition and identity written as ) or right divisors or left divisors in the group as follows: (e) (f) (g) for in Direct computations give the following. (h) A right (respectively, left) divisor latin square has as right (respectively, left) identity. Further, any such latin square has both right and left identity if and only if for each in if and only if is the same as (i) Any such is associative if and only if and coincide. (j) Elements in any such commute if and only if (k) In particular, if the number of elements in is an odd number then no two distinct elements in any such commute. We may have twisted version of (e), (f) and (g) as follows and then draw the same conclusions as above for them. (l) (m) (n) for in Let be the latin square defined by for in (o) Direct computations give that We may say that is an inverse-pair. We note that latin squares listed above may then be inverse-paired as and
Hadamard criss-cross. (a) We first consider the case Hadamard criss-cross becomes
Tags and Twills Contents of Section 2 tell us that it is -MASS’s for tags of that really help us. And -MASS’s help directly if (a scalar multiple of) is in simply because then apart from (the scalar multiple of) occurring in all -MASS’s, -MASS’s and -MASS’s are same. Let be a tag of As noted in Remark 2.2, for if and only if Twill viz., is satisfied. We now figure these out for some of the cases considered above. (a) Let Then for
So the Twill is equivalent to and , given by
respectively. We call them Latin twill and Hadamard twill respectively. We may re-write Hadamard twill in another form as
(b) For latin squares coming from group as in (iii) (e) above. Latin twill reduces to
For the inverse latin square arising as in (iii)(g) above, it is which on taking inverses, becomes
This gives us exactly -MASS’s and They are all full-size and mutually disjoint.
One may see more details in the papers referred to, particularly for where is a prime and
Each of the sets is a maximal commuting set in and accordingly is a -MASS. Their number is 3 for and for Each of the sets has cardinality So for they do overlap for some combinations. Sets and are pairwise disjoint. Some combinations of sets may have non-empty pairwise intersection. For instance, for and However, for odd are all pairwise disjoint, whereas, for even they are all pairwise disjoint except for containing one element, viz., ( ) in common. Finally, for co-prime with we have unique -MASS’s for and respectively.
(b) Move together and stand-alone technique. We note that
Thus move together in any -MASS. Now if and only if is even, say, and and then each of can be termed as a “stand alone”. We continue with the case
Now if and only if if and only if is even.
Similarly, if and only if is even.
Next if and only if is even. In particular, if and only if is even if and only if if and only if Finally, if and only if or if and only if or and if and only if or
We utilize these observations to compute -MASS’s for and
These are all disjoint. So we can try to extend them to -MASS’s by adjoining one of or We get
This gives us 7 -MASS’s with overlaps coming from or each one thrice. Figure 2 illustrates the situation.
-MASS’s are all of full-size. We have already seen in (a) above that they do overlap and the list above makes it all clear. Figure 3 gives an idea, where we have counted two points in a move-together as one as per our convenience for the figure.
Each unitary in occurs in exactly three of them. Figure 4 gives an idea. (ii) To within phases of and and relabelling, all tags have the same underlying unitary system (iii) To within PCUE, the fan system comes from (i). (iv) By Theorem 2.8 (together with Item 3.4 (iv) (b) below), the unitary basis here is not equivalent to the one in Example 3.1 (vii)(c).
Remark 3.3 The question of phase equivalence in the examples above will not present significantly new points because it amounts to multiplying different rows of the Hadamard matrix by different numbers of modulus one. If the latin square has a right identity then we can normalize this situation by keeping the -column in each Hadamard matrix consisting of one’s alone. In the particular case when comes from a group, we may choose the identity to be the first element and thus insist on the first row and the first column of each Hadamard matrix to consist of one’s alone. Example 3.4 For phase-equivalence the best set up is perhaps of nice unitary error bases defined by Knill . (i)As in (, §2) a nice unitary error basis on a Hilbert space of dimension is defined as a set where is unitary on is a group of order its identity, and By renormalizing the operators of the error basis, it can be assumed that in which case is a -th root of unity. Error bases with this property are called very nice. Such error bases generate a finite group of unitary operators whose centre consists of scalar multiples of the identity. An error group is a finite group of unitary operators generated by a nice unitary error basis and certain multiples of the identity. The group is an abstract error group if it is isomorphic to an error group. (ii) We quote Knill’s Theorem without proof. Theorem (, Theorem 2.1). The finite group is an abstract error group if and only if has an irredcucible character supported on the centre and the kernel of the associated irredcucible representation is trivial. (iii) These concepts have been intensively and extensively studied by researchers and also very efficiently utilised by some of them for constructing interesting examples of error-detecting (correcting) quantum codes. For this purpose, the rich theory of group actions, Weyl operators, Weyl commutation relations, multipliers, cocycles, bicharacters, imprimitivity systems has been found to be of great importance by them, particularly by K. R. Parthasarathy (who himself has contributed significantly to the theory for several decades, in fact). For a good account we may refer to his recent book and references like , and therein. (iv) The underlying projective representation in (i) viz., leads to some very useful facts. (a) For , and (b) For all tags the underlying unitary system is the same up to relabelling and phases. This permits us to consider the fan system the same as for any so as to say. In particular, we may drop from -MASS. In fact, it is enough to consider Further, figures above display the respective fan systems as well. (c) move together in any -MASS. We now proceed to strengthen this observation.
(v) Let be a group and its identity and a maximal commutative subset of Then is a subgroup of To see this well-known basic fact in group theory, we first note that can not be empty simply because for a in which is commutative. Now let Then for So by maximality of we have This gives that is a subgroup of We may say that is a maximal commutative subset of if and only if it is a maximal abelian subgroup of (vi) Let be a nice error group arising from a very nice error basis as in (i) above. We write by and also instead of for notaional convenience. Let be the subgroup of generated by the range of Then and, for Because for in whenever for some in and scalar we must have and So for if and only if if and only if and So, this condition is further equivalent to which, in turn is equivalent to for and that, in turn is equivalent to for some Thus, we have the following immediate consequences of (v) above. (a) is an AUS if and only if is a commutative subset of (b) is a -MASS if and only if is a maximal abelian subgroup of (c) Put and consider any function on to Set the -transversal. We note that is the first projection of any such as also of (d) Thus, the problem of finding MASS’s in is equivalent to that of finding maximal abelian subgroups of with different first projections. (e) Further development of the theory of projective representations of finite groups studied thoroughly by I. Schur in early 1900s is very vast and deep. The survey article by Costache gives a readable account. We will not go into details or utilise or cite scholarly papers and monographs in this paper. (vii) Klappenecker and Roetteler studied the following question of Schlingemann and Werner: Is every nice error basis (phase-) equivalent to a basis of shift-and-multiply type? They answered it in the negative by concrete examples using the theory of Heisenberg groups, theory of characters and projective representations of finite groups. One can attempt alternate proofs using our results and details from the theory of finite groups.
Applications to Quantum tomography
Quantum tomography is the study of identification of quantum states by means of a pre-assigned set of measurements. This set is usually taken to be a positive operator-valued measure (POVM) viz., a set of positive operators on with The quantum state on is then attempted to be determined via the tuple of measurements. Because we see that for any and thus, only measurements are needed. If we can determine all states on then is said to be informationally complete. For that has to be or more. Without going into details which one can see, for instance, in sources (, , , ) already referred to together with the fundamental work on Quantum designs by Zauner or recent papers like , , , , and , we come straight to the case when is informationally complete and all ’s except possibly one have rank one. We call them pure POVMs. The question as to how our results help in constructing such a POVM of optimal size was asked by K. R. Parthasarathy. We thank him for that and also his motivating discussion on the topic.
2. Discussion
(a) Three navy blue circles put together overlap with the remaining subsystems.
(b) Three maroon lines put together overlap with the remaining subsystems.
(c )Three yellow quadrilaterals put together can be combined with the middle and the outer circle. But, they overlap with green and sky-blue on the hexagon and also with maroon and navy-blue on the inner circle.
(d) Three sky-blue quadrilaterals put together can be combined with the middle and the inner circle. But, they overlap with green and yellow on the hexagon and also with maroon and navy-blue on the outer circle.
(e) Three green triangles put together can be combined with the inner and the outer circle. But, they overlap with yellow and sky-blue on the hexagon and also with maroon and navy-blue on the middle circle. (iii) As noted in Theorem 2.8 (i) above, if each in has simple eigenvalues, then ’s constituting the fan representation of are mutually disjoint. This is a situation similar to (i) above except that there is no guarantee that the sizes of ’s are all or, equivalently, that of is We do not yet have an example for that. In any case, the technique indicated in (i) above does give a pure POVM of size (iv) In general, for a composite which is not a prime power, or, even when is a prime power, a given may not be decomposable as in (i) above. This can be seen in Example 3.1 (v) (e) & Example 3.1 (vii) (e), and Example 3.1 (vii)(c) above respectively. Figures 1 and 3 make it clear that the whole fan is needed to cover and in Figure 2, only the red part can be ignored to obtain a smaller subset of the fan to cover . Once again, Theorem 2.8(i) and Remark 2.9(iv) tell us that overlapping ’s have to possess multiple eigenvalues. In the rest of this section we make an attempt to obtain pure POVM’s of optimal size for such situations. (v) What comes in handy for our purpose is a minimal subset, say, of satisfying We may write with if we like. A crude way to obtain a pure POVM would be to consider a common orthonormal eigenbasis for with and construct a pure POVM as in (i) above, say We can refine this construction to obtain a pure POVM of smaller size. We illustrate this refining process by means of examples.
3. Illustration
The context here is of Example 3.1 (vii). (i) In view of items (a) and (b) there and minimality of a crude bound for can be given as follows.
For odd For even It is interesting that for and Example 3.1 (vii)(c) and (e) show that is So by 4.2 (v) above, we can have a pure POVM of size We can improve upon this for certain even as we show in parts that follow.
Conclusion
We started with a unitary basis on a Hilbert space of dimension and an We associated the tag at where We obtained a covering of by maximal abelian subsets of (called MASS’s). We obtained the set of MASS’s for different concrete ’s displaying various patterns, like mutually disjoint, overlapping in different ways, and, therefore, called them fans. Varying the whole collection was called a fan system of We showed that it is an invariant of to within (phase) equivalence of unitary bases . The concept of collective unitary equivalence was utilised for this purpose. It was also used to construct positive partial transpose matrices. Finally, applications of fan to quantum tomography were indicated. Examples have been given to illustrate the results.
Acknowledgement
The second author expresses her deep sense of gratitude to K. R. Parthasarathy. She has learnt most of the basic concepts in this paper from him during his Seminar Series of Stat. Math. Unit at the Indian Statistical Institute, New Delhi, University of Delhi and elsewhere. She has gained immensely from insightful discussion sessions with him from time to time. She thanks V. S. Sunder and V. Kodiyalam for supporting her visit to The Institute of Mathematical Sciences (IMSc), Chennai to participate in their scholarly workshops on “Functional Analysis of Quantum Information Theory” in December, 2011 - January, 2012, “Planar algebras” in March-April, 2012 and Sunder Fest in April, 2012. This enabled her to learn more from experts at these events and initiate her interaction with her co-author. She also thanks R. Balasubramanian, Director, IMSc, for providing more such opportunities, kind hospitality, stimulating research atmosphere and encouragement all through. She thanks Indian National Science Academy for support under the INSA Senior Scientist and Honorary Scientist Programmes and Indian Statistical Institute, New Delhi for Visiting positions under these programmes together with excellent research atmosphere and facilities all the time. Finally, the authors thank Kenneth A. Ross for reading the paper and suggesting improvements. They also thank Mr. Anil Kumar Shukla for transforming the manuscript into its present LaTeX form, and for his cooperation and patience during the process.