Quantum annealing with Jarzynski equality

Masayuki Ohzeki, Hidetoshi Nishimori

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


We show a practical application of a 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.

Original languageEnglish
Pages (from-to)257-259
Number of pages3
JournalComputer Physics Communications
Issue number1
Publication statusPublished - 2011 Jan


  • Jarzynski equality
  • Optimization problem
  • Quantum annealing


Dive into the research topics of 'Quantum annealing with Jarzynski equality'. Together they form a unique fingerprint.

Cite this