Quasirandom quantum channels
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense graphs, two such properties known as spectral expansion and uniformity were shown to be equivalent in seminal 1989 work of Chung, Graham and Wilson. Recently, Conlon and Zhao extended this equivalence to the case of sparse vertex transitive graphs using the famous Grothendieck inequality. Here we generalize these results to the non-commutative, or “quantum”, case, where a transition matrix becomes a quantum channel. In particular, we show that for irreducibly covariant quantum channels, expansion is equivalent to a natural analog of uniformity for graphs, generalizing the result of Conlon and Zhao. Moreover, we show that in these results, the non-commutative and commutative (resp.) Grothendieck inequalities yield the best-possible constants.
|15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Bannink, T.R, Briët, J, Labib, F.S, & Maassen, H. (2020). Quasirandom quantum channels. In Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.TQC.2020.5