Related papers: Nonequilibrium work performed in quantum annealing
We introduce a novel Simulated Quantum Annealing (SQA) algorithm which employs a multispin quantum fluctuation operator. At variance with the usual transverse field, short-range two-spin flip interactions are included in the driver…
Usually the calculation of work distributions in an arbitrary nonequilibrium process in a quantum system, especially in a quantum many-body system is extremely cumbersome. For all quantum systems described by quadratic Hamiltonians, we…
The validity of the Jarzynski equation for a very simple, exactly solvable quantum system is analyzed. The implications of two different definitions of work proposed in the literature are investigated. The first one derives from…
At non-zero temperature classical systems exhibit statistical fluctuations of thermodynamic quantities arising from the variation of the system's initial conditions and its interaction with the environment. The fluctuating work, for…
The EM algorithm is a novel numerical method to obtain maximum likelihood estimates and is often used for practical calculations. However, many of maximum likelihood estimation problems are nonconvex, and it is known that the EM algorithm…
Work is an observable quantity associated with a process, however there is no Hermitian operator associated with its measurement. We consider an ancilla-assisted protocol measuring the work done on a quantum system driven by a…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
We develop a hybrid type of quantum annealing in which we control temperature and quantum field simultaneously. We study the efficiency of proposed quantum annealing and find a good schedule of changing thermal fluctuation and quantum…
We study the physics of quantum phase transitions from the perspective of non-equilibrium thermodynamics. For first order quantum phase transitions, we find that the average work done per quench in crossing the critical point is…
Quantum annealing has great promise in leveraging quantum mechanics to solve combinatorial optimisation problems. However, to realize this promise to it's fullest extent we must appropriately leverage the underlying physics. In this spirit,…
Statistical functions such as the moment-generating function, characteristic function, cumulant-generating function, and second characteristic function are cornerstone tools in classical statistics and probability theory. They provide a…
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 R\'enyi entanglement entropy in quantum many-body systems can be viewed as the difference in free energy between partition functions with different trace topologies. We introduce an external field $\lambda$ that controls the partition…
Research on the out-of-equilibrium dynamics of quantum systems has so far produced important statements on the thermodynamics of small systems undergoing quantum mechanical evolutions. Key examples are provided by the Crooks and Jarzynski…
In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative…
We employ a quantum macrostatistical treatment of irreversible processes to prove that, in nonequilibrium steady states, (a) the hydrodynamical observables execute a generalised Onsager-Machlup process and (b) the spatial correlations of…
The theory of Gaussian quantum fluctuations around classical steady states in nonlinear quantum-optical systems (also known as standard linearization) is a cornerstone for the analysis of such systems. Its simplicity, together with its…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of 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…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…