Optimizing random local Hamiltonians by dissipation

A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin or fermionic $k$-local Hamiltonian. We prove that a simplified quantum Gibbs sampling algorithm achieves a $\Omega(\frac{1}{k})$-fraction approximation of the optimum, giving an exponential improvement on the $k$-dependence over the prior best (both classical and quantum) algorithmic guarantees. Combined with the circuit lower bound for such states, our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial. This further indicates that quantum Gibbs sampling may be a suitable metaheuristic for optimization problems.

Publication Details

Journal
arXiv (Cornell University)
Published
2024-11-04
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing random local Hamiltonians by dissipation

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
article

Optimizing random local Hamiltonians by dissipation

article en

Abstract

A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin or fermionic $k$-local Hamiltonian. We prove that a simplified quantum Gibbs sampling algorithm achieves a $\Omega(\frac{1}{k})$-fraction approximation of the optimum, giving an exponential improvement on the $k$-dependence over the prior best (both classical and quantum) algorithmic guarantees. Combined with the circuit lower bound for such states, our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial. This further indicates that quantum Gibbs sampling may be a suitable metaheuristic for optimization problems.

arXiv (Cornell University)
National Science Foundation
Affordable and clean energy
Openalex Percentile: Top 56%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.