Related papers: Nonequilibrium work performed in quantum annealing
Classical and quantum annealing is discussed for a kinetically constrained chain of $N$ non-interacting asymmetric double wells, represented by Ising spins in a longitudinal field $h$. It is shown that in certain cases, where the kinetic…
Quantum computing has the potential for disruptive change in many sectors of industry, especially in materials science and optimization. In this paper, we describe how the Turbine Balancing Problem can be solved with quantum computing,…
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function…
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of…
Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or transverse ferromagnetic interactions, and…
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…
The universal quantum work relation connects a functional of an arbitrary observable averaged over the forward process to the free energy difference and another functional averaged over the time-reversed process. Here, we ask the question…
We investigate a stochastic approach to non-equilibrium quantum spin systems based on recent insights linking quantum and classical dynamics. Exploiting a sequence of exact transformations, quantum expectation values can be recast as…
Reverse annealing is a relatively new variant of quantum annealing, in which one starts from a classical state and increases and then decreases the amplitude of the transverse field, in the hope of finding a better classical state than the…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
Quantum thermodynamics allows for the interconversion of quantum coherence and mechanical work. Quantum coherence is thus a potential physical resource for quantum machines. However, formulating a general nonequilibrium thermodynamics of…
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…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
Quantum computation offers exciting new possibilities for statistics. This paper explores the use of the D-Wave machine, a specialized type of quantum computer, which performs quantum annealing. A general description of quantum annealing…
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…
In this contribution, we aim to illustrate how quantum work statistics can be used as a tool in order to gain insight on the universal features of non-equilibrium many-body systems. Focusing on the two point measurement approach to work, we…
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field by Kadowaki and Nishimori close to two decades ago. Recent technological breakthroughs in…
The two-time measurement scheme is well studied in the context of quantum fluctuation theorem. However, it becomes infeasible when the random variable determined by a single measurement trajectory is associated with the von-Neumann entropy…
The Path Integral Monte Carlo simulated Quantum Annealing algorithm is applied to the optimization of a large hard instance of the Random 3-SAT Problem (N=10000). The dynamical behavior of the quantum and the classical annealing are…
Simulated quantum annealing based on the path-integral Monte Carlo is one of the most common tools to simulate quantum annealing on classical hardware. Nevertheless, it is in principle highly non-trivial whether or not this classical…