It is shown how simulated annealing can be used to determine the accessible information and the capacity of a quantum channel. The method is applied to a specific example of a symmetric $N$ -state quantum channel that frequently appears in the analysis of eavesdropping in quantum key distribution protocols. The numerical results for the accessible information of this quantum channel are compared with recently published analytical solutions showing excellent agreement. Furthermore, interesting results concerning the capacity of a symmetric quantum channel are presented.It is shown how simulated annealing can be used to determine the accessible information and the capacity of a quantum channel. The method is applied to a specific example of a symmetric $N$-state quantum channel that frequently appears in the analysis of eavesdropping in quantum key distribution protocols. The numerical results for the accessible information of this quantum channel are compared with recently published analytical solutions showing excellent agreement. Furthermore, interesting results concerning the capacity of a symmetric quantum channel are presented.

Physical Review AApr 5, 20053 citations

Quantum Computation and Quantum Annealing

Akseli Partanen

Sep 15, 20170 citations

Quantum channel capacities: Multiparty communication (9 pages)

Maciej Demianowicz

Physical Review AJan 1, 20060 citations

Comparative study of the performance of quantum annealing and simulated annealing

秀稔西森, Hidetoshi Nishimori, 淳一津田 +2 more

Jan 1, 20150 citations

Quantum-capacity-approaching codes for the detected-jump channel

Markus Grassl, Zhengfeng Ji, Zhaohui Wei +1 more

The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.

arXiv:1008.3350Physical Review ADec 27, 20105 citations

It is shown how simulated annealing can be used to determine the accessible information and the capacity of a quantum channel. The method is applied to a specific example of a symmetric

N

-state quantum channel that frequently appears in the analysis of eavesdropping in quantum key distribution protocols. The numerical results for the accessible information of this quantum channel are compared with recently published analytical solutions showing excellent agreement. Furthermore, interesting results concerning the capacity of a symmetric quantum channel are presented.