Skip to main content
SpringerLink
Log in

Quantum Computing: Survey and Analysis

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  2. Quantum Computer and Quantum Computing, Izhevsk Republican Printing House, Izhevsk (1999).

  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 

  4. S. Aaronson, Quantum Computing since Democritus [Russian translation], Alpina Non-Fiction, Moscow (2018).

    MATH  Google Scholar 

  5. M. N. Savchuk, “Works of the Kiev school of theoretical cryptography,” Cybernetics and Systems Analysis, Vol. 46, No. 3, 386–404 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  6. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge (2000).

    MATH  Google Scholar 

  7. A. Kitaev, “Quantum Computations: Algorithms and Error Correction,” Russian Mathematical Surveys, Vol. 52, No. 6, 53–112 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Yao, “Quantum circuit complexity,” in: Proc. 34th Annual Symposium on Foundations of Computer Science (1993), pp. 352–361.

  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).

  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).

  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.

  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).

  13. W. Van Dam, S. Hallgren, and L. Ip, “Quantum algorithms for some hidden shift problems,” SIAM Journal on Computing, Vol. 36, No. 3, 763–778 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  14. A. V. Fesenko, “Vulnerability of cryptographic primitives based on power conjugacy search problem in quantum computing,” Cybernetics and Systems Analysis, Vol. 50, No. 5, 815–816 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  15. Z. Bian, F. Chudak, W. Macready, L. Clark, and F. Gaitan, “Experimental determination of Ramsey numbers,” Physical Review Letters, Vol. 111, Iss. 13, p. 130505 (2013). DOI: https://doi.org/10.1103/PhysRevLett.111.130505. URL: https://arxiv.org/abs/1201.1842.

  16. A. Cho, “Quantum or not, controversial computer yields no speedup,” Science, Vol. 344, No. 6190, 1330–1331 (2014). DOI: https://doi.org/10.1126/science.344.6190.1330.

    Article  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.

Download references

Author information

Authors and Affiliations

  1. National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv, Ukraine

    M. M. Savchuk & A. V. Fesenko

Authors
  1. M. M. Savchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Fesenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. M. Savchuk.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2019, pp. 14–29.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Savchuk, M.M., Fesenko, A.V. Quantum Computing: Survey and Analysis. Cybern Syst Anal 55, 10–21 (2019). https://doi.org/10.1007/s10559-019-00107-w

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-019-00107-w

Keywords

Search

Navigation