L\"uders Channels and the Existence of Symmetric Informationally Complete Measurements
John B. DeBrota, Blake C. Stacey

TL;DR
This paper links the existence of symmetric informationally complete measurements (SICs) in quantum mechanics to a specific depolarizing channel derived from L"uders channels, providing new conditions and optimality criteria.
Contribution
It establishes an if-and-only-if condition for SIC existence based on a depolarizing channel and shows this channel meets entropic optimality criteria.
Findings
Provides a necessary and sufficient condition for SIC existence.
Identifies a depolarizing channel associated with SICs.
Demonstrates entropic optimality of the channel.
Abstract
The L\"uders rule provides a way to define a quantum channel given a quantum measurement. Using this construction, we establish an if-and-only-if condition for the existence of a -dimensional Symmetric Informationally Complete quantum measurement (a SIC) in terms of a particular depolarizing channel. Moreover, the channel in question satisfies two entropic optimality criteria.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Lüders Channels and the Existence of Symmetric Informationally Complete Measurements
John B. DeBrota
Blake C. Stacey
University of Massachusetts Boston, Morrissey Boulevard, Boston MA 02125, USA
Abstract
The Lüders rule provides a way to define a quantum channel given a quantum measurement. Using this construction, we establish an if-and-only-if condition for the existence of a -dimensional Symmetric Informationally Complete quantum measurement (a SIC) in terms of a particular depolarizing channel. Moreover, the channel in question satisfies two entropic optimality criteria.
I Introduction
A minimal informationally complete (MIC) quantum measurement for a dimensional Hilbert space is a set of linearly independent positive semidefinite operators , , which sum to the identity DeBrota:2018a ; DeBrota:2018b . If every element in a MIC is proportional to a rank- projector, we say the MIC itself is rank-n. If the Hilbert–Schmidt inner products equal one constant for all and another constant when , we say the MIC is equiangular. A symmetric informationally complete (SIC) quantum measurement is a rank-1 equiangular MIC Zauner:1999 ; Renes:2004 ; Scott:2010 ; Fuchs:2017 . When a SIC exists, one can show that where are rank-1 projectors and that
[TABLE]
The theory of quantum channels provides a means to discuss the fully general way in which quantum states may be transformed. A standard result Nielsen:2010 has it that a quantum channel may always be specified by a set of operators , called Kraus operators, such that for a quantum state ,
[TABLE]
Consider a physicist Alice who is preparing to send a quantum system through a channel that she models by . Alice initially describes her quantum system by assigning to it a density matrix . The state encodes Alice’s expectations for measurements that can potentially be performed after the system is sent through the channel. More specifically, let Alice’s channel be a Lüders MIC channel (LMC) associated with the MIC , which may be understood in the following way. Alice plans to apply the MIC , and upon obtaining the result of that measurement, invoke the Lüders rule Barnum:2000 ; Busch:2009 to obtain a new state for her system,
[TABLE]
where we have introduced the principal Kraus operators , the unique positive semidefinite square roots of the MIC elements. Before applying her MIC, Alice can write the post-channel state
[TABLE]
which is a weighted average of the states from which Alice plans to select the actual state she will ascribe to the system after making the measurement. (For more on the broader conceptual context of this operation, see Fuchs:2012 ; Stacey:2019 .)
LMCs are a proper subset of all quantum channels as many valid channels are unrelated to a MIC and do not admit a representation in terms of principal Kraus operators. For example, a unitary channel is not an LMC.
Throughout this paper, we will frequently use the fact that any MIC element is proportional to a density matrix , where we call the proportionality constants the weights of the MIC. Because the sum to the identity, the weights sum to the trace of the identity, which is just the dimension .
We refer to the LMC obtained from a SIC as the SIC channel . We may characterize the SIC channel in any dimension in which a SIC exists using the convenient notion of a dual basis. Given a basis for a vector space, any vector in that space is uniquely identified by its inner products with the basis elements. These inner products are the coefficients in the expansion of the vector over the elements of the dual basis. Likewise, the inner products with the elements of the dual basis are the coefficients in the expansion over the original basis. A consequence of this is that, if denotes the original basis and denotes its dual basis, then
[TABLE]
It follows that if is a SIC, then the dual basis is given by
[TABLE]
so we may write an operator in the SIC basis as
[TABLE]
Noting that and that , we obtain
[TABLE]
and so for any quantum state ,
[TABLE]
Going forward, given an LMC and input state , let denote the eigenvalue spectrum of the post-channel state and denote the maximum eigenvalue of this state. We use the notation to denote the average value of the function over all pure state inputs with respect to the Haar measure. We now prove a lemma applicable to arbitrary LMCs upon which our later results rely.
Lemma 1**.**
Let be an LMC. Then
[TABLE]
Proof.
For an arbitrary pure state ,
[TABLE]
We may lower bound given such an input as follows:
[TABLE]
If we now average over all pure states with the Haar measure, we will produce a generic lower bound on the average maximal eigenvalue of the post-channel state:
[TABLE]
We can evaluate this integral using a known property of the Haar measure Renes:2004 . Integrating a tensor power over pure state projectors gives a result proportional to the projector onto the symmetric subspace of . Consequently,
[TABLE]
Using the fact that
[TABLE]
one may verify that
[TABLE]
Thus equation (14) becomes
[TABLE]
Now since and ,
[TABLE]
∎
The following theorem reveals that the SIC channel’s action is unique to SICs among LMCs.
Theorem 1**.**
A SIC exists in dimension iff there is an LMC with action for all .
Proof.
If a SIC exists, take . For the other direction, we will first demonstrate that the MIC which gives rise to this LMC must be rank-. Having established this, we will be able to see that the unitaries relating different Kraus operators for this LMC are directly related to the MIC weights. This will allow us to show that the principal Kraus operators have the Gram matrix of a SIC and must form a SIC themselves.
For any pure state input,
[TABLE]
Thus the lower bound in Lemma 1 is saturated. This can only occur when for all which implies that the MIC is rank-1.
In Appendix A we define and construct the quasi-SICs, that is, sets of Hermitian, but not necessarily postive semidefinite, matrices which have the same Hilbert–Schmidt inner products as SIC projectors, and we demonstrate that they furnish a Hermitian basis of constant-trace Kraus operators which give the same action as . Any other set of Kraus operators with the same effect will be related to this set by a unitary remixing, and since is an LMC, we must have
[TABLE]
Since we know the MIC is rank-, we can trace both sides of this expression to obtain the identity . Furthermore, since the form a Hermitian basis, one may see that every element of must be real, rendering an orthogonal matrix. Then
[TABLE]
When , we have
[TABLE]
and so
[TABLE]
and because is rank-,
[TABLE]
that is, the MIC is a SIC. ∎
II Depolarizing Lüders MIC Channels
The SIC channel falls within a class of channels called depolarizing channels Wilde:2017 . A depolarizing channel is a channel
[TABLE]
The SIC channel corresponds to . One might wish to know when an LMC is a depolarizing channel. From Theorem 1, we know the only LMC with is the SIC channel. What range of are achievable by LMCs?
The answer to this question is any . To see this, note that the eigenvalue spectrum for a depolarizing channel given a pure state input is
[TABLE]
Recall the lower bound on the average maximal eigenvalue for any LMC given a pure state input from Lemma 1 is . As the spectrum for a depolarizing channel is constant for pure state inputs, the lower bound on the average is the lower bound for any pure state input. If , then . The more negative is, the larger the maximal eigenvalue would be, so the largest it can get is when , in which case . So, . When , the channel is the identity channel, in other words, not depolarizing at all. It is easy to prove that were this to be implemented by an LMC, it would require , but this does not lead to a linearly independent set and is not a MIC. If a SIC exists, however, a depolarizing LMC exists for any , as the next proposition shows.
Proposition 1**.**
Suppose a SIC exists in dimension . For a nonzero satisfying
[TABLE]
or, equivalently,
[TABLE]
the MIC
[TABLE]
where is a SIC projector, gives rise to the LMC
[TABLE]
One may check that the principal Kraus operators associated with the MIC elements (29) are given by
[TABLE]
and then a routine calculation and the characterization of the SIC channel from Theorem 1 confirms the claim of the proposition.
Remark 1**.**
When , the MIC is the original SIC, whereas when equals its minimum allowed value , it is the rank- equiangular MIC
[TABLE]
indirectly noted in prior work DeBrota:2018b ; Zhu:2016 ; DeBrota:2017 for extremizing a nonclassicality measure based on negativity of quasi-probability.
Do any LMCs give rise to depolarizing channels in dimensions where one does not have access to a SIC? If we replace the SIC projector in equation (31) with a quasi-SIC, we may form Kraus operators effecting the same depolarizing channel,
[TABLE]
From (59), one can check that these will square to a valid MIC. For arbitrary , however, may fail to be positive semidefinite and would therefore not be a principal Kraus operator. From the definition of a quasi-SIC, one sees that the eigenvalues of are bounded below by . Even in this worst case, one can easily derive that will be positive semidefinite for any nonzero . This range of entitles any . (The minimal is obtained from the most negative .) When , this minimal matches the lower bound achieved by the SIC channel because every quasi-SIC is a SIC in this dimension, but for all the inequality is strict and monotonically increases with dimension. In practice, the minimal eigenvalue among all of the quasi-SIC operators one constructs will be significantly larger than , and so, depending on how close to a SIC one can make their quasi-SIC, one should be able to get significantly closer to the SIC bound than the we have derived.
Fully classifying the MICs giving depolarizing LMCs for particular values of appears to be a difficult problem; it is not clear what properties these MICs must satisfy. For example, squaring the operators from equation (33) results in MICs which are dependent on one’s quasi-SIC implementation and need not be equiangular as the family in equation (29) was. All principal Kraus operators which give rise to a depolarizing channel with a given (and corresponding ) will be related to the operators (33) by way of a unitary remixing satisfying
[TABLE]
for some unitary . As in the proof of Theorem 1, all the elements of the unitary must be real and so it is actually an orthogonal matrix. We have not been able to identify any further necessary characteristics of the in the completely general case, but the following notable restriction yielded further structure. A MIC is unbiased if the traces of all the elements are equal, that is, if for all . MICs in this class have the property that their measurement outcome probabilities for the “garbage state” input is the flat probability distribution over outcomes. From the standpoint of DeBrota:2018a , this means they preserve the intution that the state should correspond to a prior with complete outcome indifference in a reference process scenario and accordingly warrant special attention. If we demand that be unbiased, then it is necessary, but not sufficient, that the orthogonal matrix remixing (33) be doubly quasistochastic (see Appendix B).
III Entropic Optimality
One way to evaluate the performance of a quantum channel is by using measures based on von Neumann entropy,
[TABLE]
In this section, we consider two such, proving in each case an optimality result for LMCs constructed from SICs. To understand the conceptual significance of the bounds we will derive, consider again Alice who is preparing to send a quantum system through an LMC. Alice initially ascribes the quantum state to her system, and before sending the system through the channel, she computes . After eliciting a measurement outcome, Alice will update her quantum-state assignment, not to but rather to whichever corresponds to the outcome that actually transpires. The state will generally be mixed, while will be a pure state in the case of a rank-1 MIC. This change from mixed to pure represents a sharpening of Alice’s expectations about her quantum system. We can quantify this in entropic terms, even for MICs that are not rank-1. In fact, for pure state inputs we can calculate Alice’s typical sharpening of expectations by averaging the post-channel von Neumann entropy over the possible input states using the Haar measure, denoted . We will see that SIC channels give the largest possible typical sharpening of expectations.
In the following we make use of a partial ordering on real vectors arranged in nonincreasing order called majorization Marshall:2011 . A real vector rearranged into nonincreasing order is written as . Then we say a vector majorizes a vector , denoted , if all of the leading partial sums of are greater than or equal to the leading partial sums of and if the sum of all the elements of each is equal. Explicitly, if
[TABLE]
for and . Speaking heuristically, if , then is a flatter vector than . A Schur convex function is a function satisfying the implication . A function is strictly Schur convex if the inequality is strict when . When the inequality is reversed the function is called Schur concave.
Theorem 2**.**
Let be an LMC. with equality achievable if a SIC exists in dimension .
Proof.
From Lemma 1, we know that the average maximal eigenvalue for the output of an arbitrary LMC given a pure state input is lower bounded by . This implies
[TABLE]
The Shannon entropy is a concave and Schur concave function of probability distributions. Furthermore, the von Neumann entropy of a density matrix is equal to the Shannon entropy of its eigenvalue spectrum. Using these facts we have
[TABLE]
If a SIC exists, taking achieves this upper bound. ∎
Theorem 2 would have been more forceful if the upper bound were saturated “only if” a SIC exists, but we were unable to demonstrate this property, and so we leave it as a conjecture:
Conjecture 1**.**
Equality is achievable in the statement of Theorem 2 only if a SIC exists in dimension .
We were, however, able to prove a strong SIC optimality result in the setting of bipartite systems, applicable for example to Bell-test scenarios. The entropy exchange for a channel upon input by state is defined Nielsen:2010 to be the von Neumann entropy of the result of sending one half of a purification of , , through the channel:
[TABLE]
Theorem 3**.**
Let be an LMC. Then with equality achievable iff a SIC exists in dimension .
Proof.
The purification of the state is the maximally entangled state . Let be the eigenvalues of arranged in nonincreasing order. We may lower bound the maximal eigenvalue as follows:
[TABLE]
Thus,
[TABLE]
The upper bound now follows from the Schur concavity of von Neumann entropy.
If a SIC exists, it is easy to verify that
[TABLE]
which saturates the upper bound. Von Neumann entropy is strictly Schur concave Bosyk:2016 , so the upper bound is saturated iff . Equation (40) shows that is the maximal eigenstate and that is a rank- MIC in the same way as in Theorem 1. By the spectral decomposition, we may write
[TABLE]
where are projectors into the other eigenstates. As the full set of projectors forms a resolution of the identity, we have
[TABLE]
so
[TABLE]
It follows from (57) in Appendix A that
[TABLE]
where the are elements of a quasi-SIC. From the previous expression we now have
[TABLE]
Applying directly to equation (46) gives us
[TABLE]
where we used that every LMC is unital and that . Comparing equations (47) and (48), we may see that
[TABLE]
by multiplying both sides by and tracing over the first subsystem. The quasi-SICs form a basis for operator space, so it follows by linearity that
[TABLE]
and so by Theorem 1 we are done. ∎
IV Conclusions
In prior works we have emphasized the importance of MICs as a special class of measurements. The considerations of this paper developed from the idea that MICs may naturally furnish important classes of quantum channels as well. We affirmed this intuition with the introduction of LMCs which enabled us to discover several new ways in which SICs occupy a position of optimality among all MICs, supposing they exist. The appearance of additional equivalences with SIC existence plays two important roles. First, it should aid those trying to prove the SIC existence conjecture in all finite dimensions, and second, to our minds, it suggests that LMCs are a more important family of quantum channels than has been realized. We hope this work will inspire more study of LMCs and other types of channels derived from MICs not investigated here.
One example of such an alternative is a procedure where, when the agent implementing the channel applies the MIC, they reprepare the measured system in such a way that they ascribe a fixed quantum state to it, the choice of new state being made based on the measurement outcome. The action of such a channel is
[TABLE]
where the states are the new preparations applied in consequence to the measurement outcomes. Channels defined by a POVM and a set of repreparations are known as entanglement-breaking channels Ruskai:2003 . When the POVM is a MIC, we can speak of an entanglement-breaking MIC channel (EBMC). EBMCs coincide with LMCs for rank-1 MICs and repreparations proportional to the MIC, but not in general. While earlier work already gives some indication that SIC channels are significant among EBMCs DeBrota:2018a , we suspect that there is much more to be discovered about EBMCs as a class.
Acknowledgments
We gratefully acknowledge helpful conversations with Gabriela Barreto Lemos, Christopher A. Fuchs and Jacques Pienaar. Also we thank two anonymous referees for identifying points that required clarification and locating an error in our original proof of Lemma 1. This research was supported in part by the John Templeton Foundation. The opinions expressed in this publication are those of the authors and do not necessarily reflect the views of the John Templeton Foundation. JBD was supported by grant FQXi-RFP-1811B of the Foundational Questions Institute.
Postscript
Due to a breakdown of our university email system, it was not until after Physical Review A published this article that we became aware of the preprint “Entanglement Breaking Rank” by Pandey et al. Pandey:2018 . Their Corollary 3.3 is equivalent to our Theorem 1, albeit proved from a different starting point. They consider all channels having the same action as and ask when those channels can be achieved using only rank-1 Kraus operators. We consider channels defined by Kraus operators (of arbitrary rank) and ask when they can have the action of the SIC channel. We regret this oversight, and we commend their paper to the reader’s attention. The silver lining is that we can now say the SIC problem has attracted sufficient interest that the literature is not easy to keep up with. Moreover, our attention having been called back to this paper after an interlude thinking about other aspects of SICs, we now believe that Conjecture 1 can be proven for the special case of unbiased LMCs in . We now sketch the argument here.
Consider a MIC whose elements are constructed by taking the orbit of an operator under the action of a discrete group of unitaries. Such a MIC is known as group covariant and is necessarily unbiased. If is a set covariant with respect to the same group as the MIC, then the post-channel states are unitarily equivalent and thus isospectral. We have the eigenvalue bound
[TABLE]
In the case that the states comprise a SIC and the LMC is unbiased and rank-1, that is, the MIC elements take the form , we can evaluate this bound by transferring the unitary transformations from the LMC elements to the SIC states:
[TABLE]
Supposing the entropic bound in Theorem 2 is saturated, then the MIC must be rank-1, and the average maximum eigenvalue is equal to . If a SIC exists, then the discrete average of the maximum eigenvalue over the SIC-state inputs is equal to the continuous average over all pure states, because a SIC is a 2-design. Therefore, if a SIC exists and the entropic bound is saturated, then the maximum eigenvalue of each post-channel state for any SIC-state input is exactly . In addition, the eigenvector of the post-channel state corresponding to this eigenvalue is the SIC-state input itself.
Eigenvalue information is most helpful in . Knowing the maximum eigenvalue fixes the only other eigenvalue, and from the above, we have the complete eigendecomposition of the post-channel state for any SIC-state input. From here, we can essentially do quantum channel tomography, fixing by linearity the action of the channel.
A careful study of Bloch-sphere geometry shows that an unbiased rank-1 MIC in is necessarily group covariant, and in fact is unitarily equivalent to a MIC covariant under the Pauli group. Therefore, knowing that an LMC in is unbiased and that the entropic bound is saturated, we know the MIC is group covariant, and the above argument applies.
Appendix A
Here we define and construct the quasi-SICs which furnish the Kraus operators needed in Theorem 1 and which were referenced in Theorem 3. Although SIC existence is not assured, one may always form a quasi-SIC in any finite dimension . A quasi-SIC is a set of Hermitian operators obeying the same Hilbert–Schmidt inner product condition as the SIC projectors. As positivity is not demanded, it is relatively easy to construct a quasi-SIC as follows Appleby:2017 . Start with an orthonormal basis for the Lie algebra of traceless Hermitian operators. With the Hilbert–Schmidt inner product this space is a -dimensional Euclidean space, so it is possible to construct a regular simplex consisting of normalized traceless Hermitian operators. In this case when . Then the operators
[TABLE]
form a quasi-SIC.
It turns out that give a set of Kraus operators such that
[TABLE]
or, more generally, for an arbitrary operator ,
[TABLE]
that is, equivalent to the action of . To see this, first observe from Corollary 1 in Appleby:2015 that
[TABLE]
where indicates the partial transpose over the second subsystem. Then, with the help of the vectorized notation for an operator and the identity , we have
[TABLE]
which is equivalent to (56). Sending through equation (56) reveals the identity
[TABLE]
which, since the quasi-SICs are Hermitian, is equivalent to the requirement that Kraus operators satisfy .
Appendix B
A doubly quasistochastic matrix is a matrix of real numbers whose rows and columns sum to . If we assume that is an unbiased MIC, , we will now show that is furthermore doubly quasistochastic.
The Gram matrix for the operators (33) is
[TABLE]
where
[TABLE]
Since , we have
[TABLE]
from which we obtain
[TABLE]
Now note that
[TABLE]
Tracing both sides of (34) reveals that is a constant. Corollary 3 from Appleby:2015 then asserts that
[TABLE]
Summing equation (33) gives
[TABLE]
As the form a linearly independent set, combining the previous two equations requires
[TABLE]
Thus is doubly quasistochastic, as claimed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) J. B. De Brota, C. A. Fuchs and B. C. Stacey, “Symmetric informationally complete measurements identify the irreducible difference between classical and quantum systems,” Physical Review Research 2 (2020), 013074 , ar Xiv:1805.08721 [] . · doi ↗
- 2(2) J. B. De Brota, C. A. Fuchs and B. C. Stacey, “Analysis and Synthesis of Minimal Informationally Complete Quantum Measurements,” ar Xiv:1812.08762 [] (2018).
- 3(3) G. Zauner, Quantendesigns. Grundzüge einer nichtkommutativen Designtheorie . Ph D Thesis, University of Vienna (1999), http://www.gerhardzauner.at/qdmye.html .
- 4(4) J. M. Renes, R. Blume-Kohout, A. J. Scott and C. M. Caves, “ Symmetric Informationally Complete quantum measurements ,” Journal of Mathematical Physics 45 (2004), 2171–80, ar Xiv:quant-ph/0310075 [] . · doi ↗
- 5(5) A. J. Scott and M. Grassl, “ Symmetric informationally complete positive-operator-valued measures: A new computer study ,” Journal of Mathematical Physics 51 (2010), 042203, ar Xiv:0910.5784 [] . · doi ↗
- 6(6) C. A. Fuchs, M. C. Hoang and B. C. Stacey, “ The SIC question: History and state of play ,” Axioms 6 (2017), 21, ar Xiv:1703.07901 [] . · doi ↗
- 7(7) M. A. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2010).
- 8(8) H. Barnum, “Information-disturbance tradeoff in quantum measurement on the uniform ensemble and on the mutually unbiased bases,” ar Xiv:quant-ph/0205155 [] (2000).
