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:0803.2686 · Physical Review Letters

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

Sergey B. Bravyi, David Peter Divincenzo, Daniel Loss, Barbara M. Terhal

Published Aug 15, 2008• 93 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.101.070503

Related papers

A systematic method for Schrieffer-Wolff transformation and its generalizations

Rukhsan Ul Haq, Keshav Kumar Singh

Schrieffer-Wolff transformation is extensively used in quantum many-body physics to calculate the low energy effective Hamiltonian. It offers a perturbative method to understand the renormalization effects in the strong coupling regime of the quantum many-body models. The generator for Schrieffer-Wolff transformation is calculated using heuristic methods. It is highly desirable to have a rigorous, systematic and simple method for the calculation of generator for this highly important transformation. In this paper, we put forward such a method. We demonstrate our method by applying it to few well-known models from various fields like strongly correlated electron systems, quantum optics and cavity quantum electrodynamics. Our method can be applied to a broad class of quantum many-body Hamiltonians.

arXiv:2004.06534•Apr 13, 2020•1 citation

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

Dylan Harley, Matthias Christandl

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.

quant-pharXiv:2605.11285•May 13, 2026•0 citations

Beating the Natural Grover Bound for Low-Energy Estimation and State Preparation

Harry Buhrman, Sevag Gharibian, Zeph A. Landau +3 more

Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this Letter, we give quantum algorithms which, given any k-body Hamiltonian H, compute an estimate for the ground state energy and prepare a quantum state achieving said energy, respectively. Specifically, for any ϵ>0, our algorithms return, with high probability, an estimate of the ground state energy of H within additive error ϵM, or a quantum state with the corresponding energy. Here, M is the total strength of all interaction terms, which in general is extensive in the system size. Our approach makes no assumptions about the geometry or spatial locality of interaction terms of the input Hamiltonian and thus handles even long-range or all-to-all interactions, such as in quantum chemistry, where lattice-based techniques break down. In this fully general setting, the run-time of our algorithms scales as 2^{cn/2} for c<1, yielding the first quantum algorithms for low-energy estimation breaking a standard square root Grover speedup for unstructured search. The core of our approach is remarkably simple, and relies on showing that an extensive fraction of the interactions can be neglected with a controlled error. What this ultimately implies is that even arbitrary k-local Hamiltonians have structure in their low energy space, in the form of an exponential-dimensional low energy subspace.

arXiv:2407.03073•Physical Review Letters•May 28, 2025•3 citations

Quantum algorithms for Schrieffer-Wolff transformation

Zongkang Zhang, Yongdan Yang, Xiaosi Xu +1 more

The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of an unperturbed Hamiltonian. This unitary transformation decoupling the low-energy and high-energy subspaces for the transformed Hamiltonian can be realized by quantum circuits. We give a fully quantum algorithm for realizing the SW transformation. We also propose a hybrid quantum-classical algorithm for finding the effective Hamiltonian on NISQ hardware, where a general cost function is used to indicate the decoupling degree. Numerical simulations without or with noise and experiments on quantum computer ibmq_manila are implemented for a Heisenberg chain model. Our results verify the algorithm and show its validity on near-term quantum computers.

arXiv:2201.13304•Physical Review Research•Oct 12, 2022•6 citations

Hamiltonian quantum simulation with bounded-strength controls

Adam D. Bookatz, Paweł Wocjan, Lorenza Viola

We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians . Each simulation protocol consists of periodic repetitions of a basic control block, constructed as a modification of an 'Eulerian decoupling cycle,' that would otherwise implement a trivial (zero) target Hamiltonian. For an open quantum system coupled to an uncontrollable environment, our approach may be employed to engineer an effective evolution that simulates a target Hamiltonian on the system while suppressing unwanted decoherence to the leading order, thereby allowing for dynamically corrected simulation . We present illustrative applications to both closed- and open-system simulation settings, with emphasis on simulation of non-local (two-body) Hamiltonians using only local (one-body) controls . In particular, we provide simulation schemes applicable to Heisenberg-coupled spin chains exposed to general linear decoherence, and show how to simulate Kitaevʼs honeycomb lattice Hamiltonian starting from Ising-coupled qubits, as potentially relevant to the dynamical generation of a topologically protected quantum memory. Additional implications for quantum information processing are discussed.

arXiv:1310.4153•New Journal of Physics•Apr 25, 2014•14 citations

UEfficient optimization of perturbative gadgets

