This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (December 2024) ( Learn how and when to remove this message )
In the intricate field of quantum information theory, a quantum channel stands as a pivotal conduit, capable of transmitting not only the ephemeral whispers of quantum information but also the robust pronouncements of classical data. Consider, for instance, the general dynamics of a qubit – that fundamental unit of quantum information – as a prime example of what a quantum channel can convey. Conversely, the transmission of a mundane text document across the vast expanse of the Internet serves as a familiar analogy for classical information transfer.
From a terminological standpoint, quantum channels are precisely defined as completely positive (CP) trace-preserving maps that operate between spaces of operators. More specifically, a quantum channel can be understood as a quantum operation, but viewed not merely as the reduced dynamics of an isolated system, but rather as a deliberate pathway designed for the conveyance of quantum information. It's worth noting a subtle distinction in terminology: some scholars opt to use "quantum operation" to encompass all trace-decreasing maps, reserving "quantum channel" exclusively for those that strictly preserve the trace.[1]
Memoryless Quantum Channel
For the purposes of our immediate exploration, we shall assume that all state spaces, whether they pertain to classical or quantum systems, are finite-dimensional.
The term "memoryless" in this context carries the identical connotation it holds within classical information theory. It signifies that the output generated by a channel at any given moment is contingent solely upon the input provided at that precise moment, and is entirely independent of any preceding inputs.
Schrödinger Picture
Let us first consider quantum channels that are exclusively dedicated to the transmission of quantum information. These are, in essence, quantum operations, and we shall now summarize their defining characteristics.
Suppose we have two finite-dimensional Hilbert spaces, denoted as
and
,
which represent the state spaces of the sending and receiving ends of the channel, respectively. The family of operators acting on
will be denoted as
.
Within the framework of the Schrödinger picture, a purely quantum channel is characterized by a map, let's call it
,
that transforms density matrices acting on
into density matrices acting on
.
This transformation must adhere to the following stringent properties:[2]
-
Linearity: As mandated by the fundamental postulates of quantum mechanics, the map
must exhibit linearity.
-
Positivity Preservation: Since density matrices are inherently positive, the map
is obligated to preserve the cone of positive elements. In other words,
must be a positive map.
-
Complete Positivity: If we introduce an ancilla of any arbitrary finite dimension, say 'n', and couple it to the system, the induced map, represented as
(where is the identity map on the ancilla), must also remain positive. Consequently, it is a requirement that
is positive for every possible value of 'n'. Maps possessing this property are termed completely positive.
-
Trace Preservation: Density matrices are specifically defined to have a trace equal to 1. Therefore, the map
must inherently preserve this trace property.
These descriptors – completely positive and trace preserving – are often abbreviated as CPTP. It’s worth noting that in some academic contexts, the fourth property (trace preservation) might be relaxed to simply require that
is not trace-increasing. However, for the discussions within this article, we shall consistently assume that all channels under consideration are CPTP.
Heisenberg Picture
While density matrices acting on constitute a specific subset of operators on (and similarly for system B), a linear map defined between these density matrices can, under the assumption of finite dimensionality, be uniquely extended to encompass the entire space of operators. This extension yields the adjoint map, , which elegantly describes the action of within the Heisenberg picture:[3]
The spaces of operators, and , are themselves Hilbert spaces, endowed with the Hilbert–Schmidt inner product. Consequently, when we consider as a map between these Hilbert spaces, , its adjoint, , is defined by the relationship:
.
While transforms states residing on system A into states on system B, its adjoint, , performs the converse operation, mapping observables associated with system B to observables on system A. This duality mirrors the relationship between the Schrödinger and Heisenberg descriptions of dynamics: the statistical outcomes of measurements remain invariant whether one considers the observables to be fixed while the states evolve, or vice versa.
A direct verification reveals that if is assumed to be trace preserving, then its adjoint, , necessarily becomes unital. This means that , where represents the identity operator. From a physical perspective, this implies that in the Heisenberg picture, the most trivial observable, the identity, remains unchanged after the application of the channel.
Classical Information
Up to this point, our discussion has focused on quantum channels exclusively designed for the transmission of quantum information. However, as the introduction alluded to, the inputs and outputs of a channel can also encompass classical information. To incorporate this, the formulation we have developed requires a slight generalization. In the Heisenberg picture, a purely quantum channel is essentially a linear map between spaces of operators:
This map must be both unital and completely positive (CP). The operator spaces can be conceptualized as finite-dimensional C*-algebras. Therefore, we can more broadly state that a quantum channel is a unital CP map existing between C*-algebras:
.
Classical information can then be seamlessly integrated into this framework. The observables of a classical system can be represented by a commutative C*-algebra, which is essentially the space of continuous functions, , defined over some set . Assuming to be finite, can be identified with the n-dimensional Euclidean space, , equipped with entry-wise multiplication.
Consequently, if classical information is to be considered part of the input in the Heisenberg picture, we would define to include the relevant classical observables. An illustrative example would be a channel of the form:
.
It is crucial to observe that remains a C*-algebra. An element 'a' within a C*-algebra is designated as positive if it can be expressed as for some element . The concept of positivity for a map is defined analogously. However, it is important to acknowledge that this particular characterization is not universally embraced; the quantum instrument is sometimes put forth as a more generalized mathematical construct capable of accommodating both quantum and classical information transfer. In certain axiomatic frameworks of quantum mechanics, classical information is conveyed through a Frobenius algebra or a Frobenius category.
Examples
Time Evolution
For a purely quantum system, the evolution of its state over time, at a specified moment , is governed by the transformation:
where represents the unitary evolution operator, with being the Hamiltonian of the system and denoting the reduced Planck constant. This process yields a CPTP map in the Schrödinger picture, and thus qualifies as a quantum channel.[4] The corresponding dual map in the Heisenberg picture is given by:
.
Restriction
Consider a composite quantum system whose state space is described by . For a given state , the reduced state of pertaining to system A, denoted as , is obtained by applying the partial trace operation over the B system:
.
This partial trace operation itself constitutes a CPTP map, and therefore functions as a quantum channel in the Schrödinger picture.[5] In the Heisenberg picture, the dual map associated with this channel transforms an observable A of system A into:
,
where is the identity operator acting on system B.
Observable
An observable fundamentally associates a numerical value, say , with a specific quantum mechanical effect, . The collection is assumed to comprise positive operators acting on the relevant state space, with the condition that (such a collection is formally known as a POVM).[6][7] In the Heisenberg picture, the observable map, , transforms a classical observable into the corresponding quantum mechanical observable:
.
In essence, this operation involves integrating the classical function with respect to the POVM elements to yield the quantum mechanical observable. It can be readily verified that is both CP and unital.
The corresponding Schrödinger map, , takes density matrices as input and produces classical states as output:[8]
,
where the inner product is the Hilbert–Schmidt inner product. Furthermore, if we conceptualize states as normalized functionals and invoke the Riesz representation theorem, we can express this as:
.
Instrument
The observable map, when viewed in the Schrödinger picture, possesses a purely classical output algebra. Consequently, it solely delineates the statistical outcomes of measurements. To account for the concurrent change in the quantum state, we introduce the concept of a quantum instrument. Let represent the effects (elements of a POVM) associated with an observable. In the Schrödinger picture, an instrument is a map that accepts a pure quantum state as input and produces an output in the space :
.
Now, let . The dual map in the Heisenberg picture is then defined as:
,
where is defined as follows: First, factor each effect as (this factorization is always possible since elements of a POVM are positive operators). Then, define .
We observe that is both CP and unital. It's also worth noting that precisely yields the observable map we discussed earlier. The map:
captures the overall transformation of the quantum state.
Measure-and-Prepare Channel
Imagine a scenario where two parties, A and B, wish to communicate. Party A performs a measurement on an observable and then communicates the outcome to B via a classical channel. Based on this received message, B prepares their quantum system in a specific state. In the Schrödinger picture, the first stage of this process, , simply represents A's measurement, which is precisely the observable map:
.
If, upon obtaining the -th measurement outcome, B prepares their system in state , then the second stage of the channel, , transforms the classical outcome into the density matrix:
.
The complete operation is the composition of these two stages:
.
Channels exhibiting this structure are aptly termed measure-and-prepare channels, or alternatively, entanglement-breaking channels.[9][10][11][12]
In the Heisenberg picture, the dual map, , is defined by:
.
A crucial characteristic of a measure-and-prepare channel is that it cannot be the identity map. This fact is directly linked to the no-teleportation theorem, which asserts the impossibility of classical teleportation (distinct from entanglement-assisted teleportation). In simpler terms, it means that a quantum state cannot be reliably measured and reconstructed.
Within the framework of channel-state duality, a channel is classified as measure-and-prepare if and only if its corresponding state is separable. Indeed, all states that emerge from the partial action of a measure-and-prepare channel are separable, which is precisely why these channels are also referred to as entanglement-breaking channels.
Pure Channel
Let us now consider a purely quantum channel, , within the Heisenberg picture. Assuming finite dimensionality, is a unital CP map operating between spaces of matrices:
.
According to Choi's theorem on completely positive maps, such a map must take the form:
where is an integer such that . The matrices are known as the Kraus operators of , named after the German physicist Karl Kraus who first introduced them.[13][14][15] The minimum number of Kraus operators required to represent a channel is termed its Kraus rank. A channel possessing a Kraus rank of 1 is designated as a pure channel. The time evolution of a quantum system, as discussed earlier, represents one such example of a pure channel. This terminology, too, stems from the channel-state duality: a channel is pure precisely when its associated dual state is a pure state.
Teleportation
In the context of quantum teleportation, the objective is for a sender to transmit an arbitrary quantum state of a particle to a receiver, who may be at a considerable distance. Consequently, the teleportation process itself constitutes a quantum channel. The apparatus required for this process necessitates a quantum channel for the transmission of one particle of an entangled pair to the receiver. Teleportation is accomplished through a joint measurement performed on the sent particle and the remaining particle of the entangled pair. This measurement yields classical information that must then be conveyed to the receiver to finalize the teleportation. A crucial point is that this classical information can be transmitted even after the quantum channel involved in the entanglement distribution has ceased to be active.
In the Experimental Setting
From an experimental perspective, a straightforward method for implementing a quantum channel involves the transmission of single photons through fiber optic cables, or alternatively, through free space. Single photons can propagate for distances up to 100 km in standard optical fibers before signal loss becomes prohibitive.[ citation needed ] The encoding of quantum information for applications such as quantum cryptography is typically achieved by utilizing the photon's time of arrival ( time-bin entanglement ) or its polarization. Critically, such a channel is capable of transmitting not only the basis states (e.g., , ) but also their superpositions (e.g., ). The delicate coherence of the quantum state is preserved throughout its journey via the channel. This stands in stark contrast to the transmission of electrical pulses through wires, which constitute a classical channel and can only convey classical information (i.e., sequences of 0s and 1s).
Channel Capacity
The cb-Norm of a Channel
Before formally defining channel capacity, it is essential to introduce the preliminary concept of the norm of complete boundedness, or the cb-norm, of a channel. When evaluating the capacity of a channel , we often need to compare its performance against an "ideal channel," let's denote it as . For instance, if the input and output algebras are identical, a natural choice for is the identity map. Such a comparison necessitates a well-defined metric for quantifying the distance between channels.
Given that a channel can be mathematically represented as a linear operator, it might seem intuitive to employ the standard operator norm. This would imply that the closeness of to the ideal channel is defined by:
.
However, this approach encounters a significant issue: the operator norm can exhibit an undesirable behavior. Specifically, when we tensor with the identity map on some auxiliary system (an ancilla), the resulting operator norm, , can potentially increase without bound as the dimension of the ancilla approaches infinity.
This tendency makes the operator norm an inadequate measure for comparing channels in a way that is relevant to quantum information transmission. The resolution to this problem lies in the introduction of the cb-norm. For any linear map between C*-algebras, the cb-norm is defined as:
.
This definition ensures that the norm remains bounded, irrespective of the dimension of the auxiliary system used.
Definition of Channel Capacity
The mathematical model we are employing for a channel is analogous to the one used in classical channel capacity theory.
Let be a channel described in the Heisenberg picture, and let be a chosen ideal channel. To enable a meaningful comparison between and , we must consider the possibility of encoding and decoding operations. This is achieved by examining the composition:
where represents an encoder and represents a decoder. Within this context, both and are required to be unital CP maps with appropriately defined domains and codomains. The quantity of primary interest is the "best-case scenario," which is determined by minimizing the distance between the composed channel and the ideal channel :
\Delta (\hat{\Psi}, \Psi_{id}) = \inf _{E,D}\|\hat{\Psi} - \Psi_{id}\|_{cb}}
where the infimum is taken over all permissible encoders and decoders.
To transmit sequences of symbols (words of length ), the ideal channel is conceptually applied times. Thus, we consider the tensor power of the ideal channel:
.
The tensor product operation, , signifies that independent inputs are subjected to the operation . This is the quantum mechanical analogue of concatenation. Similarly, applications of the channel correspond to:
.
The quantity therefore serves as a measure of the channel's ability to faithfully transmit words of length when invoked times.
This leads us to the following formal definition:
A non-negative real number is considered an achievable rate of with respect to if, for all sequences and of natural numbers such that and , the following limit holds:
.
The sequence can be interpreted as representing a message composed of potentially infinitely many words. The condition involving the limit supremum signifies that, in the limit, faithful transmission can be achieved by invoking the channel no more than times for each word transmitted. Alternatively, can be understood as the number of symbols per channel invocation that can be sent without error.
The channel capacity of with respect to , denoted by , is defined as the supremum of all achievable rates.
From the very definition, it is trivially true that is an achievable rate for any channel.
Important Examples
As previously mentioned, for a system characterized by the observable algebra , the ideal channel is, by definition, the identity map . Consequently, for a purely -dimensional quantum system, the ideal channel is the identity map acting on the space of matrices, . With a slight notational convention, this ideal quantum channel will also be denoted simply as . Similarly, a classical system with an output algebra will have an ideal channel represented by the same symbol. We can now state some fundamental channel capacities:
The channel capacity of the classical ideal channel with respect to a quantum ideal channel is:
.
This result is a direct restatement of the no-teleportation theorem: it is fundamentally impossible to transmit quantum information solely through a classical channel.
Furthermore, the following equalities hold:
.
The first part of this equality signifies, for instance, that an ideal quantum channel offers no advantage over an ideal classical channel in terms of transmitting classical information. When , the most efficient rate achievable is one classical bit per qubit.
It is pertinent to highlight that both of the aforementioned capacity bounds can be surpassed with the strategic utilization of quantum entanglement. The entanglement-assisted teleportation scheme provides a mechanism for transmitting quantum information even when employing a classical channel. Similarly, superdense coding demonstrates the remarkable feat of achieving two classical bits of information per qubit. These profound results underscore the indispensable role that entanglement plays in the realm of quantum communication.
Classical and Quantum Channel Capacities
Using the same notation as in the preceding subsection, the classical capacity of a channel is defined as:
,
meaning it is the capacity of when compared against the ideal channel operating on the classical one-bit system, .
Analogously, the quantum capacity of is defined as:
,
where the reference system is now the one-qubit system, .
Channel Fidelity
Another crucial metric for quantifying how well a quantum channel preserves information is known as channel fidelity. This concept is derived from the more general notion of the fidelity of quantum states. Given two pure states, and , their fidelity is defined as the probability that one state, when subjected to a test designed to identify the other, will yield a positive result:
.
This definition can be extended to encompass the comparison of two mixed states, which are represented by density matrices and :[16][17]
.
The channel fidelity for a specific quantum channel is determined by transmitting one half of a maximally entangled pair of systems through that channel. Subsequently, the fidelity is calculated between the resulting state and the original input state.[18]
Bistochastic Quantum Channel
A bistochastic quantum channel is a quantum channel that possesses the property of being unital. This means that . These types of channels encompass a range of transformations, including unitary evolutions, convex combinations of unitaries, and, in dimensions greater than 2, other possibilities as well.[19][20]
See also
References
- ^ Weedbrook, Christian; Pirandola, Stefano; García-Patrón, Raúl; Cerf, Nicolas J.; Ralph, Timothy C.; Shapiro, Jeffrey H.; Lloyd, Seth (2012). "Gaussian quantum information". Reviews of Modern Physics. 84 (2): 621–669. arXiv:1110.3234. Bibcode:2012RvMP...84..621W. doi:10.1103/RevModPhys.84.621. S2CID 119250535.
- ^ Wilde 2017, §4.4.1.
- ^ Wilde 2017, §4.4.5.
- ^ Wilde 2017, §4.6.3.
- ^ Wilde 2017, §4.6.2.
- ^ Peres, Asher (1993). Quantum Theory: Concepts and Methods. Kluwer. p. 283. ISBN 0-7923-2549-4.
- ^ Bengtsson & Życzkowski 2017, p. 271.
- ^ Wilde 2017, §4.6.6.
- ^ Ruskai, Mary Beth (2003). "Qubit entanglement breaking channels". Reviews in Mathematical Physics. 15 (6): 643–662. arXiv:quant-ph/0302032. Bibcode:2003RvMaP..15..643R. doi:10.1142/S0129055X03001710.
- ^ Wilde 2017, §4.6.7.
- ^ DeBrota, John B.; Stacey, Blake C. (2019). "Lüders channels and the existence of symmetric-informationally-complete measurements". Physical Review A. 100 (6) 062327. arXiv:1907.10999. Bibcode:2019PhRvA.100f2327D. doi:10.1103/PhysRevA.100.062327.
- ^ Pandey, Satish K.; Paulsen, Vern I.; Prakash, Jitendra; Rahaman, Mizanur (2020). "Entanglement Breaking Rank and the existence of SIC POVMs". Journal of Mathematical Physics. 61 (4): 042203. arXiv:1805.04583. Bibcode:2020JMP....61d2203P. doi:10.1063/1.5045184.
- ^ Kraus, Karl (1983). States, effects, and operations: fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Vol. 190. Springer-Verlag. ISBN 978-3-5401-2732-1.
- ^ Barnum, Howard; Nielsen, M. A.; Schumacher, Benjamin (1 June 1998). "Information transmission through a noisy quantum channel". Physical Review A. 57 (6): 4153–4175. arXiv:quant-ph/9702049. Bibcode:1998PhRvA..57.4153B. doi:10.1103/PhysRevA.57.4153.
- ^ Fuchs, Christopher A.; Jacobs, Kurt (16 May 2001). "Information-tradeoff relations for finite-strength quantum measurements". Physical Review A. 63 (6) 062305. arXiv:quant-ph/0009101. Bibcode:2001PhRvA..63f2305F. doi:10.1103/PhysRevA.63.062305.
- ^ Jozsa, R. (1994). "Fidelity for mixed quantum states". Journal of Modern Optics. 41 (12): 2315–2323. Bibcode:1994JMOp...41.2315J. doi:10.1080/09500349414552171.
- ^ Fuchs, C. A.; Caves, C. M. (1995). "Mathematical techniques for quantum communication theory". Open Systems & Information Dynamics. 3 (3): 345–356. arXiv:quant-ph/9604001. doi:10.1007/BF02228997.
- ^ Kretschmann, Dennis; Werner, Reinhard F. (2004). "Tema con variazioni : quantum channel capacity". New Journal of Physics. 6 (1): 26. arXiv:quant-ph/0311037. Bibcode:2004NJPh....6...26K. doi:10.1088/1367-2630/6/1/026.
- ^ Holbrook, John A.; Kribs, David W.; Laflamme, Raymond (October 2003). "Noiseless Subsystems and the Structure of the Commutant in Quantum Error Correction". Quantum Information Processing. 2 (5): 381–419. arXiv:quant-ph/0402056. Bibcode:2003QuIP....2..381H. doi:10.1023/B:QINP.0000022737.53723.b4.
- ^ Bengtsson & Życzkowski 2017, pp. 288–289.
- ^ Bengtsson, Ingemar; Życzkowski, Karol (2017). Geometry of Quantum States: An Introduction to Quantum Entanglement (2nd ed.). Cambridge University Press. ISBN 978-1-107-02625-4.
- ^ Holevo, Alexander S. (2001). Statistical Structure of Quantum Theory. Lecture Notes in Physics. Monographs. Springer. ISBN 3-540-42082-7.
- ^ Keyl, M.; Werner, R. F. (2002). "How to Correct Small Quantum Errors". In Buchleitner, Andreas; Hornberger, Klaus (eds.). Coherent Evolution in Noisy Environments. Lecture Notes in Physics. Vol. 611. Springer. pp. 263–286. arXiv:quant-ph/0206086. doi:10.1007/3-540-45855-7_7. ISBN 978-3-540-44354-4.
- ^ Wilde, Mark M. (2017). Quantum Information Theory (2nd ed.). Cambridge University Press. arXiv:1106.1445. doi:10.1017/9781316809976. ISBN 978-1-316-80997-6.
Quantum information science Quantum mechanics Emerging technologies