Quantum Annealing with Jarzynski Equality (CCP2009)

TL;DR

This paper explores using the Jarzynski equality in quantum computation to potentially overcome the slow convergence issues in solving complex optimization problems.

Contribution

It introduces a novel quantum strategy leveraging the Jarzynski equality to improve the efficiency of solving combinatorial optimization problems.

Findings

Demonstrates a practical application of the Jarzynski equality in quantum algorithms.

Suggests a method to bypass the slow convergence bottleneck in quantum optimization.

Proposes a new approach to quantum computation for complex minimization tasks.

Abstract

We show a practical application of an well-known nonequilibrium relation, the Jarzynski equality, in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. It has been disclosed that the ordinary quantum computational algorithm to solve a kind of hard optimization problems, has a bottleneck that its computational time is restricted to be extremely slow without relevant errors. However, by our novel strategy shown in the present study, we might overcome such a difficulty.