Abstract
In the theory of quantum information, the mixed-unitary quantum channels, for any positive integer dimension n, are those linear maps that can be expressed as a convex combination of conjugations by \(n\times n\) complex unitary matrices. We consider the mixed-unitary rank of any such channel, which is the minimum number of distinct unitary conjugations required for an expression of this form. We identify several new relationships between the mixed-unitary rank N and the Choi rank r of mixed-unitary channels, the Choi rank being equal to the minimum number of nonzero terms required for a Kraus representation of that channel. Most notably, we prove that the inequality \(N\le r^2-r+1\) is satisfied for every mixed-unitary channel (as is the equality \(N=2\) when \(r=2\)), and we exhibit the first known examples of mixed-unitary channels for which \(N>r\). Specifically, we prove that there exist mixed-unitary channels having Choi rank \(d+1\) and mixed-unitary rank 2d for infinitely many positive integers d, including every prime power d. We also examine the mixed-unitary ranks of the mixed-unitary Werner–Holevo channels.
Similar content being viewed by others
Notes
See also Theorem 4.10 and Corollary 4.11 in [Wat18], which provides an alternative way to prove Buscemi’s bound. We note, in addition, that one can obtain a very slight improvement to Buscemi’s bound in the specific case \(r=n^2\) by observing that the bound \(N\le n^4 - 2n^2 + 2\) follows in a straightforward fashion from Carathéodory’s theorem, as is explained in Proposition 4.9 of [Wat18].
References
Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private quantum channels. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 547–553 (2000)
Ambainis, A., Smith, A.: Small pseudo-random families of matrices: derandomizing approximate quantum encryption. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 249–260. Springer, Berlin Heidelberg (2004)
Audenaert, K., Scheel, S.: On random unitary channels. New J. Phys. 10, 1–11 (2008)
Alberti, P., Uhlmann, A.: Stochasticity and Partial Order: Doubly Stochastic Maps and Unitary Mixing, volume 9 of Mathematics and Its Applications. D. Reidel Publishing Company, Dordrecht (1982)
Ben-Aroya, A., Schwartz, O., Ta-Shma, A.: Quantum expanders: motivation and constructions. In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pp. 292–303 (2008)
Buscemi, F., Chiribella, G., D’Ariano, G.M.: Inverting quantum decoherence by classical feedback from the environment. Phys. Rev. Lett. 95(9), 1 (2005)
Bennett, C.H., DiVincenzo, D.P., Smolin, J., Wootters, W.K.: Mixed-state entanglement and quantum error correction. Phys. Rev. A 54, 3824–3851 (1996)
Buscemi, F.: On the minimum number of unitaries needed to describe a random-unitary channel. Phys. Lett. A 360(2), 256–258 (2006)
Choi, M.-D.: Completely positive linear maps on complex matrices. Linear Algebra Appl. 10(3), 285–290 (1975)
Conway, J.: A Course in Operator Theory, volume 21 of Graduate Studies in Mathematics. American Mathematical Society, Providence (1999)
Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80(1), 012304 (2009)
Durt, T., Englert, B.G., Bengtsson, I., Życzkowski, K.: On mutually unbiased bases. Int. J. Quantum Inf. 8(4), 535–640 (2010)
DiVincenzo, D., Leung, D., Terhal, B.: Data hiding with classical communication. IEEE Trans. Inf. Theory 48, 580 (2001)
Duan, R., Severini, S., Winter, A.: Zero-error communication via quantum channels, noncommutative graphs, and a quantum Lovász number. IEEE Trans. Inf. Theory 59(2), 1164–1174 (2013)
Gurvits, L., Barnum, H.: Largest separable balls around the maximally mixed bipartite quantum state. Phys. Rev. A 66(6), 062311 (2002)
Gharibian, S.: Strong NP-hardness of the quantum separability problem. Quantum Inf. Comput. 10(3), 343–360 (2010)
Gurvits, L.: Classical deterministic complexity of Edmonds’ problem and quantum entanglement. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 10–19. ACM (2003)
Gregoratti, M., Werner, R.: Quantum lost and found. J. Mod. Opt. 50(67), 915–933 (2003)
Horn, R., Johnson, C.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1994)
Hayden, P., Leung, D., Shor, P., Winter, A.: Randomizing quantum states: constructions and applications. Commun. Math. Phys. 250(2), 371–391 (2004)
Haagerup, U., Musat, M.: Factorization and dilation problems for completely positive maps on von Neumann algebras. Commun. Math. Phys. 303(2), 555–594 (2011)
Hartman, A., Rosa, A.: Cyclic one-factorization of the complete graph. Eur. J. Comb. 6(1), 45–48 (1985)
Ioannou, L.: Computational complexity of the quantum separability problem. Quantum Inf. Comput. 7(4), 335–370 (2007)
Ivonovic, I.D.: Geometrical description of quantal state determination. J. Phys. A 14(12), 3241–3245 (1981)
Landau, L., Streater, R.: On Birkhoff’s theorem for doubly stochastic completely positive maps of matrix algebras. Linear Algebra Appl. 193(C), 107–127 (1993)
Li, C.-K., Tam, B.-S.: A note on extreme correlation matrices. SIAM J. Matrix Anal. Appl. 15(3), 903–908 (1994)
Lee, C., Watrous, J.: Detecting mixed-unitary quantum channels is NP-hard. arXiv:1902.03164 (2019)
Müller-Hermes, A., Reeb, D.: Monotonicity of the quantum relative entropy under positive maps. Ann. Henri Poincaré 18(5), 1777–1788 (2017)
Mendl, C., Wolf, M.: Unital quantum channels—convex structure and revivals of Birkhoff’s theorem. Commun. Math. Phys. 289(3), 1057–1086 (2009)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Nielsen, M.: Conditions for a class of entanglement transformations. Phys. Rev. Lett. 83(2), 436–439 (1999)
Paulsen, V.: Completely Bounded Maps and Dilations. Longman Scientific & Technical, Essex (1986)
Paulsen, V.: Completely Bounded Maps and Operator Algebras. Cambridge University Press, Cambridge (2003)
Rosgen, B.: Additivity and distinguishability of random unitary channels. J. Math. Phys. 49(10), 102107 (2008)
Smolin, J., Verstraete, F., Winter, A.: Entanglement of assistance and multipartite state distillation. Phys. Rev. A 72(5), 052317 (2005)
Tregub, S.: Bistochastic operators on finite-dimensional von Neumann algebras. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika 30(3), 75–55 (1986)
Watrous, J.: Mixing doubly stochastic quantum channels with the completely depolarizing channel. Quantum Inf. Comput. 9(5 &6), 403–413 (2009)
Watrous, J.: Theory of Quantum Information. Cambridge University Press, Cambridge (2018)
Wootters, W., Fields, B.: Optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2), 363–381 (1989)
Wilde, M.: Quantum Information Theory, 2nd edn. Cambridge University Press, Cambridge (2017)
Życzkowski, K., Horodecki, P., Sanpera, A., Lewenstein, M.: Volume of the set of separable states. Phys. Rev. A 58(2), 883–892 (1998)
Acknowledgements
The authors are grateful to Mizanur Rahaman and Jamie Sikora for helpful comments and discussions. MG, DL, VP, and JW acknowledge support from Canada’s NSERC. MG is partially supported by the Canadian Institute for Advanced Research and through funding provided to IQC by the Government of Canada. DL’s Research at Perimeter Institute is supported in part by the Government of Canada through the Department of Innovation, Science and Economic Development Canada and by the Province of Ontario through the Ministry of Colleges and Universities. CKL is supported by Simons Foundation Grant 351047.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by M. Christandl.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A. A characterization of Schur channels
A. A characterization of Schur channels
Two channels \(\Phi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) and \(\Psi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) are said to be unitarily equivalent if there exist unitary matrices \(U,V\in \mathcal {U}_n\) satisfying
for each \(X\in \mathcal {M}_n\). In this appendix we provide necessary and sufficient conditions that characterize when a channel is unitarily equivalent to a Schur channel in terms of the channel’s operator system. We conclude from this characterization that the channels in Examples 10 and 11 are not equivalent to Schur channels.
It is known that a channel is a Schur map if and only if every Kraus representation for the channel consists of only diagonal matrices. The following lemma provides another useful characterization for Schur channels.
Lemma 24
A channel \(\Phi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) is a Schur map if and only if \(\Phi (D)=D\) holds for each diagonal matrix \(D\in \mathcal {M}_n\).
Proof
If \(\Phi (D)=D\) holds for each diagonal matrix \(D\in \mathcal {M}_n\), then each Kraus matrix of \(\Phi \) must commute with each diagonal matrix, and thus each Kraus matrix must itself be diagonal. On the other hand, if \(\Phi \) is a Schur map then there is a correlation matrix \(C\in \mathcal {M}_n\) satisfying \(\Phi (X) = C\odot X\) for each \(X\in \mathcal {M}_n\). As each diagonal entry of C must be equal to one, it holds that \(\Phi (D) = D\) for each diagonal matrix \(D\in \mathcal {M}_n\). \(\quad \square \)
We now provide a necessary and sufficient condition for characterizing when a map is unitarily equivalent to a Schur map in terms of the operator system of the channel.
Theorem 25
Let \(\Phi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) be a channel. The following statements are equivalent.
-
1.
The channel \(\Phi \) is unitarily equivalent to a Schur map.
-
2.
The operator system \(\mathcal {S}_\Phi \) is a commuting family of matrices.
Proof
Let \(A_1,\dots ,A_N\in \mathcal {M}_n\) be linear matrices satisfying
for each \(X\in \mathcal {M}_n\). First suppose that \(\Phi \) is unitarily equivalent to a Schur map. There exist unitary matrices \(U,V\in \mathcal {U}_n\) such that the channel \(\Psi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) defined as \(\Psi (X) = U\Phi (VXV^*)U^*\) is a Schur map. The channel \(\Psi \) has a Kraus representation of the form
and thus \(UA_kV\) is a diagonal matrix for each \(k\in \{1,\dots ,N\}\). Moreover, each of the matrices in the collection
is also diagonal. It follows that \(\mathcal {S}_\Phi \) is a commuting family of normal matrices in \(\mathcal {M}_n\).
For the other direction, suppose that \(\mathcal {S}_\Phi \) is a commuting family. As \(\mathcal {S}_\Phi \) is self-adjoint, each matrix in \(\mathcal {S}_\Phi \) is also normal. There exists a unitary matrix \(V\in \mathcal {U}_n\) such that \(V^*A_j^*A_kV\) is a diagonal matrix for each pair of indices \(j,k\in \{1,\dots ,N\}\). For any two diagonal matrices \(D_0,D_1\in \mathcal {M}_n\), one has that
as each of the matrices in \(\{V^*A_j^*A_kV\,:j,k\in \{1,\dots ,N\}\}\) is diagonal and commutes with the diagonal matrices \(D_0\) and \(D_1\). Define matrices \(P_1,\dots ,P_n\in \mathcal {M}_n\) as
for each \(k\in \{1,\dots ,n\}\). For indices \(j,k\in \{1,\dots ,n\}\) with \(j\ne k\), one has that
as \(E_{j,j}E_{k,k}=0\). Moreover, it holds that \({\text {Tr}}(P_k)={\text {Tr}}(E_{k,k})=1\) and that \(P_k\) is positive for each \(k\in \{1,\dots ,n\}\) as \(\Phi \) is a quantum channel. The collection \(\{P_1,\dots ,P_n\}\subset \mathcal {M}_n\) is therefore an orthogonal set of positive matrices each with trace equal to 1. Hence there must exist a unitary matrix \(U\in \mathcal {U}_n\) such that \(UP_jU^* = E_{j,j}\) for each \(j\in \{1,\dots ,n\}\). Define a channel \(\Psi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) as
for each \(X\in \mathcal {M}_n\). From the observations above, one finds that \(\Psi (E_{k,k})=E_{k,k}\) for each \(k\in \{1,\dots ,n\}\), and thus \(\Psi (D)=D\) for each diagonal matrix \(D\in \mathcal {M}_n\). It follows that \(\Psi \) is a Schur map by Lemma 24. This completes the proof. \(\quad \square \)
Remark
Every unital quantum channel with Choi rank at most 2 is unitarily equivalent to a Schur map. This fact was proven in [LS93], but we remark that another proof of this fact can be found by making use of Theorem 25. Indeed, let \(\Phi :\mathcal {M}_n\rightarrow \mathcal {M}_n\) be a unital quantum channel for some positive integer n such that \({\text {rank}}(J(\Phi ))\le 2\). There exist matrices \(A_0,A_1\in \mathcal {M}_n\) such that
is a Kraus representation of \(\Phi \). As \(\Phi \) is unital and trace preserving, these matrices must satisfy \(A_0^*A_0 + A_1^*A_1 = \mathbbm {1}_n\) and \(A_0 A_0^* + A_1A_1^*=\mathbbm {1}_n\). The operator system of \(\Phi \) may be given by \(\mathcal {S}_\Phi ={\text {span}}\{A_0^*A_0,A_0^*A_1,A_1^*A_0,A_1^*A_1\}\), and it is straightforward to verify that each of these matrices commute with one another:
Rights and permissions
About this article
Cite this article
Girard, M., Leung, D., Levick, J. et al. On the Mixed-Unitary Rank of Quantum Channels. Commun. Math. Phys. 394, 919–951 (2022). https://doi.org/10.1007/s00220-022-04412-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00220-022-04412-y