Curve fitting on a quantum annealer for an advanced navigation method

Abstract

We explore the applicability of quantum annealing to the approximation task of curve fitting. To this end, we consider a function that shall approximate a given set of data points and is written as a finite linear combination of standardized functions, e.g., orthogonal polynomials. Consequently, the decision variables subject to optimization are the coefficients of that expansion. Although this task can be accomplished classically, it can also be formulated as a quadratic unconstrained binary optimization problem, which is suited to be solved with quantum annealing. Given the size of the problem stays below a certain threshold, we find that quantum annealing yields comparable results to the classical solution. Regarding a real-world use case, we discuss the problem to find an optimized speed profile for a vessel using the framework of dynamic programming and outline how the aforementioned approximation task can be put into play. Similar to the curve fitting task, our findings indicate that quantum annealing is currently only feasible if the routing problem is modeled sufficiently small and sparse.

17 pages, 7 figures, 5 tables; v3: minor corrections and clarifications

References in corpus (20)

• Ising formulations of many NP problems
• DGM: A deep learning algorithm for solving partial differential equations
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Quantum annealing with more than one hundred qubits
• Baryons as relativistic three-quark bound states
• Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
• Architectural considerations in the design of a superconducting quantum annealing processor
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Entanglement in a quantum annealing processor
• Experimental Demonstration of a Robust and Scalable Flux Qubit
• Quantum Speedup by Quantum Annealing
• A scalable control system for a superconducting adiabatic quantum optimization processor
• A scalable readout system for a superconducting adiabatic quantum optimization system
• Josephson parametric phase-locked oscillator and its application to dispersive readout of superconducting qubits
• Annealing by simulating the coherent Ising machine
• A cross-disciplinary introduction to quantum annealing-based algorithms
• Recent developments in bound-state calculations using the Dyson-Schwinger and Bethe-Salpeter equations
• Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
• A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions