Group-covariant extreme and quasiextreme channels
Open Access
- 13 September 2022
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (3) , 033206
Abstract
Constructing all extreme instances of the set of completely positive trace-preserving (CPTP) maps, i.e., quantum channels, is a challenging and valuable open problem in quantum information theory. Here we introduce a systematic approach that, despite the lack of knowledge about the full parametrization of the set of CPTP maps on arbitrary Hilbert-spaced dimension, enables us to construct exactly those extreme channels that are covariant with respect to a finite discrete group or a compact connected Lie group. Innovative labeling of quantum channels by group representations enables us to identify the subset of group-covariant channels whose elements are group-covariant generalized-extreme channels. Furthermore, we exploit essentials of group representation theory to introduce equivalence classes for the labels and also partition the set of group-covariant channels. As a result, we show that it is enough to construct one representative of each partition. We construct Kraus operators for group-covariant generalized-extreme channels by solving systems of linear and quadratic equations for all candidates satisfying the necessary condition for being group-covariant generalized-extreme channels. Deciding whether these constructed instances are extreme or quasiextreme is accomplished by solving a system of linear equations. Proper labeling and partitioning the set of group-covariant channels leads to a novel systematic, algorithmic approach for constructing the entire subset of group-covariant extreme channels. We formalize the problem of constructing and classifying group-covariant generalized extreme channels, thereby yielding an algorithmic approach to solving, which we express as pseudocode. To illustrate the application and value of our method, we solve for explicit examples of group-covariant extreme channels. With unbounded computational resources to execute our algorithm, our method always delivers a description of an extreme channel for any finite-dimensional Hilbert space and furthermore guarantees a description of a group-covariant extreme channel for any dimension and for any finite-discrete or compact connected Lie group if such an extreme channel exists.Keywords
All Related Versions
Funding Information
- Sharif University of Technology (G930209)
- Natural Sciences and Engineering Research Council of Canada
- American Physical Society
This publication has 52 references indexed in Scilit:
- Simulating quantum dynamics on a quantum computerJournal of Physics A: Mathematical and Theoretical, 2011
- A Strong Converse for Classical Channel Coding Using Entangled InputsPhysical Review Letters, 2009
- Superadditivity of communication capacity using entangled inputsNature Physics, 2009
- Matrix product representations for all valence bond statesPhysical Review B, 2008
- Entanglement-enhanced information transmission over a quantum channel with correlated noisePhysical Review A, 2002
- One-to-one parametrization of quantum channelsPhysical Review A, 1999
- Universal Quantum SimulatorsScience, 1996
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Some remarks on covariant completely positive linear maps on C∗-algebrasReports on Mathematical Physics, 1979
- Local observables and particle statistics ICommunications in Mathematical Physics, 1971