English
Related papers

Related papers: Quantum-Channel Matrix Optimization for Holevo Bou…

200 papers

Network information theory is the study of communication problems involving multiple senders, multiple receivers and intermediate relay stations. The purpose of this thesis is to extend the main ideas of classical network information theory…

Quantum Physics · Physics 2012-08-22 Ivan Savov

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

Information Theory · Computer Science 2022-01-31 Remi A. Chou

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…

Quantum Physics · Physics 2016-05-30 Hirotada Kobayashi , Francois Le Gall , Harumichi Nishimura , Martin Roetteler

We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…

Quantum Physics · Physics 2019-05-06 Xin Wang , Kun Fang , Runyao Duan

We show how to use properties of the quantum conditional mutual information to obtain continuity bounds for information characteristics of quantum channels depending on their input dimension. First we prove tight estimates for variation of…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

This thesis focuses on the intersection of mathematical and computational optimization and quantum information. Main contributions are open-source software code: A hybrid approach mixing "traditional" nonconvex and convex methods can make…

Quantum Physics · Physics 2025-12-19 Benjamin Desef

The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using…

Quantum Physics · Physics 2021-07-02 Navneeth Ramakrishnan , Raban Iten , Volkher B. Scholz , Mario Berta

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the typical…

Quantum Physics · Physics 2009-11-10 Alberto Barchielli , Giancarlo Lupieri

The processing of quantum information is limited by fundamental physical constraints on how information can be encoded, transmitted, and extracted. In particular, the non-orthogonality of quantum states limits their distinguishability, and…

Quantum Physics · Physics 2025-10-17 André T. Cesário , Tiago Debarba

We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point,…

Quantum Physics · Physics 2016-08-16 Jaroslav Řeháček , Berthold-Georg Englert , Dagomir Kaszlikowski

When classical information is sent over a quantum channel, attaining the ultimate limit to channel capacity requires the receiver to make joint measurements over long codeword blocks. For a pure-state channel, we construct a receiver that…

Quantum Physics · Physics 2015-03-17 Saikat Guha

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

Quantum Physics · Physics 2026-04-16 Brian Doolittle , Felix Leditzky , Eric Chitambar

It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the…

Quantum Physics · Physics 2012-07-24 M. E. Shirokov

Quantum channels, also called quantum operations, are linear, trace preserving and completely positive transformations in the space of quantum states. Such operations describe discrete time evolution of an open quantum system interacting…

Quantum Physics · Physics 2011-10-04 Wojciech Roga

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…

Quantum Physics · Physics 2020-04-16 Narayanan Rengaswamy

We obtain continuity bounds for basic information characteristics of quantum channels depending on their input dimension (if it is finite) and on the input energy bound (if the input dimension is infinite). We pay a special attention to the…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

We show that information gain in a qubit measurement is optimal under a Von Neumann measurement. For an initially mixed apparatus kept in touch with a qubit, the conditions for achieving the equality sign of Holevo bound on the information…

Quantum Physics · Physics 2007-05-23 Nima Lashkari

Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these…

Quantum Physics · Physics 2012-08-10 M. E. Shirokov