Channel-state duality

In quantum information theory, the channel-state duality refers to the correspondence between quantum channels and quantum states (described by density matrices). Phrased differently, the duality is the isomorphism between completely positive maps (channels) from A to C^n×n, where A is a C*-algebra and C^n×n denotes the n×n complex entries, and positive linear functionals (states) on the tensor product

\mathbb {C} ^{n\times n}\otimes A.

Details

Let H₁ and H₂ be (finite-dimensional) Hilbert spaces. The family of linear operators acting on H_i will be denoted by L(H_i). Consider two quantum systems, indexed by 1 and 2, whose states are density matrices in L(H_i) respectively. A quantum channel, in the Schrödinger picture, is a completely positive (CP for short), trace-preserving linear map

\Phi :L(H_{1})\rightarrow L(H_{2})

that takes a state of system 1 to a state of system 2. Next we describe the dual state corresponding to Φ.

Let E_{i j} denote the matrix unit whose ij-th entry is 1 and zero elsewhere. The (operator) matrix

\rho _{\Phi }=(\Phi (E_{ij}))_{ij}\in L(H_{1})\otimes L(H_{2})

is called the Choi matrix of Φ. By Choi's theorem on completely positive maps, Φ is CP if and only if ρ_Φ is positive (semidefinite). One can view ρ_Φ as a density matrix, and therefore the state dual to Φ.

The duality between channels and states refers to the map

\Phi \rightarrow \rho _{\Phi },

a linear bijection. This map is also called Jamiołkowski isomorphism or Choi–Jamiołkowski isomorphism.

Applications

This isomorphism is used to show that the "Prepare and Measure" Quantum Key Distribution (QKD) protocols, such as the BB84 protocol devised by C. H. Bennett and G. Brassard[1] are equivalent to the "Entanglement-Based" QKD protocols, introduced by A. K. Ekert.[2] More details on this can be found e.g. in the book Quantum Information Theory by M. Wilde.[3]

gollark: But then, a week later... a *letter*, sent by *post*, from someone else, which was related only in that it seemed to mention encryption.

gollark: I got an email *back* pretty fast saying "we've forwarded your concerns to parliament", but nothing for a while after that.]

gollark: I decided to contact my MP a while ago after the government said something *especially* stupid about end-to-end encryption.

gollark: It makes everyone libleft!

gollark: Well, I generally err on the side of "things should preferentially not be restricted", as a libcenter-according-to-the-political-compass.

References

C. H. Bennett and G. Brassard, “Quantum Cryptography: Public key distribution and coin tossing”, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, 175 (1984)
Ekert, Artur K. (1991-08-05). "Quantum cryptography based on Bell's theorem". Physical Review Letters. American Physical Society (APS). 67 (6): 661–663. Bibcode:1991PhRvL..67..661E. doi:10.1103/physrevlett.67.661. ISSN 0031-9007. PMID 10044956.
M. Wilde, "Quantum Information Theory" - Cambridge University Press 2nd ed. (2017), §22.4.1, pag. 613

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] C. H. Bennett and G. Brassard, “Quantum Cryptography: Public key distribution and coin tossing”, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, 175 (1984)

[2] Ekert, Artur K. (1991-08-05). "Quantum cryptography based on Bell's theorem". Physical Review Letters. American Physical Society (APS). 67 (6): 661–663. Bibcode:1991PhRvL..67..661E. doi:10.1103/physrevlett.67.661. ISSN 0031-9007. PMID 10044956.

[3] M. Wilde, "Quantum Information Theory" - Cambridge University Press 2nd ed. (2017), §22.4.1, pag. 613