Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.11285

Analogue quantum simulation with polylogarithmic interaction strengths by extrapolating within phases of matter

Dylan Harley, Matthias Christandl

quant-phSubmitted May 11, 2026• Announced May 13, 2026• 1 citation
arXivHTMLPDF

Abstract

Simple families of quantum Hamiltonians can simulate general many-body systems at arbitrary precision through the use of perturbative gadgets, however this generally requires interaction strengths spanning many orders of magnitude which scale polynomially in the system size and inverse precision, resulting in physically unrealisable systems. In this work, we show that for non-critical systems these required scalings can be exponentially reduced through classical post-processing, by simulating the model at smaller energy scales and extrapolating observables to the perturbative limit. In particular, we show that both local and extensive properties of thermal states with exponentially decaying correlations and ground states with a sufficiently stable gap can be simulated using gadgets whose interaction strengths scale only polylogarithmically in the inverse precision and the system size. As a key tool, we develop a generalised treatment of the local Schrieffer-Wolff transformation for geometrically quasi-local Hamiltonians over many energy scales, facilitating the analysis of perturbative gadget Hamiltonians without extensive global energy penalities, which may be of independent interest.

Comments
80 pages, 5 figures

Related papers

Perturbative gadgets without strong interactions

Yudong Cao, Daniel Nagaj

Perturbative gadgets are used to construct a quantum Hamiltonian whose low-energy subspace approximates a given quantum $k$-local Hamiltonian up to an absolute error $\epsilon$. Typically, gadget constructions involve terms with large interaction strengths of order $\text{poly}(\epsilon^{-1})$. Here we present a 2-body gadget construction and prove that it approximates a Hamiltonian of interaction strength $\gamma = O(1)$ up to absolute error $\epsilon\ll\gamma$ using interactions of strength $O(\epsilon)$ instead of the usual inverse polynomial in $\epsilon$. A key component in our proof is a new condition for the convergence of the perturbation series, allowing our gadget construction to be applied in parallel on multiple many-body terms. We also discuss how to apply this gadget construction for approximating 3- and $k$-local Hamiltonians. The price we pay for using much weaker interactions is a large overhead in the number of ancillary qubits, and the number of interaction terms per particle, both of which scale as $O(\text{poly}(\epsilon^{-1}))$. Our strong-from-weak gadgets have their primary application in complexity theory (QMA hardness of restricted Hamiltonians, a generalized area law counterexample, gap amplification), but could also motivate practical implementations with several weak interactions simulating a much stronger quantum many-body interaction.

arXiv:1408.5881•Quantum Information and Computation•Oct 1, 2015•23 citations

Quantum Simulation of Many-Body Hamiltonians Using Perturbation Theory with Bounded-Strength Interactions

Sergey B. Bravyi, David Peter Divincenzo, Daniel Loss +1 more

We show how to map a given n-qubit target Hamiltonian with bounded-strength k-body interactions onto a simulator Hamiltonian with two-body interactions, such that the ground-state energy of the target and the simulator Hamiltonians are the same up to an extensive error O(epsilon n) for arbitrary small epsilon. The strength of the interactions in the simulator Hamiltonian depends on epsilon and k but does not depend on n. We accomplish this reduction using a new way of deriving an effective low-energy Hamiltonian which relies on the Schrieffer-Wolff transformation of many-body physics.

arXiv:0803.2686•Physical Review Letters•Aug 15, 2008•97 citations

Efficient learning of ground and thermal states within phases of matter

Cambyse Rouzé, Daniel Stilck França, Emilio Onorati +1 more

We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; (b) learning the expectation values of local observables within a thermal or quantum phase of matter. In both cases, we present sample-efficient ways to learn these properties to high precision. For the first task, we develop techniques to learn parameterisations of classes of systems, including quantum Gibbs states for classes of non-commuting Hamiltonians. We then give methods to sample-efficiently infer expectation values of extensive properties of the state, including quasi-local observables and entropies. For the second task, we exploit the locality of Hamiltonians to show that M local observables can be learned with probability 1 − δ and precision ε using $$N={\mathcal{O}}\left(\log \left(\frac{M}{\delta }\right){e}^{{\rm{polylog}}({\varepsilon }^{-1})}\right)$$ samples — exponentially improving previous bounds. Our results apply to both families of ground states of Hamiltonians displaying local topological quantum order, and thermal phases of matter with exponentially decaying correlations. Scalable characterisation of quantum states can be achieved by leveraging on simplifications valid for specific classes of states. Here, the authors show how to combine the strengths of shadows and many-body tomography for all states exhibiting exponential decay of correlations and the approximate Markov property.

arXiv:2301.12946•Nature Communications•Sep 5, 2024•63 citations

Adiabatic Quantum Simulation of Quantum Chemistry

Ryan Babbush, Peter J. Love, Alán Aspuru‐Guzik

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.

arXiv:1311.3967•Scientific Reports•Oct 13, 2014•198 citations

