Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States

Susumu Osawa, Hiroshi Nagaoka

Published Oct 1, 2001• 19 citations
OpenAlex

Abstract

SUMMARY The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity 1. key words: quantum entanglement, quantum channel capacity, quantum coding theorem, quantum information thery 1

Related papers

Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States

Susumu Osawa, Hiroshi Nagaoka

The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to aspecial case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.

arXiv:quant-ph/0007115•Jul 29, 2000•9 citations

Computing Quantum Channel Capacities

Navneeth Ramakrishnan, Raban Iten, Volkher B. Scholz +1 more

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 alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorousa priorianda posterioribounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments.

arXiv:1905.01286•IEEE Transactions on Information Theory•Oct 28, 2020•33 citations

Comparison on Capacity of Dense Coding in the Case of Using a Pure Entanglement Resource

Zhang Guo

According to the theory that quantum entanglement can be used in quantum dense coding and increase the classical information capacity of a quantum channel, we discuss and compare the upper bound of capacity for dense coding in two case of using entangled input states and using product input states though a noiseless channel, when using a pure entanglement resource and get the result,i. e. , the capacity of dense coding using entangled input states is no larger than the capacity for product input states.

Journal of Hubei Institute for Nationalities•Jan 1, 2005•0 citations

Capacity of Quantum Channels Using Product Measurements

Christopher King, Mary Beth Ruskai, Dedicated To Robert Schrader +1 more

The capacity of a quantum channel for transmission of classical information depends in principle on whether product states or entangled states are used at the input, and whether product or entangled measurements are used at the output. We show that when product measurements are used, the capacity of the channel is achieved with product input states, so that entangled inputs do not increase capacity. We show that this result continues to hold if sequential measurements are allowed, whereby the choice of successive measurements may depend on the results of previous measurements. We also present a new simplified expression which gives an upper bound for the Shannon capacity of a channel, and which bears a striking resemblance to the well-known Holevo bound.

•Apr 13, 2000•19 citations

On some additivity problems in quantum information theory

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.

arXiv:math-ph/0003002•Mar 4, 2000•105 citations

ADDITIVITY OF ENTANGLED CHANNEL CAPACITY GIVEN QUANTUM INPUT STATES

V. P. Belavkin, Xianhua Dai

An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki-Umegaki (a-type) and of Belavkin-Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum channel capacities via entanglement, which extends the earlier results of V. P. Belavkin to products of arbitrary quantum channels for quantum relative entropy of any type.

arXiv:quant-ph/0702098•Quantum Stochastics and Information•Aug 1, 2008•2 citations
SUMMARY The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity 1. key words: quantum entanglement, quantum channel capacity, quantum coding theorem, quantum information thery 1
The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to aspecial case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.
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 alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorousa priorianda posterioribounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments.
According to the theory that quantum entanglement can be used in quantum dense coding and increase the classical information capacity of a quantum channel, we discuss and compare the upper bound of capacity for dense coding in two case of using entangled input states and using product input states though a noiseless channel, when using a pure entanglement resource and get the result,i. e. , the capacity of dense coding using entangled input states is no larger than the capacity for product input states.
The capacity of a quantum channel for transmission of classical information depends in principle on whether product states or entangled states are used at the input, and whether product or entangled measurements are used at the output. We show that when product measurements are used, the capacity of the channel is achieved with product input states, so that entangled inputs do not increase capacity. We show that this result continues to hold if sequential measurements are allowed, whereby the choice of successive measurements may depend on the results of previous measurements. We also present a new simplified expression which gives an upper bound for the Shannon capacity of a channel, and which bears a striking resemblance to the well-known Holevo bound.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.
An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki-Umegaki (a-type) and of Belavkin-Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum channel capacities via entanglement, which extends the earlier results of V. P. Belavkin to products of arbitrary quantum channels for quantum relative entropy of any type.