Related papers: A Faster Algorithm for the Free Energy in One-Dime…
Entropy and free-energy estimation are key in thermodynamic characterization of simulated systems ranging from spin models through polymers, colloids, protein structure, and drug-design. Current techniques suffer from being model specific,…
Quantum technologies are developing powerful tools to generate and manipulate coherent superpositions of different energy levels. Envisaging a new generation of energy-efficient quantum devices, here we explore how coherence can be…
We study the spin- and energy dynamics in one-dimensional spin-1/2 systems induced by local quantum quenches at finite temperatures using a time-dependent density matrix renormalization group method. System sizes are chosen large enough to…
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach…
When studying high-dimensional dynamical systems such as macromolecules, quantum systems and polymers, a prime concern is the identification of the most probable states and their stationary probabilities or free energies. Often, these…
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
In this paper, I investigate more closely the recently proposed Free Energy Monte Carlo algorithm that is devised in particular for calculations where conventional Monte Carlo simulations struggle with ergodicity problems. The simplest…
We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume,…
This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…
We propose a new method for simulating QCD at finite density, where interesting phases such as the color superconductivity phase is conjectured to appear. The method is based on a general factorization property of distribution functions of…
In this work, we propose a method for calculating the free energy of anisotropic quantum spin systems. We use the Hubbard-Stratonovich transformation to express the partition function of a generic bilinear super-exchange Hamiltonian in…
Quantum dynamics can be analyzed via the structure of energy eigenstates. However, in the many-body setting, preparing eigenstates associated with finite temperatures requires time scaling exponentially with system size. In this work we…
Estimating transition rates in open quantum systems is hampered by computing-resource demands that grow rapidly with system size. We present a quantum-simulation framework that enables efficient estimation by recasting the transition rate,…
We consider the ability of local quantum dynamics to solve the energy matching problem: given an instance of a classical optimization problem and a low energy state, find another macroscopically distinct low energy state. Energy matching is…
We investigate the quantum algorithms for dynamic programming by Ambainis et al. (SODA'19). While giving provable complexity speedups and applicable to a variety of NP-hard problems, these algorithms have a notable drawback: they require a…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
This paper studies quantum systems with a finite number of degrees of freedom in the context of non-extensive thermodynamics. A trial density matrix, obtained by heuristic methods, is proved to be the equilibrium density matrix. If the…
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…
A new class of cost functionals for optimal control of quantum systems which produces controls which are sparse in frequency and smooth in time is proposed. This is achieved by penalizing a suitable time-frequency representation of the…
Finding optimal solutions to combinatorial optimization problems is pivotal in both scientific and technological domains, within academic research and industrial applications. A considerable amount of effort has been invested in the…