Related papers: Quantum Annealing with Jarzynski Equality (CCP2009…
Extracting equilibrium information from nonequilibrium measurements is a challenge task of great importance in understanding the thermodynamic properties of physical, chemical, and biological systems. The discovery of the Jarzynski equality…
Jarzynski equality [Phys. Rev. E {\bf 56}, 5018 (1997)] is found to be valid with slight modefication for the transitions between nonequilibrium stationary states, as well as the one between equilibrium states. Also numerical results…
The fluctuation theorems, and in particular, the Jarzynski equality, are the most important pillars of modern non-equilibrium statistical mechanics. We extend the quantum Jarzynski equality together with the Two-Time Measurement Formalism…
This study systematically benchmarks several non-fault-tolerant quantum computing algorithms across four distinct optimization problems: max-cut, number partitioning, knapsack, and quantum spin glass. Our benchmark includes noisy…
Quantum annealing is a heuristic optimization algorithm that exploits quantum evolution to approximately find lowest energy states. Quantum annealers have scaled up in recent years to tackle increasingly larger and more highly connected…
The quantum Jarzynski equality and the Crooks relation are fundamental laws connecting equilibrium processes with nonequilibrium fluctuations. They are promising tools to benchmark quantum devices and measure free energy differences. While…
We develop a mathematical approach to the nonequilibrium work theorem which is traditionally referred to in statistical mechanics as Jarzynski's identity. We suggest a mathematically rigorous formulation and proof of the identity.
Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
I propose a "quantum annealing" heuristic for the problem of combinatorial search among a frustrated set of states characterized by a cost function to be minimized. The algorithm is probabilistic, with postselection of the measurement…
The Jarzynski Equality relates the free energy difference between two equilibrium states of a system to the average of the work over all irreversible paths to go from one state to the other. We claim that the derivation of this equality is…
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno…
Although quantum computing hardware has evolved significantly in recent years, spurred by increasing industrial and government interest, the size limitation of current generation quantum computers remains an obstacle when applying these…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
We briefly introduce the quantum Jarzynski and Bochkov-Kuzovlev equalities in isolated quantum Hamiltonian systems, which includes the origin of the equalities, their derivations using a quantum Feynman-Kac formula, the quantum Crooks…
The well-known Jarzynski equality, often written in the form $e^{-\beta\Delta F}=\langle e^{-\beta W}\rangle$, provides a non-equilibrium means to measure the free energy difference $\Delta F$ of a system at the same inverse temperature…
Quantum computers show potential for achieving computational advantage over classical computers, with many candidate applications in combinatorial optimisation. We present an application level benchmarking framework for near-term quantum…
With the advent of quantum computers, researchers are exploring if quantum mechanics can be leveraged to solve important problems in ways that may provide advantages not possible with conventional or classical methods. A previous work by…
Quantum computation offers a promising alternative to classical computing methods in many areas of numerical science, with algorithms that make use of the unique way in which quantum computers store and manipulate data often achieving…