Simulated Quantum Computation of Global Minima

Abstract

Finding the optimal solution to a complex optimization problem is of great importance in practically all fields of science, technology, technical design and econometrics. We demonstrate that a modified Grover's quantum algorithm can be applied to real problems of finding a global minimum using modest numbers of quantum bits. Calculations of the global minimum of simple test functions and Lennard-Jones clusters have been carried out on a quantum computer simulator using a modified Grover's algorithm. The number of function evaluations $N$ reduced from O(N) in classical simulation to $O(\sqrt{N})$ in quantum simulation. We also show how the Grover's quantum algorithm can be combined with the classical Pivot method for global optimization to treat larger systems.

6 figures. Molecular Physics, in press

References in corpus (3)

• Simulated Quantum Computation of Molecular Energies
• On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems

Cited by in corpus (4)

• Implementation of Quantum Logic Gates Using Polar Molecules in Pendular States
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Group Leaders Optimization Algorithm
• Quantum Global Minimum Finder based on Variational Quantum Search