English
Related papers

Related papers: Potential output purity of completely positive map…

200 papers

We study completely positive and trace-preserving equivariant maps between operators on irreducible representations of $\mathrm{SU}(2)$. We find asymptotic approximations of channels in the limit of large output representation and we…

Mathematical Physics · Physics 2025-08-28 Tommaso Aschieri , Błażej Ruba , Jan Philip Solovej

Quantum parameter estimation theory is an important component of quantum information theory and provides the statistical foundation that underpins important topics such as quantum system identification and quantum waveform estimation. When…

Quantum Physics · Physics 2024-12-24 Hendra I. Nurdin

Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel…

Information Theory · Computer Science 2019-01-08 Berksan Serbetci , Ali Emre Pusane

We introduce a resource monotone, the completeness stability, to quantify the quality of quantum measurements within a resource-theoretic framework. By viewing a quantum measurement as a frame, the minimum eigenvalue of a frame operator…

Quantum Physics · Physics 2026-01-21 Rakesh Saini , Jukka Kiukas , Daniel Burgarth , Alexei Gilchrist

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity",…

Mathematical Physics · Physics 2007-05-23 G. G. Amosov , A. S. Holevo , R. F. Werner

Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to…

Information Theory · Computer Science 2015-05-05 Radha Krishna Ganti , Andrew Thangaraj , Arijit Mondal

An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…

Mathematical Physics · Physics 2015-06-04 Marek Miller , Robert Olkiewicz

A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution,…

Information Theory · Computer Science 2024-09-13 Boaz Shuval , Ido Tal

For a quantum channel (completely positive, trace-preserving map), we prove a generalization to the infinite dimensional case of a result by Baumgartner and Narnhofer. This result is, in a probabilistic language, a decomposition of a…

Mathematical Physics · Physics 2016-08-03 Raffaella Carbone , Yan Pautrat

We reformulate the R\'enyi entanglement of purification as a constrained minimum output R\'enyi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More…

Quantum Physics · Physics 2026-05-18 Shokoufe Faraji , Zahra Baghali Khanian

By introducing an operator sum representation for arbitrary linear maps, we develop a generalized theory of quantum error correction (QEC) that applies to any linear map, in particular maps that are not completely positive (CP). This theory…

Quantum Physics · Physics 2009-10-21 A. Shabani , D. A. Lidar

We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for…

Quantum Physics · Physics 2009-11-10 Jaromir Fiurasek

This research is motivated by the study of the geometry of fractal sets and is focused on uniformization problems: transformation of sets to canonical sets, using maps that preserve the geometry in some sense. More specifically, the main…

Metric Geometry · Mathematics 2020-10-30 Dimitrios Ntalampekos

This paper proposes a direct, and simple approach to the H infinity norm calculation in more general settings. In contrast to the method based on the Kalman-Yakubovich-Popov lemma, our approach does not require a controllability assumption,…

Optimization and Control · Mathematics 2014-12-22 Seungil You , Ather Gattami

In this paper we shall introduce the mathematical framework for the description of measurements of quantum processes. Using this framework the process estimation problems can be treated in the similar way as the state estimation problems,…

Quantum Physics · Physics 2009-11-13 Mario Ziman

We prove a lemma which allows one to extend results about the additivity of the minimal output entropy from highly symmetric channels to a much larger class. A similar result holds for the maximal output $p$-norm. Examples are given showing…

Quantum Physics · Physics 2009-11-11 Motohisa Fukuda

In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong…

Quantum Physics · Physics 2026-05-27 Ian George , Christoph Hirche , Theshani Nuradha , Mark M. Wilde

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

We define different classes of local random quantum circuits (L-RQC) and show that: a) statistical properties of L-RQC are encoded into an associated family of completely positive maps and b) average purity dynamics can be described by the…

Quantum Physics · Physics 2015-06-15 Paolo Zanardi

Over binary input channels, uniform distribution is a universal prior, in the sense that it allows to maximize the worst case mutual information over all binary input channels, ensuring at least 94.2% of the capacity. In this paper, we…

Information Theory · Computer Science 2010-04-28 Emmanuel Abbe , Rethnakaran Pulikkoonattu
‹ Prev 1 8 9 10 Next ›