English
Related papers

Related papers: The private capacity of quantum channels is not ad…

200 papers

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this paper the use of classical feedback is shown to provide no increase in the…

Quantum Physics · Physics 2007-05-23 Garry Bowen , Rajagopal Nagarajan

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by…

Quantum Physics · Physics 2009-09-30 Nilanjana Datta , Yurii Suhov , Tony C. Dorlas

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

The quantum capacity of a quantum channel captures its capability for noiseless quantum communication. It lies at the heart of quantum information theory. Unfortunately, our poor understanding of nonadditivity of coherent information makes…

Quantum Physics · Physics 2018-12-07 Felix Leditzky , Debbie Leung , Graeme Smith

We investigate the capacity of three symmetric quantum states in three real dimensions to carry classical information. Several such capacities have already been defined, depending on what operations are allowed in the sending and receiving…

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

We give a direct proof of the additivity of the minimum output entropy of a particular quantum channel which breaks the multiplicativity conjecture. This yields additivity of the classical capacity of this channel, a result obtained by a…

Quantum Physics · Physics 2007-05-23 Nilanjana Datta , Alexander S. Holevo , Yuri M. Suhov

For classical point-to-point channels, it has been shown by Bennett et al. that quantum entanglement assistance cannot improve their capacity, and by Cubitt et al. that entanglement assistance cannot activate (increase from zero to…

Quantum Physics · Physics 2026-03-24 Yuhang Yao , Syed A. Jafar

We investigate whether the use of a noiseless, classical feedback channel will increase the capacity of a quantum discrete memoryless channel to transmit classical information. This problem has been previously analyzed by Bowen and…

Quantum Physics · Physics 2007-05-23 Andrew Skeen

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

The set of Multi-level Amplitude Damping (MAD) quantum channels is introduced as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension $d$. In the special case of $d=3$, by exploiting…

Quantum Physics · Physics 2021-03-03 Stefano Chessa , Vittorio Giovannetti

Conjugate degradable channels are channels whose quantum capacity is calculable. They were defined and studied in [1] where, however, only channels that are both degradable and conjugate degradable were found. In this paper we bring the…

Quantum Physics · Physics 2015-07-23 Kamil Bradler

We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of…

Quantum Physics · Physics 2015-10-15 Motohisa Fukuda , Ion Nechita , Michael M. Wolf

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…

Quantum Physics · Physics 2009-09-24 Bill Rosgen

The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both…

Quantum Physics · Physics 2011-10-20 Tony Dorlas , Ciara Morgan

Quantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by $\log d$. A…

Quantum Physics · Physics 2009-11-07 Heng Fan

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We…

Quantum Physics · Physics 2013-11-01 A. D'Arrigo , G. Benenti , G. Falci , C. Macchiavello

We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…

Quantum Physics · Physics 2015-05-20 Marco Tomamichel , Vincent Y. F. Tan

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

It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We…

Quantum Physics · Physics 2007-05-23 A. E. Allahverdyan , D. B. Saakian

The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analogue of the…

Quantum Physics · Physics 2025-01-10 Bishal Kumar Das , Lav R. Varshney , Vaibhav Madhok
‹ Prev 1 3 4 5 6 7 10 Next ›