We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Least-squares solutions to polynomial systems of equations with quantum annealing.
- Authors
Chang, Tyler H.; Lux, Thomas C. H.; Tipirneni, Sai Sindhura
- 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.
- Subjects
QUANTUM annealing; POLYNOMIALS; QUANTUM computing; COMPUTER security; LEAST squares; YANG-Baxter equation
- Publication
Quantum Information Processing, 2019, Vol 18, Issue 12, pN.PAG
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-019-2489-x