Quantum thermodynamics and semi-definite optimization
- URL: http://arxiv.org/abs/2505.04514v2
- Date: Mon, 12 May 2025 17:33:50 GMT
- Title: Quantum thermodynamics and semi-definite optimization
- Authors: Nana Liu, Michele Minervini, Dhrumil Patel, Mark M. Wilde,
- Abstract summary: In quantum thermodynamics, a system is described by a Hamiltonian and a goal is to determine the system's minimum energy.<n>In optimization theory, a semi-definite program (SDP) involves a linear objective function optimized over the cone of positive semi-definite operators.<n>By adopting Jaynes' mindset motivated by quantum thermodynamics, we observe that minimizing free energy in the aforementioned thermodynamics problem, instead of energy, leads to an elegant solution.
- Score: 3.7498611358320733
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In quantum thermodynamics, a system is described by a Hamiltonian and a list of non-commuting charges representing conserved quantities like particle number or electric charge, and an important goal is to determine the system's minimum energy in the presence of these conserved charges. In optimization theory, a semi-definite program (SDP) involves a linear objective function optimized over the cone of positive semi-definite operators intersected with an affine space. These problems arise from differing motivations in the physics and optimization communities and are phrased using very different terminology, yet they are essentially identical mathematically. By adopting Jaynes' mindset motivated by quantum thermodynamics, we observe that minimizing free energy in the aforementioned thermodynamics problem, instead of energy, leads to an elegant solution in terms of a dual chemical potential maximization problem that is concave in the chemical potential parameters. As such, one can employ standard (stochastic) gradient ascent methods to find the optimal values of these parameters, and these methods are guaranteed to converge quickly. At low temperature, the minimum free energy provides an excellent approximation for the minimum energy. We then show how this Jaynes-inspired gradient-ascent approach can be used in both first- and second-order classical and hybrid quantum-classical algorithms for minimizing energy, and equivalently, how it can be used for solving SDPs, with guarantees on the runtimes of the algorithms. The approach discussed here is well grounded in quantum thermodynamics and, as such, provides physical motivation underpinning why algorithms published fifty years after Jaynes' seminal work, including the matrix multiplicative weights update method, the matrix exponentiated gradient update method, and their quantum algorithmic generalizations, perform well at solving SDPs.
Related papers
- Heat semigroup representation of Laplacian [0.0]
This work introduces novel numerical algorithms for computational quantum mechanics.<n>The key advantage of this approach lies in its computational efficiency.<n>The proposed multiwavelet-based Laplacian approximation is tested through two fundamental quantum chemistry applications.
arXiv Detail & Related papers (2025-01-15T14:17:13Z) - Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer [0.0]
We study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware.
The algorithm uses projections of the Schr"odinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian.
We present numerical evidence of superiority over both the optimization introduced in arXiv:2102.00345 and VQE optimized using the Broyden Fletcher Goldfarb Shanno (BFGS) method.
arXiv Detail & Related papers (2024-10-19T15:03:59Z) - Linear response theory for cavity QED materials at arbitrary light-matter coupling strengths [41.94295877935867]
We develop a linear response theory for materials collectively coupled to a cavity that is valid in all regimes of light-matter coupling.<n>We compare two different approaches to obtain thermal Green functions.<n>We use a mean-field decoupling of high-order Green functions in order to obtain a closed, solvable system of equations.
arXiv Detail & Related papers (2024-06-17T18:00:07Z) - Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the
Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
"Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it.
We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
arXiv Detail & Related papers (2023-07-06T17:54:08Z) - Thermodynamically ideal quantum-state inputs to any device [1.4747234049753448]
We demonstrate that the expectation values of entropy flow, heat, and work can all be determined via Hermitian observables of the initial state.
We show how to construct these Hermitian operators from measurements of thermodynamic output from a finite number of effectively arbitrary inputs.
arXiv Detail & Related papers (2023-05-01T01:13:23Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - Adiabatic quantum computing with parameterized quantum circuits [0.0]
We propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device.
We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems.
arXiv Detail & Related papers (2022-06-09T09:31:57Z) - Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity.
We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z) - Approximating quantum thermodynamic properties using DFT [0.0]
We compare simple' and hybrid' approximations to the average work and entropy variation built on static density functional theory concepts.
Our results confirm that a hybrid' approach requires a very good approximation of the initial and, for the entropy, final states of the system.
This approach should be particularly efficient when many-body effects are not increased by the driving Hamiltonian.
arXiv Detail & Related papers (2022-01-14T17:11:49Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Algorithm for initializing a generalized fermionic Gaussian state on a
quantum computer [0.0]
We present explicit expressions for the central piece of a variational method developed by Shi et al.
We derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and subroutine operators.
We present a simple gradient-descent-based algorithm that can be used as an optimization in combination with imaginary time evolution.
arXiv Detail & Related papers (2021-05-27T10:31:45Z) - Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves.
We find both methods provide good estimates of the energy and ground state.
gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
arXiv Detail & Related papers (2020-11-02T19:52:04Z) - Method of spectral Green functions in driven open quantum dynamics [77.34726150561087]
A novel method based on spectral Green functions is presented for the simulation of driven open quantum dynamics.
The formalism shows remarkable analogies to the use of Green functions in quantum field theory.
The method dramatically reduces computational cost compared with simulations based on solving the full master equation.
arXiv Detail & Related papers (2020-06-04T09:41:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.