Related papers: Quantum Annealing with Jarzynski Equality (CCP2009…
The Jarzynski equality (JE) is known as an exact identity for nonequillibrium systems. The JE was originally formulated for isolated and isothermal systems, while Adib reported an JE extended to an isoenergetic process. In this paper, we…
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale…
We introduce a simple enhanced sampling approach for the calculation of free energy differences and barriers along a one-dimensional reaction coordinate. First, a small number of short nonequilibrium simulations are carried out along the…
The quest for real-time dynamic optimization solutions in the process industry represents a formidable computational challenge, particularly within the realm of applications like model-predictive control, where rapid and reliable…
In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many…
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where…
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that promise to solve certain combinatorial optimization problems of practical relevance faster than their…
Work is a process-based quantity, and its measurement typically requires interaction with a measuring device multiple times. While classical systems allow for non-invasive and accurate measurements, quantum systems present unique challenges…
The Jarzynski equality is one of the most influential results in the field of non equilibrium statistical mechanics. This celebrated equality allows to calculate equilibrium free energy differences from work distributions of nonequilibrium…
The past two decades witnessed important developments in the field of non-equilibrium statistical mechanics. Among these developments, the Jarzynski equality, being a milestone following the landmark work of Clausius and Kelvin, stands out.…
In the rapidly advancing domain of quantum optimization, the confluence of quantum algorithms such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) with robust optimization methodologies presents a…
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…
The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations…
Jarzynski's nonequilibrium work relation can be understood as the realization of the (hidden) time-generator reciprocal symmetry satisfied for the conditional probability function. To show this, we introduce the reciprocal process where the…
Quantum annealing is a method developed to solve combinatorial optimization problems by utilizing quantum bits. Solving such problems corresponds to minimizing a cost function defined over binary variables. However, in many practical cases,…
The Jarzynski equality equates the mean of the exponential of the negative of the work (per fixed temperature) done by a changing Hamiltonian on a system, initially in thermal equilibrium at that temperature, to the ratio of the final to…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
We give a quantum version of the Jarzynski relation between the distribution of work done over a certain time-interval on a system and the difference of equilibrium free energies. The main new ingredient is the identification of work…
We study the quantum Jarzynski relation for driven quantum models embedded in various environments. We do so by generalizing a proof presented by Mukamel [Phys. Rev. Lett 90, 170604 (2003)] for closed quantum systems. In this way, we are…