Polylog-depth Quantum Thermal Simulation via Local Recovery Channels

Hideaki Hakoshima, Atsushi Iwaki, Nobuyuki Yoshioka

We establish sufficient conditions for preparing quantum thermal states of noncommuting local Hamiltonians with polylogarithmic circuit depth in arbitrary fixed spatial dimension. Our conditions combine locality and stability bounds on the effective interactions of reduced density matrices of a Gibbs state with a quantitative high-temperature condition and access to coarse classical reference Hamiltonians. When these references can be generated locally, the classical preprocessing cost is $N^{1+o(1)}$ for $N$ sites at inverse-polynomial global accuracy. We construct the preparation circuit from spatially localized Petz recovery maps. Quantum corrections derived from the microscopic Hamiltonian enable accurate recovery while the classical references remain coarse. After preprocessing, the resulting circuit prepares the canonical purification using $N\operatorname{polylog}(N/\varepsilon)$ gates and qubits, where $\varepsilon$ is the preparation error. These results link two fundamental questions: how correlations are organized in thermal equilibrium, and how efficiently the corresponding states can be realized through operations allowed by quantum mechanics. By translating static equilibrium structure into explicit preparation circuits, they give equilibrium locality a constructive computational interpretation and a physically grounded role in quantum algorithm design.

quant-pharXiv:2609.39674•Oct 1, 2026•0 citations

Stability of Quantum Many-Body Systems

Yin, Chao

In quantum many-body systems subjected to generic perturbations, eigenstates are typically fragile and prone to strong mixing, leading to rapid thermalization in dynamics to an equilibrium state described by statistical mechanics. However, there exist robust counterexamples that defy this typical expectation, exhibiting novel non-equilibrium phenomena and offering potential applications in (quantum) information processing. This dissertation explores such systems and establishes their stability against perturbations with mathematical rigor. First, by generalizing the exponentially slow tunneling effect in single-particle quantum mechanics, we develop a theory of metastability in quantum many-body systems, demonstrating their nonperturbatively long lifetimes. As a canonical application, we provide the first general and tight bounds on the slow decay of false vacua. Second, it is known that ground states in finite spatial dimensions can resist arbitrary local perturbations through topologically ordered phases of matter. We extend this notion of stability to quantum error-correcting codes in infinite dimensions, specifically quantum low-density parity-check (LDPC) codes. These codes are of significant interest due to their promise of lower fault-tolerance overhead compared to finite-dimensional codes. Lastly, we analyze classical counterparts of LDPC codes and prove that their eigenstates remain localized in the many-body Hilbert space under generic perturbations. This finding presents the first unambiguous example of a robust violation of the eigenstate thermalization hypothesis. To achieve these results, we introduce advanced techniques to control operator locality, leveraging and generalizing methods such as Lieb-Robinson bounds, cluster expansions, and Schrieffer-Wolff transformations. These tools not only underpin our specific findings but may also prove valuable for broader challenges in mathematical physics of quantum many-body systems.

