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

Non-perturbative k-local to 2-local commuting conversion Hamiltonians and embedding problem instances into Ising spins

Jacob Biamonte

Published Jan 24, 2008• 0 citations
OpenAlex

Abstract

An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k-body interactions to be captured exactly using 2-body Hamiltonians. Our method works when all terms in the Hamiltonian share the same basis and has no dependence on perturbation theory or the associated large spectral gap. Our methods allow problem instance solutions to be embedded into the ground energy state of Ising spin systems. Adiabatic evolution might then be used to place a computational system into it's ground state.

Related papers

Nonperturbative k -body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins

Jacob Biamonte

An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows $\mathit{k}$-body interactions to be captured exactly using two-body Hamiltonians. Our method works when all terms in the Hamiltonian share the same basis and has no dependence on perturbation theory or the associated large spectral gap. Our methods allow problem instance solutions to be embedded into the ground energy state of Ising spin systems. Adiabatic evolution might then be used to place a computational system into its ground state.

arXiv:0801.3800•Physical Review A•May 23, 2008•126 citations

Nonperturbative embedding for highly nonlocal Hamiltonians

Yiğit Subaşı, Christopher Jarzynski

The need for Hamiltonians with many-body interactions arises in various applications of quantum computing. However, interactions beyond two-body are difficult to realize experimentally. Perturbative gadgets were introduced to obtain arbitrary many-body effective interactions using Hamiltonians with at most two-body interactions. Although valid for arbitrary $k$-body interactions, their use is limited to small $k$ because the strength of interaction is $k\mathrm{th}$ order in perturbation theory. In this paper we develop a nonperturbative technique for obtaining effective $k$-body interactions using Hamiltonians consisting of at most $l$-body interactions with $l<k$. The idea is to first apply a unitary transformation on the system plus ancilla qubits (possibly using a gate-based device), then evolve with a new Hamiltonian which is more local than the original one (using an analog device), and finally reverse the unitary transformation. The net effect of this procedure is shown to be equivalent to evolving the system with the original nonlocal Hamiltonian. This technique does not suffer from the aforementioned shortcoming of perturbative methods and requires only one ancilla qubit for each $k$-body interaction irrespective of the value of $k$. It works best for Hamiltonians with a few many-body interactions involving a large number of qubits and can be used together with perturbative gadgets to embed Hamiltonians of considerable complexity in proper subspaces of two-local Hamiltonians. We describe how our technique can be implemented in a hybrid (gate-based and adiabatic) as well as solely adiabatic quantum computing scheme.

arXiv:1601.02922•Physical Review A•Jul 25, 2016•14 citations

Adiabatic quantum computation with spin ensembles

Naeimeh Mohseni, Marek Narożniak, Alexey N. Pyrkov +3 more

In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.

AIP conference proceedings•Jan 1, 2020•0 citations

On the mathematical structure of quantum models of computation based on Hamiltonian minimisation

Jacob Biamonte

Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems have been increasingly considered as computational resources. This thesis develops parts of the mathematical apparatus to create (program) ground states relevant for quantum and classical computation. The core findings presented in this thesis (now over a decade old) including that (i) logic operations (gates) can be embedded into the low-energy sector of Ising spins whereas three (and higher) body Ising interaction terms can be mimicked through the minimisation of 2- and 1-body Ising terms yet require the introduction of slack spins; (ii) Perturbation theory gadgets enable the emulation of interactions not present in a given Hamiltonian, e.g.~$YY$ interactions can be realized from $ZZ$, $XX$, the thesis contains a result from 2007 showing that physically relevant two-body model Hamiltonian's have a QMA-hard ground state energy decision problem. Merged with other results, this established that these models provide a universal resource for ground state quantum computation. More recent findings include the proof that an idealised version of the contemporary variational approach to quantum algorithms enables a universal model of quantum computation. Other related results are also presented as they relate to ground state quantum computation and the minimisation of Hamiltonians by quantum circuits. The topics covered include: Ising model reductions, stochastic versus quantum processes on graphs, quantum gates and circuits as tensor networks, variational quantum algorithms and Hamiltonian gadgets.

arXiv:2009.10088•Sep 21, 2020•1 citation

Time-Dependent Low-Energy Simulation Accelerates Adiabatic State Preparation

Shuo Zhou, Zhaokai Pan, Weiyuan Gong +1 more

Hamiltonian simulations are key subroutines in adiabatic quantum computation and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. Previous studies have shown that the low-energy assumption can reduce the resource requirements of standard time-independent Hamiltonian simulation algorithms. However, whether such advantages extend to time-dependent Hamiltonian simulation remains open. In this paper, we consider the adiabatic regime where the relevant low-energy subspace is spanned by a fixed number of low-energy eigenstates and separated from the rest of the spectrum by a gap. We show that, for simulating spin Hamiltonians by product formulas, the explicit system size dependence in the leading commutator-scaling term can be replaced by a low-energy scale up to logarithmic factors. Technically, we derive the low-energy simulation error with commutator scaling for product formulas by leveraging adiabatic perturbation theory to analyze the time-variant energy spectrum of the underlying Hamiltonian. We further conduct numerical experiments on adiabatic state preparation of an illustrative example system to support our theoretical findings. Finally, we prove a lower bound of query complexity for generic time-dependent Hamiltonian simulations.

quant-pharXiv:2601.01550•Jan 6, 2026•1 citation

Universal Approach to Quantum Adiabaticity via Ancilla Cavity

Lin Tian

