Quantum Metropolis Solver: A Quantum Walks Approach to Optimization Problems

  title={Quantum Metropolis Solver: A Quantum Walks Approach to Optimization Problems},
  author={Roberto Campos and Pablo Antonio Moreno Casares and Miguel A. Martin-Delgado},
The efficient resolution of optimization problems is one of the key issues in today’s industry. This task relies mainly on classical algorithms that present scalability problems and processing limitations. Quantum computing has emerged to challenge these types of problems. In this paper, we focus on the Metropolis-Hastings quantum algorithm that is based on quantum walks. We use this algorithm to build a quantum software tool called Quantum Metropolis Solver (QMS). We validate QMS with the N… 

Figures and Tables from this paper

Parameter estimation of gravitational waves with a quantum metropolis algorithm

This article proposes a quantization of the classical algorithms used in the literature for the inference of gravitational wave parameters based on the well-known quantum walks technique applied to a Metropolis–Hastings algorithm and finds a polynomial advantage in the quantum algorithms, thus setting a first starting point for future algorithms.



Quantum simulations of classical annealing processes.

A quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process by exploiting quantum walks and the quantum Zeno effect induced by evolution randomization is described.

A quantum–quantum Metropolis algorithm

This work presents a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain, and offers a quantum speedup relative to the classical counterpart.

Quantum Metropolis sampling

This paper demonstrates how to implement a quantum version of the Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles and permits sampling directly from the eigenstates of the Hamiltonian, and thus avoids the sign problem present in classical simulations.

QFold: quantum walks and deep learning to solve protein folding

The result, QFold, is a fully scalable hybrid quantum algorithm that in contrast to previous quantum approaches does not require a lattice model simplification and instead relies on the much more realistic assumption of parameterization in terms of torsion angles of the amino acids.

Search via quantum walk

The algorithm is based on a quantum walk à la Szegedy that is defined in terms of the Markov chain that is to apply quantum phase estimation to the quantumwalk in order to implement an approximate reflection operator that is then used in an amplitude amplification scheme.

Quantum speedup of Monte Carlo methods

  • A. Montanaro
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
A quantum algorithm which can accelerate Monte Carlo methods in a very general setting, achieving a near-quadratic speedup over the best possible classical algorithm.

Resource-efficient quantum algorithm for protein folding

A model Hamiltonian with O ( N 4 ) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with N monomers on a lattice is presented, reflecting many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models.

Qulacs: a fast and versatile quantum circuit simulator for research purpose

The main concepts of Qulacs are shown, how to use its features via examples, numerical techniques to speed-up simulation are described, and its performance with numerical benchmarks is demonstrated.

Quantum walk algorithm for element distinctness

  • A. Ambainis
  • Computer Science
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
An O(N/sup k/(k+1)/) query quantum algorithm is given for the generalization of element distinctness in which the authors have to find k equal items among N items.

Family of Grover’s quantum-searching algorithms

This work investigates a one-parameter family of quantum searching algorithms of Grover type and shows that the standard Grover algorithm is a distinguished member of this family and shows the stability of this constructions under perturbations of the initial conditions.