Trajectory optimization using quantum computing

DOI10.1007/S10898-019-00754-5MaRDI QIDQ2274880zbMATH OpenOpenAlexFDO

Authors Alok Kumar Shukla, Prakash Vedula

Publication date 1 October 2019

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.04123

zbMATH Keywords

global optimizationcalculus of variationsquantum computationtrajectory optimizationbrachistochrone problemrandomized search algorithm

Mathematics Subject Classification ID

Quantum computation (81P68) Discrete approximations in optimal control (49M25)

Abstract: We present a framework wherein the trajectory optimization problem (or a problem involving calculus of variations) is formulated as a search problem in a discrete space. A distinctive feature of our work is the treatment of discretization of the optimization problem wherein we discretize not only independent variables (such as time) but also dependent variables. Our discretization scheme enables a reduction in computational cost through selection of coarse-grained states. It further facilitates the solution of the trajectory optimization problem via classical discrete search algorithms including deterministic and stochastic methods for obtaining a global optimum. This framework also allows us to efficiently use quantum computational algorithms for global trajectory optimization. We demonstrate that the discrete search problem can be solved by a variety of techniques including a deterministic exhaustive search in the physical space or the coefficient space, a randomized search algorithm, a quantum search algorithm or by employing a combination of randomized and quantum search algorithms depending on the nature of the problem. We illustrate our methods by solving some canonical problems in trajectory optimization. We also present a comparative study of the performances of different methods in solving our example problems. Finally, we make a case for using quantum search algorithms as they offer a quadratic speed-up in comparison to the traditional non-quantum algorithms.

Recommendations

• Quantum optimization
• scientific article; zbMATH DE number 2013817
• Quantum stochastic optimization
• Trajectory tracking theory of quantum systems
• scientific article; zbMATH DE number 5788684
• Switching optimal adaptive trajectory tracking control of quantum systems
• scientific article; zbMATH DE number 510355
• A quantum computing based numerical method for solving mixed-integer optimal control problems
• Improving quantum computation by optimized qubit routing

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3165758 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1820648 (Why is no real title available?)
• scientific article; zbMATH DE number 2233862 (Why is no real title available?)
• scientific article; zbMATH DE number 3066379 (Why is no real title available?)
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• A new hybrid classical-quantum algorithm for continuous global optimization problems
• Combining a local search and Grover's algorithm in black-box global optimization
• Direct and indirect methods for trajectory optimization
• Implementing pure adaptive search with Grover's quantum algorithm
• Pure adaptive search in Monte Carlo optimization
• Pure adaptive search in global optimization
• Quantum Computing for Computer Scientists
• Quantum computing. A gentle introduction
• Survey of Numerical Methods for Trajectory Optimization

Cited in

(2)

• Time-optimal navigation through quantum wind
• A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle

This page was built for publication: Trajectory optimization using quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274880)