Immediate challenges faced by the quantum computing in time series analysis

Authors

  • A.S. Kussainov Al-Farabi Kazakh National University, Kazakstan, Almaty
  • A.T. Karimova Al-Farabi Kazakh National University, Kazakstan, Almaty
  • S.G. Kussainov K.I. Satpaev Kazakh National Technical University, Almaty, Kazakhstan
  • N.Y. Pya University of Bath, Bath, United Kingdom
        70 30

Keywords:

quantum computing, qubit, time series, algorithm, Fourier transform

Abstract

We considered a few aspects of quantum computing in connection with the time series analysis. Quantum Fourier Transform was selected as a test example due to its important practical value in spectral analysis, the easiness of implementation and its generic nature with respect to many other quantum algorithms. The obvious drawbacks have been identified preventing the straightforward application of Quantum Fourier Transform to the evolving times series. The limited available register size of a quantum computer may be an issue at the data postprocessing stage, but carry significant practical value if included into the data acquisition stage. The analyzed qubit by qubit procedure is favoring the way most of the time series are acquired, which is one at a time. This procedure should be necessarily considered with the decoherence issue for the big quantum systems and long evolution times.

References

1. Feynman R. Simulating physics with computers // International Journal of Theoretical Phys-ics. - 1982. – Vol. 21(6/7). - P.467–488.

2. Feynman R. Quantum mechanical computers // Foundations of Physics. – 1986. – Vol.16: - P.507–531.

3. Turing M. On computable numbers, with an application to the Entscheidungs problem // Proceedings of the London Mathematical Society. - Series 2, 42. - P.230–265. Correction in 43, pp.544–546, 1937.

4. Deutsch D. Quantum computational networks // Proceedings of the Royal Society of Lon-don. – 1989. – Vol. A425. - P.73–90.

5. http://archive.sciencewatch.com/ana/st/quantum/rfmap1/

6. Shor P.W. Algorithms for quantum computation: Discrete logarithms and factoring. / SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE Com-puter Society Washington, DC, USA. – 1994. - P. 124-13.

7. http://math.nist.gov/quantum/zoo/

8. Nielsen M., Chuang I. Quantum Computation and Quantum Information (Cambridge Se-ries on Information and the Natural Sciences) / Cambridge University Press, 2000. - P. 216-246.

9. Parker S. and Plenio M.B. // Phys. Rev. Lett. – 2000. - Vol.85. - P.3049.

10. http://cr29.izmiran.ru/vardbaccess/title.html

11. Press W.H., Teukolsky S.A., Vetterling W.T., and Brian P. Flannery. Numerical Recipes: The Art of Scientific Computing (3 ed.). - Cambridge University Press, New York, NY, USA, 2007. - P.647.

Downloads

How to Cite

Kussainov, A., Karimova, A., Kussainov, S., & Pya, N. (2013). Immediate challenges faced by the quantum computing in time series analysis. Recent Contributions to Physics (Rec.Contr.Phys.), 44(1), 101–105. Retrieved from https://bph.kaznu.kz/index.php/zhuzhu/article/view/741

Issue

Section

Theoretical Physics. Nuclear and Elementary Particle Physics. Astrophysics