Abstract
We present a new method of more speedily calculating a multiplication by using the generalized Bernstein-Vazirani algorithm and many parallel quantum systems. Given the set of real values \(\{a_{1},a_{2},a_{3},\ldots ,a_{N}\}\) and a function \(g:\textbf {R}\rightarrow \{0,1\}\), we shall determine the following values \(\{g(a_{1}),g(a_{2}),g(a_{3}),\ldots , g(a_{N})\}\) simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of \(N\). Next, we consider it as a number in binary representation; M1 = (g(a1),g(a2),g(a3),…,g(a N )). By using \(M\) parallel quantum systems, we have \(M\) numbers in binary representation, simultaneously. The speed of obtaining the \(M\) numbers is shown to outperform the classical case by a factor of \(M\). Finally, we calculate the product; \( M_{1}\times M_{2}\times \cdots \times M_{M}. \) The speed of obtaining the product is shown to outperform the classical case by a factor of N × M.
Similar content being viewed by others
References
Deutsch, D.: Proc. Roy. Soc. London Ser. A 400, 97 (1985)
Deutsch, D., Jozsa, R.: Proc. Roy. Soc. London Ser. A 439, 553 (1992)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Proc. Roy. Soc. London Ser. A 454, 339 (1998)
Jones, J. A., Mosca, M.: J. Chem. Phys. 109, 1648 (1998)
Gulde, S., Riebe, M., Lancaster, G. P. T., Becher, C., Eschner, J., Häffner, H., Schmidt-Kaler, F., Chuang, I. L., Blatt, R.: Nature (London) 421, 48 (2003)
de Oliveira, A. N., Walborn, S. P., Monken, C. H.: J. Opt. B: Quantum Semiclass. Opt. 7, 288–292 (2005)
Kim, Y. -H.: Phys. Rev. A 67, 040301(R) (2003)
Mohseni, M., Lundeen, J. S., Resch, K. J., Steinberg, A. M.: Phys. Rev. Lett. 91, 187903 (2003)
Tame, M. S., Prevedel, R., Paternostro, M., Böhi, P., Kim, M. S., Zeilinger, A.: Phys. Rev. Lett. 98, 140501 (2007)
Bernstein, E., Vazirani, U: In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC ’93), pp. 11–20 (1993). https://doi.org/10.1145/167088.167097
Bernstein, E., Vazirani, U.: SIAM J. Comput. 26–5, 1411–1473 (1997)
Simon, D. R.: Foundations of computer science. In: 35th Annual Symposium on Proceedings, pp. 116–123, retrieved 2011-06-06 (1994)
Du, J., Shi, M., Zhou, X., Fan, Y., Ye, B. J., Han, R., Wu, J.: Phys. Rev. A 64, 042306 (2001)
Brainis, E., Lamoureux, L. -P., Cerf, N. J., Emplit, P. h., Haelterman, M., Massar, S.: Phys. Rev. Lett. 90, 157902 (2003)
Cross, A. W., Smith, G., Smolin, J. A.: Phys. Rev. A 92, 012327 (2015)
Li, H., Yang, L.: Quantum Inf. Process. 14, 1787 (2015)
Adcock, M. R. A., Hoyer, P., Sanders, B. C.: Quantum Inf. Process. 15, 1361 (2016)
Fallek, S. D., Herold, C. D., McMahon, B. J., Maller, K. M., Brown, K. R., Amini, J. M.: J. Phys. 18, 083030 (2016)
Diep, D. N., Giang, D. H., Van Minh, N.: Int. J. Theor. Phys. 56, 1948 (2017). https://doi.org/10.1007/s10773-017-3340-8
Jin, W.: Quantum Inf. Process. 15, 65 (2016)
Nagata, K., Resconi, G., Nakamura, T., Batle, J., Abdalla, S., Farouk, A., Geurdes, H.: Asian J. Math. Phys. 1(1), 1–4 (2017)
Nagata, K., Nakamura, T.: Open Access Library J. 2, e1798 (2015). https://doi.org/10.4236/oalib.1101798
Nagata, K., Nakamura, T.: Int. J. Theor. Phys. 56, 2086 (2017). https://doi.org/10.1007/s10773-017-3352-4
Nagata, K., Nakamura, T., Farouk, A.: Int. J. Theor. Phys. 56, 2887 (2017). https://doi.org/10.1007/s10773-017-3456-x
Acknowledgements
All authors are grateful to the anonymous referees who provided a great insight into the completion of the final manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nagata, K., Nakamura, T., Geurdes, H. et al. New Method of Calculating a Multiplication by using the Generalized Bernstein-Vazirani Algorithm. Int J Theor Phys 57, 1605–1611 (2018). https://doi.org/10.1007/s10773-018-3687-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10773-018-3687-5