Related papers: A Faster Algorithm for the Free Energy in One-Dime…
We propose the construction of thermodynamic ensembles that minimize the R\'enyi free energy, as an alternative to Gibbs states. For large systems, the local properties of these R\'enyi ensembles coincide with those of thermal equilibrium,…
We develop a framework to simulate quantum field theories (QFTs) with boundaries in $(1+1)$-dimenmsional curved spacetimes by employing open spin systems. Building upon our previous work that established a mapping from spin systems to QFTs…
We show that if an efficient classical representation of the dynamics exists, optimal control problems on many-body quantum systems can be solved efficiently with finite precision. We show that the size of the space of parameters necessary…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it…
We develop a quantum-classical hybrid algorithm for function optimization that is particularly useful in the training of neural networks since it makes use of particular aspects of high-dimensional energy landscapes. Due to a recent…
Along with the scaling of dimensions in quantum systems, transitions between the system's energy levels would become close in frequency, which are conventionally resolved by weak and lengthy pulses. Here, we extend and experimentally…
The new scheme employed (throughout the thermodynamic phase space), in the statistical thermodynamic investigation of classical systems, is extended to quantum systems. Quantum Nearest Neighbor Probability Density Functions are formulated…
Energy system models based on linear programming have been growing in size with the increasing need to model renewables with high spatial and temporal detail. Larger models lead to high computational requirements. Furthermore, seemingly…
The computation of free energies is a common issue in statistical physics. A natural technique to compute such high dimensional integrals is to resort to Monte Carlo simulations. However these techniques generally suffer from a high…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
This paper presents a quantum approach for the formulation and solution of the prosumer problem, i.e., the problem of minimizing the energy cost incurred by a number of users in an energy community, while addressing the constraints given by…
We consider a double quantum dot system with two embedded and non-aligned spin impurities to manipulate the magnitude and polarization of the electron spin density. The device is attached to semi-infinite one-dimensional leads which are…
We propose fast and practical quantum-inspired classical algorithms for solving linear systems. Specifically, given sampling and query access to a matrix $A\in\mathbb{R}^{m\times n}$ and a vector $b\in\mathbb{R}^m$, we propose classical…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
We present an $(1+\varepsilon)$-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is $n^{O(…
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem.…
We study two-dimensional quantum Carnot engines of spherical symmetry by considering the case of a particle on the surface of a sphere of changing radius. The Carnot cycle is built allowing the state of the system to change with the…