Skip to main content
Erschienen in: Quantum Information Processing 12/2019

01.12.2019

Least-squares solutions to polynomial systems of equations with quantum annealing

verfasst von: Tyler H. Chang, Thomas C. H. Lux, Sai Sindhura Tipirneni

Erschienen in: Quantum Information Processing | Ausgabe 12/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This work proposes and analyzes a methodology for finding least-squares solutions to the systems of polynomial equations. Systems of polynomial equations are ubiquitous in computational science, with major applications in machine learning and computer security (i.e., model fitting and integer factorization). The proposed methodology maps the squared-error function for a polynomial equation onto the Ising–Hamiltonian model, ensuring that the approximate solutions (by least squares) to real-world problems can be computed on a quantum annealer even when the exact solutions do not exist. Hamiltonians for integer factorization and polynomial systems of equations are implemented and analyzed for both logical optimality and physical practicality on modern quantum annealing hardware.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50(4), 755–787 (2008)ADSMathSciNetCrossRef Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50(4), 755–787 (2008)ADSMathSciNetCrossRef
3.
Zurück zum Zitat Alghassi, H., Dridi, R., Tayur, S.: Graver bases via quantum annealing with application to non-linear integer programs. arXiv preprint arXiv:1902.04215 (2019) Alghassi, H., Dridi, R., Tayur, S.: Graver bases via quantum annealing with application to non-linear integer programs. arXiv preprint arXiv:​1902.​04215 (2019)
4.
Zurück zum Zitat Andriyash, E., Bian, Z., Chudak, F., Drew-Brook, M., King, A.D., Macready, W.G., Roy, A.: Boosting Integer Factoring Performance via Quantum Annealing Offsets. D-Wave White Papers, Hanover (2016) Andriyash, E., Bian, Z., Chudak, F., Drew-Brook, M., King, A.D., Macready, W.G., Roy, A.: Boosting Integer Factoring Performance via Quantum Annealing Offsets. D-Wave White Papers, Hanover (2016)
5.
6.
Zurück zum Zitat Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., Lloyd, S.: Quantum machine learning. Nature 549(7671), 195 (2017)ADSCrossRef Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., Lloyd, S.: Quantum machine learning. Nature 549(7671), 195 (2017)ADSCrossRef
7.
Zurück zum Zitat Boixo, S., Rønnow, T.F., Isakov, S.V., Wang, Z., Wecker, D., Lidar, D.A., Martinis, J.M., Troyer, M.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10(3), 218 (2014)CrossRef Boixo, S., Rønnow, T.F., Isakov, S.V., Wang, Z., Wecker, D., Lidar, D.A., Martinis, J.M., Troyer, M.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10(3), 218 (2014)CrossRef
8.
Zurück zum Zitat Boothby, K., Bunyk, P., Raymond, J., Roy, A.: Next-generation topology of d-wave quantum processors. D-Wave White Papers 22, 28 (2018) Boothby, K., Bunyk, P., Raymond, J., Roy, A.: Next-generation topology of d-wave quantum processors. D-Wave White Papers 22, 28 (2018)
9.
Zurück zum Zitat Borle, A., Lomonaco, S.J.: Analyzing the quantum annealing approach for solving linear least squares problems. In: International Workshop on Algorithms and Computation, pp. 289–301. Springer, Berlin (2019) Borle, A., Lomonaco, S.J.: Analyzing the quantum annealing approach for solving linear least squares problems. In: International Workshop on Algorithms and Computation, pp. 289–301. Springer, Berlin (2019)
10.
11.
Zurück zum Zitat Chang, C.C., Gambhir, A., Humble, T.S., Sota, S.: Quantum annealing for systems of polynomial equations. Sci. Rep. 9(1), 10258 (2019)ADSCrossRef Chang, C.C., Gambhir, A., Humble, T.S., Sota, S.: Quantum annealing for systems of polynomial equations. Sci. Rep. 9(1), 10258 (2019)ADSCrossRef
13.
Zurück zum Zitat Dridi, R., Alghassi, H.: Prime factorization using quantum annealing and computational algebraic geometry. Sci. Rep. 7, 43048 (2017)ADSCrossRef Dridi, R., Alghassi, H.: Prime factorization using quantum annealing and computational algebraic geometry. Sci. Rep. 7, 43048 (2017)ADSCrossRef
15.
Zurück zum Zitat Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)MATH Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)MATH
16.
Zurück zum Zitat Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009)ADSMathSciNetCrossRef Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009)ADSMathSciNetCrossRef
17.
Zurück zum Zitat Jiang, S., Britt, K.A., McCaskey, A.J., Humble, T.S., Kais, S.: Quantum annealing for prime factorization. Sci. Rep. 8, 1–9 (2018)CrossRef Jiang, S., Britt, K.A., McCaskey, A.J., Humble, T.S., Kais, S.: Quantum annealing for prime factorization. Sci. Rep. 8, 1–9 (2018)CrossRef
18.
Zurück zum Zitat Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355 (1998)ADSCrossRef Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355 (1998)ADSCrossRef
19.
Zurück zum Zitat Karimi, S., Ronagh, P.: Practical integer-to-binary mapping for quantum annealers. Quantum Inf. Process. 18(4), 94 (2019)ADSMathSciNetCrossRef Karimi, S., Ronagh, P.: Practical integer-to-binary mapping for quantum annealers. Quantum Inf. Process. 18(4), 94 (2019)ADSMathSciNetCrossRef
20.
Zurück zum Zitat Khoshaman, A., Vinci, W., Denis, B., Andriyash, E., Amin, M.H.: Quantum variational autoencoder. Quantum Sci. Technol. 4(1), 014001 (2018)ADSCrossRef Khoshaman, A., Vinci, W., Denis, B., Andriyash, E., Amin, M.H.: Quantum variational autoencoder. Quantum Sci. Technol. 4(1), 014001 (2018)ADSCrossRef
21.
Zurück zum Zitat Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)MathSciNetCrossRef Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)MathSciNetCrossRef
22.
Zurück zum Zitat Pakin, S.: Performing fully parallel constraint logic programming on a quantum annealer. Theory Pract. Logic Program. 18(5–6), 928–949 (2018)MathSciNetCrossRef Pakin, S.: Performing fully parallel constraint logic programming on a quantum annealer. Theory Pract. Logic Program. 18(5–6), 928–949 (2018)MathSciNetCrossRef
23.
Zurück zum Zitat Peng, X., Liao, Z., Xu, N., Qin, G., Zhou, X., Suter, D., Du, J.: Quantum adiabatic algorithm for factorization and its experimental implementation. Phys. Rev. Lett. 101(22), 220405 (2008)ADSCrossRef Peng, X., Liao, Z., Xu, N., Qin, G., Zhou, X., Suter, D., Du, J.: Quantum adiabatic algorithm for factorization and its experimental implementation. Phys. Rev. Lett. 101(22), 220405 (2008)ADSCrossRef
24.
Zurück zum Zitat Ray, P., Chakrabarti, B.K., Chakrabarti, A.: Sherrington–Kirkpatrick model in a transverse field: absence of replica symmetry breaking due to quantum fluctuations. Phys. Rev. B 39(16), 11828 (1989)ADSCrossRef Ray, P., Chakrabarti, B.K., Chakrabarti, A.: Sherrington–Kirkpatrick model in a transverse field: absence of replica symmetry breaking due to quantum fluctuations. Phys. Rev. B 39(16), 11828 (1989)ADSCrossRef
25.
Zurück zum Zitat Rosenberg, I.G.: Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d’etudes de Recherche Operationnelle 17, 71–74 (1975)MathSciNetMATH Rosenberg, I.G.: Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d’etudes de Recherche Operationnelle 17, 71–74 (1975)MathSciNetMATH
26.
Zurück zum Zitat Santoro, G.E., Martoňák, R., Tosatti, E., Car, R.: Theory of quantum annealing of an Ising spin glass. Science 295(5564), 2427–2430 (2002)ADSCrossRef Santoro, G.E., Martoňák, R., Tosatti, E., Car, R.: Theory of quantum annealing of an Ising spin glass. Science 295(5564), 2427–2430 (2002)ADSCrossRef
27.
Zurück zum Zitat Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)ADSMathSciNetCrossRef Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)ADSMathSciNetCrossRef
29.
Zurück zum Zitat Subaşı, Y.B.U., Somma, R.D., Orsucci, D.: Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing. Phys. Rev. Lett. 122, 060504 (2019)ADSCrossRef Subaşı, Y.B.U., Somma, R.D., Orsucci, D.: Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing. Phys. Rev. Lett. 122, 060504 (2019)ADSCrossRef
30.
Zurück zum Zitat Watson, L.T., Sosonkina, M., Melville, R.C., Morgan, A.P., Walker, H.F.: Algorithm 777: Hompack90: a suite of fortran 90 codes for globally convergent homotopy algorithms. ACM Trans. Math. Softw. (TOMS) 23(4), 514–549 (1997)MathSciNetCrossRef Watson, L.T., Sosonkina, M., Melville, R.C., Morgan, A.P., Walker, H.F.: Algorithm 777: Hompack90: a suite of fortran 90 codes for globally convergent homotopy algorithms. ACM Trans. Math. Softw. (TOMS) 23(4), 514–549 (1997)MathSciNetCrossRef
31.
Zurück zum Zitat Wen, J., Kong, X., Wei, S., Wang, B., Xin, T., Long, G.: Experimental realization of quantum algorithms for a linear system inspired by adiabatic quantum computing. Phys. Rev. A 99, 012320 (2019)ADSCrossRef Wen, J., Kong, X., Wei, S., Wang, B., Xin, T., Long, G.: Experimental realization of quantum algorithms for a linear system inspired by adiabatic quantum computing. Phys. Rev. A 99, 012320 (2019)ADSCrossRef
Metadaten
Titel
Least-squares solutions to polynomial systems of equations with quantum annealing
verfasst von
Tyler H. Chang
Thomas C. H. Lux
Sai Sindhura Tipirneni
Publikationsdatum
01.12.2019
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 12/2019
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-019-2489-x

Weitere Artikel der Ausgabe 12/2019

Quantum Information Processing 12/2019 Zur Ausgabe