English
Related papers

Related papers: General formulas for capacity of classical-quantum…

200 papers

In this paper we analyze the capacity of a general model for arbitrarily varying classical-quantum channels (AVCQCs) when the sender and the receiver use correlation as a resource. In this general model, a jammer has side information about…

Information Theory · Computer Science 2020-06-11 Holger Boche , Minglai Cai , Ning Cai

Determining whether a noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate is a challenging problem in quantum information theory. This is because it requires computation of the channel's coherent…

Quantum Physics · Physics 2024-10-24 Satvik Singh , Nilanjana Datta

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications…

Quantum Physics · Physics 2025-12-01 Vishal Singh , Theshani Nuradha , Mark M. Wilde

We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\epsilon > 0$ and privacy parameter $\delta > 0$ satisfy the…

Quantum Physics · Physics 2025-07-22 Zahra Baghali Khanian , Christoph Hirche

Any physical process can be represented as a quantum channel mapping an initial state to a final state. Hence it can be characterized from the point of view of communication theory, i.e., in terms of its ability to transfer information.…

Quantum Physics · Physics 2014-12-16 F. Caruso , V. Giovannetti , C. Lupo , S. Mancini

We investigate the use of noisy entanglement as a resource in classical communication via a quantum channel. In particular, we are interested in the question whether for any entangled state, including bound entangled states, there exists a…

Quantum Physics · Physics 2019-07-31 Stefan Bäuml , Andreas Winter , Dong Yang

Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a…

Quantum Physics · Physics 2019-10-30 S. Loomis , J. R. Mahoney , C. Aghamohammadi , J. P. Crutchfield

The full solution of the optimization problem giving the Gaussian capacity of the single-mode fiducial Gaussian quantum channel is provided. Since it was shown that the Gaussian capacity of an arbitrary (phase-sensitive or insensitive)…

Quantum Physics · Physics 2016-09-19 Joachim Schäfer , Evgueni Karpov , Oleg V. Pilyavets , Nicolas J. Cerf

If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…

Quantum Physics · Physics 2024-08-27 Paula Belzig

Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…

Information Theory · Computer Science 2018-04-23 Samad Khabbazi Oskouei , Stefano Mancini

Optical communication channels are ultimately quantum-mechanical in nature, and we must therefore look beyond classical information theory to determine their communication capacity as well as to find efficient encoding and decoding schemes…

Quantum Physics · Physics 2017-07-12 Felipe Lacerda , Joseph M. Renes , Volkher B. Scholz

We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the…

Quantum Physics · Physics 2013-05-29 Debbie Leung , Joungkeun Lim , Peter Shor

We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of…

Quantum Physics · Physics 2009-11-13 Maciej Demianowicz , Pawel Horodecki

In the classical theory of electromagnetism, the permittivity and the permeability of free space are constants whose magnitudes do not seem to possess any deeper physical meaning. By replacing the free space of classical physics with the…

Quantum Physics · Physics 2015-05-18 G. Leuchs , A. S. Villar , L. L. Sanchez-Soto

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…

Quantum Physics · Physics 2007-05-23 Peter W. Shor

We study mixed unitary quantum channels generated by irreducible projective unitary representations of finite groups. Under some assumptions on the probability distribution determining a mixture the classical capacity of the channel is…

Quantum Physics · Physics 2022-05-26 Grigori Amosov

We show how to compute or at least to estimate various capacity-related quantities for Bosonic Gaussian channels. Among these are the coherent information, the entanglement assisted classical capacity, the one-shot classical capacity, and a…

Quantum Physics · Physics 2007-05-23 A. S. Holevo , R. F. Werner

The quantum capacity of a quantum channel is always smaller than the capacity of the channel for private communication. However, both quantities are given by the infinite regularization of respectively the coherent and the private…

Quantum Physics · Physics 2015-07-28 David Elkouss , Sergii Strelchuk

For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel…

Information Theory · Computer Science 2017-10-31 Mustafa Kesal
‹ Prev 1 8 9 10 Next ›