•Mar 13, 2025•0 citations
Simple families of quantum Hamiltonians can simulate general many-body systems at arbitrary precision through the use of perturbative gadgets, however this generally requires interaction strengths spanning many orders of magnitude which scale polynomially in the system size and inverse precision, resulting in physically unrealisable systems. In this work, we show that for non-critical systems these required scalings can be exponentially reduced through classical post-processing, by simulating the model at smaller energy scales and extrapolating observables to the perturbative limit. In particular, we show that both local and extensive properties of thermal states with exponentially decaying correlations and ground states with a sufficiently stable gap can be simulated using gadgets whose interaction strengths scale only polylogarithmically in the inverse precision and the system size. As a key tool, we develop a generalised treatment of the local Schrieffer-Wolff transformation for geometrically quasi-local Hamiltonians over many energy scales, facilitating the analysis of perturbative gadget Hamiltonians without extensive global energy penalities, which may be of independent interest.
Perturbative gadgets are used to construct a quantum Hamiltonian whose low-energy subspace approximates a given quantum kkk-local Hamiltonian up to an absolute error ϵ\epsilonϵ. Typically, gadget constructions involve terms with large interaction strengths of order poly(ϵ−1)\text{poly}(\epsilon^{-1})poly(ϵ−1). Here we present a 2-body gadget construction and prove that it approximates a Hamiltonian of interaction strength γ=O(1)\gamma = O(1)γ=O(1) up to absolute error ϵ≪γ\epsilon\ll\gammaϵ≪γ using interactions of strength O(ϵ)O(\epsilon)O(ϵ) instead of the usual inverse polynomial in ϵ\epsilonϵ. A key component in our proof is a new condition for the convergence of the perturbation series, allowing our gadget construction to be applied in parallel on multiple many-body terms. We also discuss how to apply this gadget construction for approximating 3- and kkk-local Hamiltonians. The price we pay for using much weaker interactions is a large overhead in the number of ancillary qubits, and the number of interaction terms per particle, both of which scale as O(poly(ϵ−1))O(\text{poly}(\epsilon^{-1}))O(poly(ϵ−1)). Our strong-from-weak gadgets have their primary application in complexity theory (QMA hardness of restricted Hamiltonians, a generalized area law counterexample, gap amplification), but could also motivate practical implementations with several weak interactions simulating a much stronger quantum many-body interaction.
We show how to map a given n-qubit target Hamiltonian with bounded-strength k-body interactions onto a simulator Hamiltonian with two-body interactions, such that the ground-state energy of the target and the simulator Hamiltonians are the same up to an extensive error O(epsilon n) for arbitrary small epsilon. The strength of the interactions in the simulator Hamiltonian depends on epsilon and k but does not depend on n. We accomplish this reduction using a new way of deriving an effective low-energy Hamiltonian which relies on the Schrieffer-Wolff transformation of many-body physics.
We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; (b) learning the expectation values of local observables within a thermal or quantum phase of matter. In both cases, we present sample-efficient ways to learn these properties to high precision. For the first task, we develop techniques to learn parameterisations of classes of systems, including quantum Gibbs states for classes of non-commuting Hamiltonians. We then give methods to sample-efficiently infer expectation values of extensive properties of the state, including quasi-local observables and entropies. For the second task, we exploit the locality of Hamiltonians to show that M local observables can be learned with probability 1 − δ and precision ε using N=O(log⁡(Mδ)epolylog(ε−1))N={\mathcal{O}}\left(\log \left(\frac{M}{\delta }\right){e}^{{\rm{polylog}}({\varepsilon }^{-1})}\right)N=O(log(δM​)epolylog(ε−1)) samples — exponentially improving previous bounds. Our results apply to both families of ground states of Hamiltonians displaying local topological quantum order, and thermal phases of matter with exponentially decaying correlations. Scalable characterisation of quantum states can be achieved by leveraging on simplifications valid for specific classes of states. Here, the authors show how to combine the strengths of shadows and many-body tomography for all states exhibiting exponential decay of correlations and the approximate Markov property.
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.
We establish sufficient conditions for preparing quantum thermal states of noncommuting local Hamiltonians with polylogarithmic circuit depth in arbitrary fixed spatial dimension. Our conditions combine locality and stability bounds on the effective interactions of reduced density matrices of a Gibbs state with a quantitative high-temperature condition and access to coarse classical reference Hamiltonians. When these references can be generated locally, the classical preprocessing cost is N1+o(1)N^{1+o(1)}N1+o(1) for NNN sites at inverse-polynomial global accuracy. We construct the preparation circuit from spatially localized Petz recovery maps. Quantum corrections derived from the microscopic Hamiltonian enable accurate recovery while the classical references remain coarse. After preprocessing, the resulting circuit prepares the canonical purification using Npolylog⁡(N/ε)N\operatorname{polylog}(N/\varepsilon)Npolylog(N/ε) gates and qubits, where ε\varepsilonε is the preparation error. These results link two fundamental questions: how correlations are organized in thermal equilibrium, and how efficiently the corresponding states can be realized through operations allowed by quantum mechanics. By translating static equilibrium structure into explicit preparation circuits, they give equilibrium locality a constructive computational interpretation and a physically grounded role in quantum algorithm design.
In quantum many-body systems subjected to generic perturbations, eigenstates are typically fragile and prone to strong mixing, leading to rapid thermalization in dynamics to an equilibrium state described by statistical mechanics. However, there exist robust counterexamples that defy this typical expectation, exhibiting novel non-equilibrium phenomena and offering potential applications in (quantum) information processing. This dissertation explores such systems and establishes their stability against perturbations with mathematical rigor. First, by generalizing the exponentially slow tunneling effect in single-particle quantum mechanics, we develop a theory of metastability in quantum many-body systems, demonstrating their nonperturbatively long lifetimes. As a canonical application, we provide the first general and tight bounds on the slow decay of false vacua. Second, it is known that ground states in finite spatial dimensions can resist arbitrary local perturbations through topologically ordered phases of matter. We extend this notion of stability to quantum error-correcting codes in infinite dimensions, specifically quantum low-density parity-check (LDPC) codes. These codes are of significant interest due to their promise of lower fault-tolerance overhead compared to finite-dimensional codes. Lastly, we analyze classical counterparts of LDPC codes and prove that their eigenstates remain localized in the many-body Hilbert space under generic perturbations. This finding presents the first unambiguous example of a robust violation of the eigenstate thermalization hypothesis. To achieve these results, we introduce advanced techniques to control operator locality, leveraging and generalizing methods such as Lieb-Robinson bounds, cluster expansions, and Schrieffer-Wolff transformations. These tools not only underpin our specific findings but may also prove valuable for broader challenges in mathematical physics of quantum many-body systems.