A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting many-body systems often decreases quickly with the number of qubits, and the quantum adiabaticity can be severely impaired. Despite numerous previous efforts, a practical method to preserve the quantum adiabaticity has yet to be developed. Here we present a universal approach to enhancing the quantum adiabaticity via cavity or circuit QED. By coupling an adiabatic quantum computer to an ancilla cavity, the coupled system can exhibit a bistable regime with bifurcation points, where the time evolution becomes very slow. Utilizing these generic nonlinear features, we show that the energy gap of the adiabatic quantum computer can be positioned between the bifurcation points, which results in strongly-enhanced quantum adiabaticity. We then apply this method to a quantum two-level system, an Exact Cover problem, and a transverse field Ising model. In contrast to previous works, this approach does not require the spectral knowledge of the quantum system or the construction of unphysical interactions and can be applied to a vast variety of adiabatic quantum processes.

arXiv:1802.02285•Feb 7, 2018•3 citations
An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k-body interactions to be captured exactly using 2-body Hamiltonians. Our method works when all terms in the Hamiltonian share the same basis and has no dependence on perturbation theory or the associated large spectral gap. Our methods allow problem instance solutions to be embedded into the ground energy state of Ising spin systems. Adiabatic evolution might then be used to place a computational system into it's ground state.
An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k\mathit{k}k-body interactions to be captured exactly using two-body Hamiltonians. Our method works when all terms in the Hamiltonian share the same basis and has no dependence on perturbation theory or the associated large spectral gap. Our methods allow problem instance solutions to be embedded into the ground energy state of Ising spin systems. Adiabatic evolution might then be used to place a computational system into its ground state.
The need for Hamiltonians with many-body interactions arises in various applications of quantum computing. However, interactions beyond two-body are difficult to realize experimentally. Perturbative gadgets were introduced to obtain arbitrary many-body effective interactions using Hamiltonians with at most two-body interactions. Although valid for arbitrary kkk-body interactions, their use is limited to small kkk because the strength of interaction is kthk\mathrm{th}kth order in perturbation theory. In this paper we develop a nonperturbative technique for obtaining effective kkk-body interactions using Hamiltonians consisting of at most lll-body interactions with l<kl<kl<k. The idea is to first apply a unitary transformation on the system plus ancilla qubits (possibly using a gate-based device), then evolve with a new Hamiltonian which is more local than the original one (using an analog device), and finally reverse the unitary transformation. The net effect of this procedure is shown to be equivalent to evolving the system with the original nonlocal Hamiltonian. This technique does not suffer from the aforementioned shortcoming of perturbative methods and requires only one ancilla qubit for each kkk-body interaction irrespective of the value of kkk. It works best for Hamiltonians with a few many-body interactions involving a large number of qubits and can be used together with perturbative gadgets to embed Hamiltonians of considerable complexity in proper subspaces of two-local Hamiltonians. We describe how our technique can be implemented in a hybrid (gate-based and adiabatic) as well as solely adiabatic quantum computing scheme.
In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems have been increasingly considered as computational resources. This thesis develops parts of the mathematical apparatus to create (program) ground states relevant for quantum and classical computation. The core findings presented in this thesis (now over a decade old) including that (i) logic operations (gates) can be embedded into the low-energy sector of Ising spins whereas three (and higher) body Ising interaction terms can be mimicked through the minimisation of 2- and 1-body Ising terms yet require the introduction of slack spins; (ii) Perturbation theory gadgets enable the emulation of interactions not present in a given Hamiltonian, e.g.~YYYYYY interactions can be realized from ZZZZZZ, XXXXXX, the thesis contains a result from 2007 showing that physically relevant two-body model Hamiltonian's have a QMA-hard ground state energy decision problem. Merged with other results, this established that these models provide a universal resource for ground state quantum computation. More recent findings include the proof that an idealised version of the contemporary variational approach to quantum algorithms enables a universal model of quantum computation. Other related results are also presented as they relate to ground state quantum computation and the minimisation of Hamiltonians by quantum circuits. The topics covered include: Ising model reductions, stochastic versus quantum processes on graphs, quantum gates and circuits as tensor networks, variational quantum algorithms and Hamiltonian gadgets.
Hamiltonian simulations are key subroutines in adiabatic quantum computation and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. Previous studies have shown that the low-energy assumption can reduce the resource requirements of standard time-independent Hamiltonian simulation algorithms. However, whether such advantages extend to time-dependent Hamiltonian simulation remains open. In this paper, we consider the adiabatic regime where the relevant low-energy subspace is spanned by a fixed number of low-energy eigenstates and separated from the rest of the spectrum by a gap. We show that, for simulating spin Hamiltonians by product formulas, the explicit system size dependence in the leading commutator-scaling term can be replaced by a low-energy scale up to logarithmic factors. Technically, we derive the low-energy simulation error with commutator scaling for product formulas by leveraging adiabatic perturbation theory to analyze the time-variant energy spectrum of the underlying Hamiltonian. We further conduct numerical experiments on adiabatic state preparation of an illustrative example system to support our theoretical findings. Finally, we prove a lower bound of query complexity for generic time-dependent Hamiltonian simulations.
A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting many-body systems often decreases quickly with the number of qubits, and the quantum adiabaticity can be severely impaired. Despite numerous previous efforts, a practical method to preserve the quantum adiabaticity has yet to be developed. Here we present a universal approach to enhancing the quantum adiabaticity via cavity or circuit QED. By coupling an adiabatic quantum computer to an ancilla cavity, the coupled system can exhibit a bistable regime with bifurcation points, where the time evolution becomes very slow. Utilizing these generic nonlinear features, we show that the energy gap of the adiabatic quantum computer can be positioned between the bifurcation points, which results in strongly-enhanced quantum adiabaticity. We then apply this method to a quantum two-level system, an Exact Cover problem, and a transverse field Ising model. In contrast to previous works, this approach does not require the spectral knowledge of the quantum system or the construction of unphysical interactions and can be applied to a vast variety of adiabatic quantum processes.