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

arXiv:1207.0067 · IEEE Transactions on Information Theory

A Decoupling Approach to Classical Data Transmission Over Quantum Channels

Frédéric Dupuis, Oleg Szehr, Marco Tomamichel

Published Jan 31, 2014• 22 citations
arXivHTMLPDF

Abstract

Most coding theorems in quantum Shannon theory can be proven using the decoupling technique. To send data through a channel, one guarantees that the environment gets no information about it. Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application of this method, sending classical information through a quantum channel. We will show that this problem can, in fact, be solved using decoupling ideas, specifically by proving a dequantizing theorem, which ensures that the environment is only classically correlated with the sent data. Our techniques naturally yield a generalization of the Holevo-Schumacher-Westmoreland theorem to the one-shot scenario, where a quantum channel can be applied only once.

DOI
10.1109/tit.2013.2295330

Related papers

A quantum version of Feinstein's Theorem and its application to channel coding

Nilanjana Datta, T. C. Dorlas

In this paper, a quantum version of Feinstein's theorem is developed. This is then used to give a completely self-contained proof of the direct channel coding theorem, for transmission of classical information through a quantum channel with Markovian correlated noise. Our proof does not rely on the Holevo-Schumacher-Westmoreland (HSW) theorem. In addition, for the case of memoryless channels, our method yields an alternative proof of the HSW Theorem

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•6 citations

The decoupling approach to quantum information theory

Frédéric Dupuis

Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.

arXiv:1004.1641•Apr 9, 2010•133 citations

Classical Communication

Mark M. Wilde

This chapter begins our exploration of “dynamic” information-processing tasks in quantum Shannon theory, where the term “dynamic” indicates that a quantum channel connects a sender to a receiver and their goal is to exploit this resource for communication. We specifically consider the scenario where a sender Alice would like to communicate classical information to a receiver Bob, and the capacity theorem that we prove here is one particular generalization of Shannon's noisy channel coding theorem from classical information theory (overviewed in Section 2.2). In later chapters, we will see other generalizations of Shannon's theorem, depending on what resources are available to assist their communication or depending on whether they are trying to communicate classical or quantum information. For this reason and others, quantum Shannon theory is quite a bit richer than classical information theory. The naive approach to communicate classical information over a quantum channel is for Alice and Bob simply to mimic the approach used in Shannon's noisy channel coding theorem. That is, they select a random classical code according to some distribution pX(x) , and Bob performs individual measurements of the outputs of a noisy quantum channel according to some POVM. The POVM at the output induces some conditional probability distribution pY∣X(y∣x) , which we can in turn think of as an induced noisy classical channel. The classical mutual information I(X; Y) of this channel is an achievable rate for communication, and the best strategy for Alice and Bob is to optimize the mutual information over all of Alice's inputs to the channel and over all measurements that Bob could perform at the output.

Cambridge University Press eBooks•Apr 18, 2013•0 citations

