Voronezh, Russian Federation
, Russian Federation
The paper considers the architecture of a quantum repeater based on the phenomenon of quantum teleportation with the implementation of the most entangled Bell states. Algorithms for quantum purification according to the Bennett and Deutsch protocols are given. As a result, a quantum repeater scheme with three nodes and entanglement exchange operations has been implemented. Quantum signals were simulated using the Qiskit package.
modernization, timber industry, innovative potential
1. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels / C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W.K. Wootters // Physical Review Letters. – 1993. – Vol. 70. – P. 1895–1899. – URL: https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.70.1895.
2. Shor, P.W. Algorithms for quantum computation: discrete logarithms and factoring / P.W. Shor // Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20–22 Nov. 1994. – IEEE Computer Society Press, 1994. – R. 124–134. – URL: https://ieeexplore.ieee.org/document/365700.
3. Manin, Yu.I. Vychislimoe i nevychislimoe / Yu.I. Manin. – Moskva : Sovetskoe radio, 1980. – 128 s.
4. Manin, Yu.I. Dokazuemoe i nedokazuemoe / Yu.I. Manin. – Moskva : Sovetskoe Radio, 1979. – 88 s.
5. Feynman, R.F. Vnizu polnym-polno mesta: priglashenie v novyy mir fiziki / R.F. Feynman // Rossiyskiy himicheskiy zhurnal. – 2002. – T. XLVI, № 5. – S. 4-7.
6. Weisner, S. Conjugate coding / S. Weisner // Association for Computing Machinery, Special Interest Group in Algorithms and Computation Theory. – 1983. – T. 15. – S. 78–88.
7. Holevo, A.S. Kvantovaya informatika : proshloe, nastoyaschee, buduschee / A.S. Holevo // V mire nauki. – 2008. – № 7. – S. 68-75.
8. Biggest quantum computer / Geek.com. – URL: https://www.geek.com/chips/biggest-quantum-computer-to-date-544054/ (data obrascheniya: 11.08.2019).
