Quantum Computing: Survey and Analysis
- 12 Downloads
The authors survey and analyze the main concepts and postulates of the quantum computing model, efficient quantum algorithms, and recent results, capabilities, and prospects in constructing a scalable quantum computer. A certain class of algebraic problems in the quantum computing model is considered for which there exists an efficient quantum solution algorithm. A detailed analysis of available quantum computer implementations was carried out, and it is shown that sufficient progress has not yet been made in constructing a scalable quantum computing device; nevertheless, most researchers expect that a full-fledged quantum computer will be created in the next 10–15 years.
Keywordsquantum computing model quantum cryptography quantum computer efficient quantum algorithm postquantum cryptographic primitive
Unable to display preview. Download preview PDF.
- 1.C. Bennett and G. Brassard, “Quantum cryptography: Public-key distribution and coin tossing,” in: Proc. Intern. Conf. on Computers, Systems and Signal Processing (Bangalore, India) (1984), pp. 175–179.Google Scholar
- 2.Quantum Computer and Quantum Computing, Izhevsk Republican Printing House, Izhevsk (1999).Google Scholar
- 3.J. Preskill, Quantum Information and Computation [Russian translation], Volume 1, Research Center “Regular and chaotic dynamics;” Computer Research Institute, Moscow–Izhevsk (2008).Google Scholar
- 8.A. Yao, “Quantum circuit complexity,” in: Proc. 34th Annual Symposium on Foundations of Computer Science (1993), pp. 352–361.Google Scholar
- 9.R. Boneh and R. Lipton, “Quantum cryptanalysis of hidden linear functions,” in: Proc. 15th Annual International Cryptology Conference (Santa Barbara, California, USA, August 27, 1995), Advances in Cryptology (Crypto’95); Lecture Notes in Computer Science, Vol. 31, 424–437 (1995).Google Scholar
- 10.D. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proc. Royal Society of London, Series A, No. 439, 553–558 (1992).Google Scholar
- 11.P. W. Shor, “Algorithms for quantum computation: Discrete logs and factoring,” in: Proc. 35th Symposium on the Foundations of Computer Science (Santa Fe, NM, USA, Nov. 20–22, 1994) (1994), pp. 124-134.Google Scholar
- 12.P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, Vol. 26, Iss. 5, 1484–1509 (1997).Google Scholar
- 17.N. S. Dattani and N. Bryans, Quantum Factorization of 56153 with Only 4 Qubits, Quantum Physics Archive. arXiv:1411.6758 [quant-ph]. 2014. URL: https://arxiv.org/abs/1411.6758.