English
Related papers

Related papers: Qubit Channels Which Require Four Inputs to Achiev…

200 papers

Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the…

Quantum Physics · Physics 2009-01-14 Christopher King , Keiji Matsumoto , Michael Nathanson , Mary Beth Ruskai

We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…

Quantum Physics · Physics 2009-11-13 Michael M. Wolf , David Perez-Garcia

For all p > 1, we demonstrate the existence of quantum channels with non-multiplicative maximal output p-norms. Equivalently, for all p >1, the minimum output Renyi entropy of order p of a quantum channel is not additive. The violations…

Quantum Physics · Physics 2012-07-06 Patrick Hayden , Andreas Winter

Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived…

Quantum Physics · Physics 2009-11-07 Garry Bowen

In this article, we investigate the additivity phenomenon in the dynamic capacity of a quantum channel for trading classical communication, quantum communication and entanglement. Understanding such additivity property is important if we…

Quantum Physics · Physics 2017-08-17 Elton Yechao Zhu , Quntao Zhuang , Min-Hsiu Hsieh , Peter W. Shor

A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…

Quantum Physics · Physics 2013-05-29 Robert Koenig , Stephanie Wehner

Additivity of minimal entropy output is proven for the class of quantum channels $\Lambda_t (A):=t A^{T}+(1-t)\tau (A)$ in the parameter range $-2/(d^2-2)\le t \le 1/(d+1)$.

Quantum Physics · Physics 2007-05-23 M. Fannes , B. Haegeman , M. Mosonyi , D. Vanpeteghem

Quantum channel capacity is a fundamental quantity in order to understand how good can quantum information be transmitted or corrected when subjected to noise. However, it is generally not known how to compute such quantities, since the…

Quantum Physics · Physics 2023-09-20 Josu Etxezarreta Martinez , Antonio deMarti iOlius , Pedro M. Crespo

Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo-Werner…

Quantum Physics · Physics 2018-11-15 Thomas P. W. Cope , Kenneth Goodenough , Stefano Pirandola

Fundamental limits on communication rates over quantum channels are given by mathematical expressions involving entropic formulas. Often, it is unclear if these expressions are computable. This thesis describes contributions to the study of…

Quantum Physics · Physics 2023-04-28 Mohammad A. Alhejji

We introduce two additive invariants of output quantum channels. If the value of one these invariants is less than 1 then the logarithm of the inverse of its value is a positive lower bound for the regularized minimum entropy of an output…

Quantum Physics · Physics 2009-02-12 Shmuel Friedland

Inspired by the ideas from the field of stochastic approximation, we propose a randomized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with…

Information Theory · Computer Science 2013-03-18 Guangyue Han

We study mixed unitary channels generated by finite subgroups of the group of all unitary operators in a Hilbert space. Based on the majorization theory we introduce techniques allowing to calculate different characteristics of output…

Quantum Physics · Physics 2024-01-11 Grigori Amosov

The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for non-degradable quantum channels. We introduce the set of partially…

Quantum Physics · Physics 2016-11-15 Laszlo Gyongyosi

Recent research has demonstrated significant achievable performance gains by exploiting circularity/non-circularity or propeness/improperness of complex-valued signals. In this paper, we investigate the influence of these properties on…

Information Theory · Computer Science 2016-11-17 Georg Tauboeck

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

Computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity…

Quantum Physics · Physics 2025-01-22 Chengkai Zhu , Renfeng Peng , Bin Gao , Xin Wang

Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both…

Quantum Physics · Physics 2019-11-06 Li Gao , Marius Junge , Nicholas LaRacuente

A simple criterion for local equality between the constrained Holevo capacity and the quantum mutual information of a quantum channel is obtained. It implies that the set of all states for which this equality holds is determined by the…

Quantum Physics · Physics 2015-08-04 M. E. Shirokov

Can quantum entanglement increase the capacity of (classical) covert channels? To one familiar with Holevo's Theorem it is tempting to think that the answer is obviously no. However, in this work we show: quantum entanglement can in fact…

Cryptography and Security · Computer Science 2022-02-07 David Mestel
‹ Prev 1 3 4 5 6 7 10 Next ›