English
Related papers

Related papers: Accessible maps in a group of classical or quantum…

200 papers

The momentum spectrum of a periodic network (quantum graph) has a band-gap structure. We investigate the relative density of the bands or, equivalently, the probability that a randomly chosen momentum belongs to the spectrum of the periodic…

Mathematical Physics · Physics 2013-11-21 Ram Band , Gregory Berkolaiko

A generalization of the Choi-Jamiolkowski isomorphism for completely positive maps between operator algebras is introduced. Particular emphasis is placed on the case of normal unital completely positive maps defined between von Neumann…

Quantum Physics · Physics 2019-08-13 Erkka Haapasalo

The auxiliary function of a classical channel appears in two fundamental quantities that upper and lower bound the error probability, respectively. A crucial property of the auxiliary function is its concavity, which leads to several…

Quantum Physics · Physics 2016-10-26 Hao-Chung Cheng , Min-Hsiu Hsieh

Due to Csiszar and Koerner, the private capacity of classical wiretap channels has a single-letter characterization in terms of the private information. For quantum wiretap channels, however, it is known that regularization of the private…

Quantum Physics · Physics 2021-06-29 Arkin Tikku , Mario Berta , Joseph M. Renes

The simplest building blocks for quantum computations are the qubit-qubit quantum channels. In this paper, we analyze the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of…

Mathematical Physics · Physics 2023-07-24 Attila Lovas , Attila Andai

The convex-transitivity property can be seen as a convex generalization of the almost transitive (or quasi-isotropic) group action of the isometry group of a Banach space on its unit sphere. We will show that certain Banach algebras,…

Operator Algebras · Mathematics 2015-01-23 María J. Martín , Jarno Talponen

Supermaps between quantum channels (completely positive trace-preserving (CPTP) maps of matrix algebras) were introduced in [Chiribella et al., EPL 83(3) (2008)]. In this work we generalise to supermaps between channels of any type; by…

Quantum Physics · Physics 2024-10-03 Robert Allen , Dominic Verdon

Quantum devices are subject to natural decay. We propose to study these decay processes as the Markovian evolution of quantum channels, which leads us to dynamical semigroups of superchannels. A superchannel is a linear map that maps…

Quantum Physics · Physics 2022-07-22 Markus Hasenöhrl , Matthias C. Caro

Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and…

Quantum Physics · Physics 2025-09-10 Graeme Smith , Peixue Wu

Extensions of the notions of polynomially and rationally convex hulls are introduced. Using these notions, a generalization of a result of Duval and Levenberg on polynomially convex hulls containing no analytic discs is presented. As a…

Complex Variables · Mathematics 2019-02-26 Alexander J. Izzo

Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…

Quantum Physics · Physics 2025-01-27 Eric Culf , Arthur Mehta

One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a…

Quantum Physics · Physics 2007-05-23 Frank Verstraete , Henri Verschelde

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

Group Theory · Mathematics 2021-05-14 Ihechukwu Chinyere , Gerald Williams

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli

We propose a generalized stochastic block model to explore the mesoscopic structures in signed networks by grouping vertices that exhibit similar positive and negative connection profiles into the same cluster. In this model, the group…

Social and Information Networks · Computer Science 2015-06-17 Jonathan Q. Jiang

Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with…

Geometric Topology · Mathematics 2017-11-15 Tetiana Osipchuk

In this letter, we prove that the classical capacity of quantum channel for $M$ symmetric states is achieved by an uniform distribution on a priori probabilities. We also investigate non-symmetric cases such as a ternary amplitude shift…

Quantum Physics · Physics 2009-10-31 Kentaro Kato , Masao Osaki , Osamu Hirota

We introduce moment maps for continuous unitary representations of general topological groups. For solvable separable locally compact groups, we prove that the closure of the image of the moment map of any representation is convex.

Representation Theory · Mathematics 2014-08-21 Daniel Beltita , Mihai Nicolae

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input…

Information Theory · Computer Science 2024-06-21 James Chin-Jen Pang , Sandeep Pradhan , Hessam Mahdavifar