Yudong Cao, Sabre Kais

Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective many-body interactions using more physically viable two-body ones. In parallel with prior work (arXiv:1311.2555 [quant-ph]), here we consider minimizing the physical resource required for implementing the gadgets initially proposed by Kempe, Kitaev and Regev (arXiv:quant-ph/0406180) and later generalized by Jordan and Farhi (arXiv:0802.1874v4). The main innovation of our result is a set of methods that efficiently compute tight upper bounds to errors in the perturbation theory. We show that in cases where the terms in the target Hamiltonian commute, the bounds produced by our algorithm are sharp for arbitrary order perturbation theory. We provide numerics which show orders of magnitudes improvement over gadget constructions based on trivial upper bounds for the error term in the perturbation series. We also discuss further improvement of our result by adopting the Schrieffer-Wolff formalism of perturbation theory and supplement our observation with numerical results.

Quantum Information and Computation•Aug 1, 2017•4 citations
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.
Schrieffer-Wolff transformation is extensively used in quantum many-body physics to calculate the low energy effective Hamiltonian. It offers a perturbative method to understand the renormalization effects in the strong coupling regime of the quantum many-body models. The generator for Schrieffer-Wolff transformation is calculated using heuristic methods. It is highly desirable to have a rigorous, systematic and simple method for the calculation of generator for this highly important transformation. In this paper, we put forward such a method. We demonstrate our method by applying it to few well-known models from various fields like strongly correlated electron systems, quantum optics and cavity quantum electrodynamics. Our method can be applied to a broad class of quantum many-body Hamiltonians.
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.
Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this Letter, we give quantum algorithms which, given any k-body Hamiltonian H, compute an estimate for the ground state energy and prepare a quantum state achieving said energy, respectively. Specifically, for any ϵ>0, our algorithms return, with high probability, an estimate of the ground state energy of H within additive error ϵM, or a quantum state with the corresponding energy. Here, M is the total strength of all interaction terms, which in general is extensive in the system size. Our approach makes no assumptions about the geometry or spatial locality of interaction terms of the input Hamiltonian and thus handles even long-range or all-to-all interactions, such as in quantum chemistry, where lattice-based techniques break down. In this fully general setting, the run-time of our algorithms scales as 2^{cn/2} for c<1, yielding the first quantum algorithms for low-energy estimation breaking a standard square root Grover speedup for unstructured search. The core of our approach is remarkably simple, and relies on showing that an extensive fraction of the interactions can be neglected with a controlled error. What this ultimately implies is that even arbitrary k-local Hamiltonians have structure in their low energy space, in the form of an exponential-dimensional low energy subspace.
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of an unperturbed Hamiltonian. This unitary transformation decoupling the low-energy and high-energy subspaces for the transformed Hamiltonian can be realized by quantum circuits. We give a fully quantum algorithm for realizing the SW transformation. We also propose a hybrid quantum-classical algorithm for finding the effective Hamiltonian on NISQ hardware, where a general cost function is used to indicate the decoupling degree. Numerical simulations without or with noise and experiments on quantum computer ibmq_manila are implemented for a Heisenberg chain model. Our results verify the algorithm and show its validity on near-term quantum computers.
We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians . Each simulation protocol consists of periodic repetitions of a basic control block, constructed as a modification of an 'Eulerian decoupling cycle,' that would otherwise implement a trivial (zero) target Hamiltonian. For an open quantum system coupled to an uncontrollable environment, our approach may be employed to engineer an effective evolution that simulates a target Hamiltonian on the system while suppressing unwanted decoherence to the leading order, thereby allowing for dynamically corrected simulation . We present illustrative applications to both closed- and open-system simulation settings, with emphasis on simulation of non-local (two-body) Hamiltonians using only local (one-body) controls . In particular, we provide simulation schemes applicable to Heisenberg-coupled spin chains exposed to general linear decoherence, and show how to simulate Kitaevʼs honeycomb lattice Hamiltonian starting from Ising-coupled qubits, as potentially relevant to the dynamical generation of a topologically protected quantum memory. Additional implications for quantum information processing are discussed.
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective many-body interactions using more physically viable two-body ones. In parallel with prior work (arXiv:1311.2555 [quant-ph]), here we consider minimizing the physical resource required for implementing the gadgets initially proposed by Kempe, Kitaev and Regev (arXiv:quant-ph/0406180) and later generalized by Jordan and Farhi (arXiv:0802.1874v4). The main innovation of our result is a set of methods that efficiently compute tight upper bounds to errors in the perturbation theory. We show that in cases where the terms in the target Hamiltonian commute, the bounds produced by our algorithm are sharp for arbitrary order perturbation theory. We provide numerics which show orders of magnitudes improvement over gadget constructions based on trivial upper bounds for the error term in the perturbation series. We also discuss further improvement of our result by adopting the Schrieffer-Wolff formalism of perturbation theory and supplement our observation with numerical results.