Group-covariant extreme and quasi-extreme channels

• URL: http://arxiv.org/abs/2210.03449v1
• Date: Fri, 7 Oct 2022 10:43:19 GMT
• Title: Group-covariant extreme and quasi-extreme channels
• Authors: Laleh Memarzadeh, Barry C. Sanders
• Abstract summary: We introduce a systematic approach that enables us to construct exactly those extreme channels that are covariant with respect to a finite discrete group or a compact connected Lie group. 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Constructing all extreme instances of the set of completely positive trace-preserving (CPTP) maps, i.e., quantum channels, is a challenging valuable open problem in quantum information theory. Here we introduce a systematic approach that 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 quasi-extreme is accomplished by solving system of linear equations. 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.

Related papers

• Weyl channels for multipartite systems [42.37986459997699]
  Quantum channels describe unitary and non-unitary evolution of quantum systems. We show that these channels are completely characterized by elements drawn of finite cyclic groups.
  arXiv  Detail & Related papers  (2023-10-17T02:45:47Z)
• Concrete Quantum Channels and Algebraic Structure of Abstract Quantum Channels [0.0]
  An attempt is made to identify generalized invertible channels and also the idempotent channels. The motivation behind this study is its applicability to the reversibility of channel transformations. This is related to the coding-encoding problem in quantum information theory.
  arXiv  Detail & Related papers  (2023-05-19T06:45:41Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Accessible maps in a group of classical or quantum channels [0.0]
  We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the closure of the analyzed group $G structure are studied.
  arXiv  Detail & Related papers  (2022-01-29T08:06:21Z)
• Weighted Quantum Channel Compiling through Proximal Policy Optimization [0.0]
  We propose a strategy to compile arbitrary quantum channels without using ancillary qubits. We show that our proposed algorithm can conveniently and effectively reduce the use of expensive elementary gates.
  arXiv  Detail & Related papers  (2021-11-03T18:00:03Z)
• Quantum and classical dynamical semigroups of superchannels and semicausal channels [0.0]
  A superchannel is a linear map that maps quantum channels to quantum channels. No useful constructive characterization of the generators of such semigroups is known. We derive a normal for these generators using a novel technique.
  arXiv  Detail & Related papers  (2021-09-08T18:01:17Z)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Partition-based formulations for mixed-integer optimization of trained ReLU neural networks [66.88252321870085]
  This paper introduces a class of mixed-integer formulations for trained ReLU neural networks. At one extreme, one partition per input recovers the convex hull of a node, i.e., the tightest possible formulation for each node.
  arXiv  Detail & Related papers  (2021-02-08T17:27:34Z)
• LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
  Group equivariant neural networks are used as building blocks of group invariant neural networks. We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models. We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
  arXiv  Detail & Related papers  (2020-12-20T11:02:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.