English
Related papers

Related papers: Calculating a maximizer for quantum mutual informa…

200 papers

The transmission of classical information over a classical channel gave rise to the classical capacity theorem with the optimal rate in terms of the classical mutual information. Despite classical information being a subset of quantum…

Quantum Physics · Physics 2023-09-26 Zahra Baghali Khanian

We propose a protocol for multipartite secret sharing of quantum information through an \textit{amplitude damping} quantum channel. This network is, for example, of two organizations communicating with their own employees connected via…

Quantum Physics · Physics 2018-01-01 Siddhant Singh , Shivang Srivastava , Prasanta K. Panigrahi

In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted…

Quantum Physics · Physics 2009-11-10 Jian-Lan Chen , Le-Man Kuang

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…

Quantum Physics · Physics 2010-03-19 Francesco Buscemi , Nilanjana Datta

It is known that mutually unbiased bases, whenever they exist, are optimal in an information theoretic sense for the determination of unknown state of a quantum ensemble. These bases may not exist in most dimensions and some suboptimal…

Quantum Physics · Physics 2007-05-23 Manas Patra

Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…

Quantum Physics · Physics 2007-05-23 Michal Horodecki , Jonathan Oppenheim , Andreas Winter

Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the…

In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages…

Quantum Physics · Physics 2025-02-04 Yonghae Lee , Joonwoo Bae , Hayata Yamasaki , Soojoon Lee

The information carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space,…

Quantum Physics · Physics 2007-05-23 C. King

The work is devoted to study of quantum mutual information and coherent information -- the two important characteristics of quantum communication channel. Appropriate definitions of these quantities in the infinite-dimensional case are…

Mathematical Physics · Physics 2010-12-07 A. S. Holevo , M. E. Shirokov

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information…

Information Theory · Computer Science 2015-06-15 Holger Boche , Minglai Cai , Ning Cai , Christian Deppe

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…

We design quantum compression algorithms for parametric families of tensor network states. We first establish an upper bound on the amount of memory needed to store an arbitrary state from a given state family. The bound is determined by…

Quantum Physics · Physics 2021-09-28 Ge Bai , Yuxiang Yang , Giulio Chiribella

We propose two modified versions of the classical gradient ascent method to compute the capacity of finite-state channels with Markovian inputs. For the case that the channel mutual information is strongly concave in a parameter taking…

Information Theory · Computer Science 2020-06-09 Chengyu Wu , Guangyue Han , Venkat Anantharam , Brian Marcus

The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys.…

Communication over a noisy channel is often conducted in a setting in which different input symbols to the channel incur a certain cost. For example, for bosonic quantum channels, the cost associated with an input state is the number of…

Quantum Physics · Physics 2018-12-27 Dawei Ding , Dmitri S. Pavlichin , Mark M. Wilde

We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting".…

Quantum Physics · Physics 2016-09-08 Andreas Winter

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a…

Quantum Physics · Physics 2019-06-12 Spiros Kechrimparis , Tanmay Singal , Chahan M. Kropf , Joonwoo Bae

Currently, quantum reservoir computing is one of the most promising and experimentally accessible techniques for hybrid, quantum-classical machine learning. However, its applications are limited due to practical restrictions on the size of…

Quantum Physics · Physics 2022-05-11 Stephen Vintskevich , Dmitry Grigoriev
‹ Prev 1 3 4 5 6 7 10 Next ›