On the near-optimality of one-shot classical communication over quantum channels

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum multiple-access channel, the quantum channel with a state, and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior study (A. Anshu, R. Jain, and N. Warsi, https://ieee.org/document/8399830). In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence [obtained earlier in the work of W. Matthews and S. Wehner, IEEE Trans. Inf. Theory 60, 7317–7329 (2014)]. Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.

arXiv:1804.09644•Journal of Mathematical Physics•Jan 1, 2019•25 citations

On capacity of quantum channel

Masanori Ohya

Recently, much research has been carried out on the transmission capacity of the quantum channel, and there exists significant confusion. The transmission capacity of the quantum channel is the information transfer capability of the quantum channel itself and does not fundamentally depend on the messages to be treated classically or on the method of coding. Hence, it is incorrect to call the process of sending the message to be processed classically through a device (channel) designed in a quantum manner and restoring the classical signal again the “quantum process.” Since the actual daily messages are classical subjects, it is commonly carried out that such messages coded to quantum states are sent through a quantum configured channel and are restored. In this case, the transmission capability is considered on the composite channel consisting of the channel converting a classical state formed by a message to a quantum state, the quantum channel sending a quantum state to a quantum state, and the channel restoring a classical state from a quantum state. This is different from the transmission capability of the quantum channel itself. Mathematically, the conventional Shannon theory should be applied to the above composite channel since the input state and the output one are classical. The transmission capacity in this case is that of the classical-quantum-classical channel. In this paper, a method is discussed to systematically treat the transmission capacity of such channels. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 84(4): 69–75, 2001

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Jan 1, 2000•0 citations

The Information-carrying capacity of certain quantum channels

Ciara Morgan

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.

arXiv:1007.2723•Irish Mathematical Society Bulletin•Jan 1, 2010•1 citation
Most coding theorems in quantum Shannon theory can be proven using the decoupling technique. To send data through a channel, one guarantees that the environment gets no information about it. Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application of this method, sending classical information through a quantum channel. We will show that this problem can, in fact, be solved using decoupling ideas, specifically by proving a dequantizing theorem, which ensures that the environment is only classically correlated with the sent data. Our techniques naturally yield a generalization of the Holevo-Schumacher-Westmoreland theorem to the one-shot scenario, where a quantum channel can be applied only once.
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
This chapter begins our exploration of “dynamic” information-processing tasks in quantum Shannon theory, where the term “dynamic” indicates that a quantum channel connects a sender to a receiver and their goal is to exploit this resource for communication. We specifically consider the scenario where a sender Alice would like to communicate classical information to a receiver Bob, and the capacity theorem that we prove here is one particular generalization of Shannon's noisy channel coding theorem from classical information theory (overviewed in Section 2.2). In later chapters, we will see other generalizations of Shannon's theorem, depending on what resources are available to assist their communication or depending on whether they are trying to communicate classical or quantum information. For this reason and others, quantum Shannon theory is quite a bit richer than classical information theory. The naive approach to communicate classical information over a quantum channel is for Alice and Bob simply to mimic the approach used in Shannon's noisy channel coding theorem. That is, they select a random classical code according to some distribution pX(x) , and Bob performs individual measurements of the outputs of a noisy quantum channel according to some POVM. The POVM at the output induces some conditional probability distribution pY∣X(y∣x) , which we can in turn think of as an induced noisy classical channel. The classical mutual information I(X; Y) of this channel is an achievable rate for communication, and the best strategy for Alice and Bob is to optimize the mutual information over all of Alice's inputs to the channel and over all measurements that Bob could perform at the output.
We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum multiple-access channel, the quantum channel with a state, and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior study (A. Anshu, R. Jain, and N. Warsi, https://ieee.org/document/8399830). In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence [obtained earlier in the work of W. Matthews and S. Wehner, IEEE Trans. Inf. Theory 60, 7317–7329 (2014)]. Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.
Recently, much research has been carried out on the transmission capacity of the quantum channel, and there exists significant confusion. The transmission capacity of the quantum channel is the information transfer capability of the quantum channel itself and does not fundamentally depend on the messages to be treated classically or on the method of coding. Hence, it is incorrect to call the process of sending the message to be processed classically through a device (channel) designed in a quantum manner and restoring the classical signal again the “quantum process.” Since the actual daily messages are classical subjects, it is commonly carried out that such messages coded to quantum states are sent through a quantum configured channel and are restored. In this case, the transmission capability is considered on the composite channel consisting of the channel converting a classical state formed by a message to a quantum state, the quantum channel sending a quantum state to a quantum state, and the channel restoring a classical state from a quantum state. This is different from the transmission capability of the quantum channel itself. Mathematically, the conventional Shannon theory should be applied to the above composite channel since the input state and the output one are classical. The transmission capacity in this case is that of the classical-quantum-classical channel. In this paper, a method is discussed to systematically treat the transmission capacity of such channels. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 84(4): 69–75, 2001
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.