Perturbation Gadgets: Arbitrary Energy Scales from a Single Strong Interaction

Fundamentally, it is believed that interactions between physical objects are two-body. Perturbative gadgets are one way to break up an effective many-body coupling into pairwise interactions: a Hamiltonian with high interaction strength introduces a low-energy space in which the effective theory appears k-body and approximates a target Hamiltonian to within precision ϵ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon $$\end{document}. One caveat of existing constructions is that the interaction strength generally scales exponentially in the locality of the terms to be approximated. In this work we propose a many-body Hamiltonian construction which introduces only a single separate energy scale of order Θ(1/N2+δ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Theta (1/N^{2+\delta })$$\end{document}, for a small parameter δ>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta >0$$\end{document}, and for N terms in the target Hamiltonian Ht=∑i=1Nhi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf H_\mathrm {t}=\sum _{i=1}^N \mathbf h_i$$\end{document} to be simulated: in its low-energy subspace, our constructed system can approximate any such target Hamiltonian Ht\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf H_t$$\end{document} with norm ratios r=maxi,j∈{1,…,N}‖hi‖/‖hj‖=O(exp(exp(polyN)))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r=\max _{i,j\in \{1,\ldots ,N\}}\Vert \mathbf h_i\Vert / \Vert \mathbf h_j \Vert ={{\,\mathrm{O}\,}}(\exp (\exp ({{\,\mathrm{poly}\,}}N)))$$\end{document} to within relative precision O(N-δ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\,\mathrm{O}\,}}(N^{-\delta })$$\end{document}. This comes at the expense of increasing the locality by at most one, and adding an at most poly-sized ancillary system for each coupling; interactions on the ancillary system are geometrically local, and can be translationally invariant. In order to prove this claim, we borrow a technique from high energy physics—where matter fields obtain effective properties (such as mass) from interactions with an exchange particle—and employ a tiling Hamiltonian to discard all cross-terms at higher expansion orders of a Feynman–Dyson series expansion. As an application, we discuss implications for QMA-hardness of the Local Hamiltonian problem, and argue that “almost” translational invariance—defined as arbitrarily small relative variations of the strength of the local terms—is as good as non-translational invariance in many of the constructions used throughout Hamiltonian complexity theory. We furthermore show that the choice of geared limit of many-body systems, where e.g. width and height of a lattice are taken to infinity in a specific relation, can have different complexity-theoretic implications: even for translationally invariant models, changing the geared limit can vary the hardness of finding the ground state energy with respect to a given promise gap from computationally trivial, to QMAEXP-, or even BQEXPSPACE-complete.


Introduction
In nature, the way particles can interact is inherently limited. Just like in a game of billiards, where under high-enough time resolution every ball-to-ball contact can be discriminated in principle, many-body systems are believed to be governed by two-body interactions. When we relax the time resolutionand, for instance, only check the billiard table every half second-it appears as if multiple balls have interacted simultaneously, and one can derive an effective multi-body theory from these observations. While many-body terms appear in real-world systems, e.g. in rare-gas liquids [30], where describing thermodynamic properties accurately requires the introduction of a three-body term, to model polar molecules [11] or phases of charged particles in suspension [46], their occurrence is rare. For the field of Hamiltonian complexity theory, which tries to link rigorous complexitytheoretic statements like "how hard is it to estimate the ground state energy of a local Hamiltonian?" to realistic systems-e.g. by requiring low local dimension, a realistic set of interactions, and nearest-neighbour couplings only-this is of course a conundrum: hardness constructions usually work by mapping a type of constraint satisfaction problem to the interactions of a many-body system. If the interactions get more restricted, the constraints become easier to solve.
In order to circumnavigate this problem, reductions are typically proven in two steps: at first, one allows the freedom of choosing long-range interactions, which makes the task of embedding a hard problem into a local Hamiltonian significantly easier. As a second step, one uses a technique called perturbation gadgets to break down effective k-local terms to two-body couplings.
This breaking down of an effective high-locality interaction into twobody couplings is reminiscent of a renormalization group (RG) step, applied in inverse direction, as e.g a block spin RG applied to the Ising model [32,45]. In this example, a square grid of spins interacting via nearest-neighbour Ising couplings J 0 σ i σ j at temperature T 0 is "coarse-grained" into 2×2 blocks, which can then be described via a variant of the original dynamics, but with different parameters J 1 and T 1 . A single RG step-i.e. from four 2 i−1 × 2 i−1 blocks to a block of 2 i × 2 i spins-is thus qualitatively similar to a perturbation gadget, where individual spins are grouped together to produce an effective interaction at a different length and energy scale as the original couplings [19]. Yet a crucial difference is that for RG flow one intends the effective interactions to remain of the same kind, with potentially different parameters-where e.g. if the RG is iterated in the Ising example, J i and T i approach (potentially infinite) fixed points for i −→ ∞-a perturbation gadget is used to create more complex types of interactions [22].
Effective theories usually introduce a separate energy scale Δ, which has to increase with the system size in order to suppress the introduced errors. This scaling is usually quite drastic: to break down a k-local interaction to 2-body with an error , Δ commonly has to scale like Ω(1/ k ), where = 1/ poly n in the system size n. Yet having a coupling constant which increases as the system grows is highly unphysical-in particular because the typical polynomial degree of −1 itself is huge, e.g. in the context of QMA-hardness constructions, where scales inverse quadratically in the runtime of the computation, which itself can be an arbitrary polynomial in the system size n.
In a recent study [18], the authors have analysed how the scaling of Δ can be improved by an effective numerical algorithm, which yields tighter bounds than suggested by perturbation theory alone. Yet while the bounds are improved by several orders of magnitude, the asymptotic scaling appears to remain unfavourable (see e.g. [18, fig. 5]).
In this paper, we propose a novel method which allows the introduction of only a single scaling constant with vastly reduced overhead as compared to the typical Δ required in a perturbative expansion. The aim of this work is not to replace gadget constructions, but to augment them: it can be applied to any construction of a Hamiltonian H with various energy scales up to relative strength that scales doubly exponential in the size of the system, i.e. exp(exp(poly n)). However, as in the gadget case we cannot get away with no scaling constant at all. For our construction, a strong interaction with weight O(N 2+δ ) is necessary to simulate H in an effective subspace up to relative accuracy O(N −δ ), where N is the number of local terms present in the target Hamiltonian. We emphasize that this approximation is independent of the original scale Δ one wishes to obtain. This comes at a cost: the effective Hamiltonian is normalized to O(1), and one has to introduce an ancillary system for every interaction present in the original construction that features a scaling operator norm. The ancillary system is a geometrically local and translationally invariant nearest-neighbour spin chain which couples locally to the system at hand. This means that we need to potentially increase the locality of the original construction by one-where we emphasize that this is only necessary if the interaction with scaling norm is already k-local for a k-local Hamiltonian. 1 While it is true that it seems to defeat the purpose of perturbation gadgets to first break down high-locality interactions to two-body, only then to increase them back to three-local, we argue that our construction improves the picture in two aspects.
1. Our scaling is independent of the locality of the original construction, and thus superior to e.g. stopping perturbation theory of a 10-local Hamiltonian once the interactions are 3-local. 2. We introduce a relative overall error only. This is particularly useful for hardness constructions, where e.g. a small promise gap of 1/ poly n has Table 1. Examples for perturbation gadgets using various expansion techniques, with required gap scaling, interaction graph modifications, and coupling scaling Δ in the parameters: approximation error , operator norm of the target Hamiltonian V Technique Locality k order l Δ = Ω(·) Extra terms per interaction [15,41] S-W l ≤ 4 −l V l(l+1) [19] F -D k = 2, 3 O ( ) Ω ( −2 , V 2 )-sized cliques a [33] F 6 1 ancilla c a One per 2-body interaction. The paper contains a direct proposal for three-body interactions; for higher-order terms, the authors also propose taking another gadget to break k-body to 2-body, and then reduce the weight with their method. b The authors show series convergence for Δ > V /k; no analytical error analysis is given.
c For the mediator gadget: to maintained. For us, a relative error of say 1/10 would thus suffice ( Table 1).
The notion of perturbation gadgets is tightly linked to the idea of simulation of quantum systems. The theory is well-developed, and we only summarize the central points here; we focus on the simpler definition in [15], but refer the reader to [22] for an in-depth discussion. Formally, the ability to simulate (the static properties of) one quantum system with another means that one can reproduce either the eigenvalues, the eigenvectors-or both-of some target Hamiltonian H t within some invariant subspace L ⊂ H sim (e.g. the low-energy subspace) of a simulator Hamiltonian H sim .
Since the Hilbert spaces on which H t and H sim are defined-denoted H t and H sim -are usually not identical, we need to allow for an encoding map E : H t → H sim ; then H sim together with E simulate H t with error tuple ( , η) if there exists an isometryẼ : H t → H sim such the image ofẼ is L, and further H t −Ẽ † H simẼ ≤ and E −Ẽ ≤ η. Roughly speaking, the first two conditions imply that the eigenvalues of H t are reproduced up to error ; the latter implies closeness of the eigenvectors up to error η (see [15, def. 1, lem. 1&2]). The reason for this distinction is that while the exact mappingẼ might be very complicated and does not tell us anything about the eigenvectors, we can approximate it via an encoding; since the two maps are close in operator norm, we can also reach closeness of the eigenvectors with the effective simulated Hamiltonian.
Since our goal is to reproduce the entire target Hamiltonian within a low-energy space of a simulator Hamiltonian, and since we will employ a wellestablished series expansion, we will generally disregard the explicit distinction between and η; the self-expansion theorems in Sect. 2.2 capture the two notions of approximation that suffice for our purposes.

Preliminaries
A Hamiltonian is a Hermitian operator H on a finite-dimensional Hilbert space H. We say H is n-body if H = (C d ) ⊗n for some n, d ∈ N. The Hamiltonian H is k-local if H = n i=1 h i , and such that h i are Hermitian matrices that each act non-trivially only on k of the subsystems of H. More precisely, we demand that . . , n} of size |S i | ≤ k, and 1 S c i the identity operation on the complement of S i . We also call the h i local coupling or interaction terms, and if h i is part of a k-local Hamiltonian H, then h i is-in itself-an at most k-body interaction. Indeed, as mentioned in the abstract, fundamentally physical systems are believed to be interacting via two-body interactions, which means that the Hamiltonian describing such systems is two-local.
If there is a topological structure associated with the Hilbert space He.g. if each of the d-dimensional spaces is associated with the vertices of a graph-then we speak of H being geometrically local if the local interaction terms h i act in a local fashion with respect to this topology, which usually means that the k vertices that h i acts on have to be connected. For instance, if the h i are interaction terms between neighbouring d-dimensional spins on a grid of side length L × L (each spin with Hilbert space C d , which we also call a d-dimensional qudit), then H is a 2-local, L 2 -body, nearest-neighbour Hamiltonian on a square lattice.
If the topology permits and is e.g. like a hyperlattice, we can speak of translational invariance, which means that for all the local terms q i,Si = q Si , and H = n i=1 is such that the interactions on the underlying graph are invariant under translations-modulo boundary effects; for translationally invariant systems we generally assume open boundary conditions.
The interaction degree of a Hamiltonian is then the maximum number of local terms h i acting non-trivially on any site; it coincides with the degree of the graph describing the interaction topology of H. A Hamiltonian with fixed interaction degree then has an interaction degree ≤ D for some D ∈ N, which we keep implicit. Similarly, we will often leave the locality unspecified when speaking of local Hamiltonians, which simply implies that that the Hamiltonian is k-local for some constant k.

Feynman-Dyson Series
Because a lot of our construction hinges on employing a well-known series expansion-the Feynman-Dyson series-and to introduce the notation used throughout the rest of the paper, we will spend some time explaining how to approximate low-energy spectra of a sum of a Hamiltonian H and a perturbation V. We follow the excellent and more thorough introductions within [33,41].
Assume we are given a HamiltonianH := H + V, where H has a spectral gap Δ above its ground space L(H). We further assume that V < Δ/2.

Notation.
Denote the eigenvalues and eigenvectors of H (H) with λ i and |ψ i (λ i and |ψ i ), such that λ min (H) =: λ 0 is the ground state of H. Let λ * := Ann. Henri Poincaré λ min (H) + Δ/2 midway within the spectral gap of H, and let Π − be the projector onto L(H)-and Π + onto its orthogonal complement, respectively. We define the resolvent of H via and analogouslyG(z) forH; we note that both resolvents have first-order poles at z = λ i or z =λ i , respectively. The self-energy of H is then given by where the subscripts on an operator A are defined via the restriction to the support of the projections Π ± , e.g. A − := A| L(H) (such that 1 − denotes the identity on L(A)), and analogously A + is the restriction to the complement of L(H). We will also use the mixed subscripts, best defined in a representation of the Hilbert space L(H) ⊕ L(H) ⊥ , where the operator A block-decomposes as This also means that the order of operations in Eq. (2)-restriction to the low-energy subspace and operator inversion-is irrelevant for all z ∈ {λ i }, i.e. whereG(z) is invertible; for simplicity of notation we thus drop the brackets where appropriate, and identify, e.g.
If we solve Eq.
=H − , we see that the self-energy Σ − (z) is nothing but the low-energy part of the Hamilton-ianH-where it is important to note that "low energy" in this context means with respect to the spectrum of the unperturbed Hamiltonian H, notH. This is not useful per se, though; we do not know how to calculate the effective low-energy Hamiltonian ofH. On the other hand, we can use a series expansion to approximate it, starting from Σ − (z). Since The lower-right block ofG(z) is then given by the Schur complement Dropping the argument z in G + = G + (z) for brevity, we further have as a geometric series expansion, which converges if G + V + < 1. Under this assumption, we can conclude

Self-Energy Expansion Theorems
There is two major variants of approximations that can result from this selfexpansion using the Feynman-Dyson series. Representative of the literature, we quote the following two variants.
Note that in general we will have a dependence = (Δ); however, if we only request that the error be small, but not shrinking with the system size, we can keep the ratio of the terms H and V fixed. The following variant allows one to make a statement not only about the eigenenergies, but also about the eigenvectors.
Theorem 2 (Oliveira et al. [39]). Let the setup be as in Theorem 1, and denote with λ ∓ the ground-and first excited energy of H, respectively. Let z 0 = (b + a)/2, w eff = (b − a)/2, and r be the radius of a disc D centred around z 0 encompassing the point b + . If for all z ∈ D we have Σ − (z) − H eff ≤ , then In particular, while Theorem 1 allows us to make a statement about the eigenenergies without requiring Δ/ V → ∞-which manifests in a constant approximation error for the eigenvectors of H eff -with said condition and Theorem 2 we can also approximate the full spectrum of H eff to arbitrary precision.

A Bound State Hamiltonian
We will need a variant of a random walk Hamiltonian, used ubiquitously in QMA-hardness constructions in the context of Feynman's History State construction. In particular, what we aim to achieve is to create a Hamiltonian on a multipartite Hilbert space, with a constant spectral gap above a unique ground state, and such that the latter has most of its weight localized around a particular site. Like this, we can "condition" an interaction on the ground state away from its localization site. The intuition is taken from particle physics: interactions are commonly coupled to an exchange gauge particle; this coupling is weak when conditioned on a field away from where the gauge particle mostly lives-e.g. a photon, whose field drops off away from an electron, influences how strong an electron-electron scattering is depending on how far apart the two electrons are.
Let us make this precise. Let b > 0. For an integer T ≥ 2, let H b be a Hamiltonian on C T defined via where the |t label a fixed orthonormal basis. The second term in Eq. (4) is a path graph Laplacian, whereas the first term assigns a bonus term of strength b to the state |1 . Proof Uniqueness of a single negative eigenvalue is a standard argument: assume this is not the case. Then, there exist at least two orthogonal eigenvectors |u , |v with negative eigenvalues, and any |x ∈ span{|u , |v } satisfies x|H b |x < 0. Since dim ker |1 1| = T − 1, there exists a nonzero |x ∈ span{|u , |v } such that |1 1||x = 0. Therefore, 0 > x|H b |x = x|(H b +b|1 1|)|x , contradiction, since H b +b|1 1| is a path graph Laplacian, which is positive semi-definite. We make an ansatz for the ground state. Let (5) for which we note A ∈ (0, b + 1) ∀b > 0, T ≥ 2. Then, Thus, where in the first line we used the fact that the |Ψ i are an orthonormal set of vectors, and in the second line we used the expression of H b |Ψ from Eq. (6). Since b ≥ 1, we can choose s = 1/4. We further have A ≤ b + 1. For i > 0, we know that λ i ≥ 0, and we conclude for large T , and the claim follows.
This allows us to approximate to very high precision the amplitudes of the ground and higher excited states; of particular interest will be the amplitudes for the basis states |T for T < T ; the reason for this is that the approximation error in Lemma 4 (i.e. the precision to which we know the ground state at all) is of the same order of magnitude as the smallest amplitude in the ground state, | Ψ 0 |T |. However, since we want to be able to accurately fine-tune a specific amplitude of |Ψ 0 , we need the corresponding error of that entry to be much smaller. In order to formalize this notion, we will assume the path graph underlying the graph Laplacian in the definition of H b in Eq. (4) has a multiple of the original length T ; we call this multiple M ∈ N, M > 1 throughout the paper, and the target amplitude we wish to estimate and tune remains Ψ 0 |T . This is captured in the following corollary.
Proof By Lemma 4, First note that by Eq. (5), Ψ|T = A/(b + 1) T , where A is the normalization constant defined on a path of length MT (not T), such that for 0 < x < a and the small x limit, we therefore have A similar argument bounds 2 ; the claim follows.
Note that e.g. choosing M = 4 suffices such that | Ψ 0 |T | 2 in Corollary 5 it is clear that a tighter error bound can be achieved by increasing M further. Furthermore, the overlap with a site T < T is larger; it is therefore possible to expand Corollary 5 to obtain the following claim.

. On a chain of length MT and for any T ≤ T , the ground state overlap
In the same fashion as in Corollary 6, we can now immediately deduce the overlap of a state |T with the rest of the spectrum of H b .

Corollary 7
Let M ∈ N, M > 1, and b ≥ 1. We consider a chain of length MT , and let the eigenstates |Ψ i of H b be as in Lemma 4. Then for all T ≤ T and in the limit T −→ ∞, we have As we have seen, there is an exponential falloff of the ground state of H b away from its bonus term, and the magnitude of overlap | Ψ 0 |T | is tightly controlled by Corollary 5 to 7. Since T is discrete and we want b to be taken from a fixed interval, an obvious question that arises is which values r := | Ψ 0 |T | 2 ∈ R we can construct, by choosing T , T , M and b appropriately. This is a straightforward calculation; yet since we will be interested of the scaling of the parameters T , M and b with respect to r we state the result here explicitly.

Lemma 8 Let r ∈ (0, 1/100). Then there exist an M ∈ N, M > 3, an integer T ∈ [ln(3/r)/ ln 4, ln(15/r)/ ln 16] and a real number
Proof By Corollary 5, a short calculation yields What remains to be shown is that we can choose M large enough such that for any r ∈ (0, 1/100), there exists a b ∈ [1,3] such that the above equation is satisfied, even under the restriction that T can only assume an integer value.
To prove this, we note that both enumerator and denominator in the expression for T increase monotonically with b; their extreme points are thus reached at the endpoints of the interval b ∈ [1,3]. For the enumerator they are ln(3/r) and ln(15/r), for the denominator 2 ln 2 and 2 ln 4. We note that the achievable difference T | b=1 − T | b=3 = ln(3/5r)/ ln 16 > 5/4 ∀r ∈ (0, 1/100). The claim of the lemma then follows from the intermediate value theorem and choosing M large enough such that < 1/10. We emphasize that in Lemma 8 we can pick b, M and T such that | Ψ 0 |T | 2 = r exactly, without any remaining error term. By Corollary 6, we can alternatively demand that T be fixed, and choose to tune the overlap | Ψ 0 |T | 2 for some T < T. Interestingly, if we have multiple copies of the spin Hamiltonian H bi , we can achieve the same feat, even under the condition that M and T is identical for all of them. More precisely, for a range of target overlaps r i ∈ (0, 1/100), we wish to find states T i ≤ T and biases b i ∈ [1,3], such that r i = | Ψ 0,i |T i | 2 (where |Ψ 0,i denotes the ground state of H bi ).
Proof Follows analogous to Lemma 8, but using Corollary 6 instead of Corollary 5.
For now, this H b as defined in Eq. (4) acts on a single qudit of dimension T , but by the following remark we can ensure the interactions are all defined on a constant local dimension. 2. There exists a 2-body interaction term p, such that the overall Hamiltonian Proof While the proof of this remark is non-trivial-it forms the foundation of Kitaev's seminal proof of QMA-hardness of approximating ground states of local Hamiltonians, see [34] where a 5-local variant is proven-it has been refined and repeated many times throughout literature ( [2,6,8,9,17,27,33,[37][38][39], amongst others), so we will omit it. The specific scaling of T with respect to the local dimension d and chain length s can be found for d =  In particular, Remark 10 shows that we can construct translationally invariant version of the bound state Hamiltonian H b from Sect. 2.3, which has local nearest-neighbour coupling terms, the same single negative-energy ground state |Ψ 0 with weights constrained as e.g. in Lemma 8, and a spectral gap of ≥ 1/2.

Main Result
To make rigorous what we mean by one Hamiltonian to approximate another in its low-energy subspace, we phrase the following definition.

Definition 11
Let H 0 be a local Hamiltonian on a Hilbert space H = (C 2 ) ⊗n such that each local term has operator norm bounded by r(n). We say that H on H ⊗ H 2 approximates H 0 -to error -in its low-energy subspace if the following conditions hold.
1. H has a band gap, i.e. its spectrum a). Then there exists a state |ψ 0 ∈ H 2 such that where Landau O( ) term is measured with respect to the operator norm. We give a constructive proof of Theorem 12; we note that while a variant of Theorem 12 may in principle also hold for an r(n) that grows faster than doubly exponentially in n, our proof does not easily extend to that case. The next few sections will be spent introducing the machinery necessary for the proof. As a first step we will prove a slightly weaker variant, where we increase the locality of the interactions by 2 instead of 1. This will save us some tedious algebra in due course, but we will lift the extra constraints and obtain Theorem 12 in Sect. 3.5.
To further simplify notation, we will generally speak of a Hamiltonian H 0 instead of a family of Hamiltonians {H 0 (n)} n∈N -which is the only type of family of Hamiltonians we will be considering here, as per Theorem 12; therefore the indexing variable n-i.e. the system size-will always be clear from the context.
Let for now H 2 = H clock ⊗H tile , where each Hilbert space will be used for one specific step in the construction. Without loss of generality, we will also assume that the system does not decompose into mutually non-interacting subsets; if this is the case, we can always regard each system separately. We first list the two ingredients for our construction.

Local Bound State Hamiltonians with Controlled Falloff
where b i ∈ [1,3] We remark that |T i T i | i can be made into an at most 2-local projector on a spin chain in a similar fashion as H b ; how exactly this is done will depend on the construction used to turn H b into a local interaction operator, and we refer the reader to remark 10 and the references mentioned in the proof for more details on how this can be achieved.
The reason for choosing H (i) clock to run to t = MT i − 1, and then couple h i to the T i th basis state is that, as per Lemma 8, we can very precisely control the weight T |Ψ 0 of the ground state |Ψ 0 of H b if it is defined over a path graph Laplacian of length MT for M > 3. In turn, this control will allow us to tune the effective coupling strength for the h i by choosing b i and T i appropriately.

Unique Coupling Tiling
We will use H tile to introduce an extra coupling term to the h i that will force products of two distinct terms-i.e. h i h j for i = j-to vanish. In principle this is straightforward; if H tile was, say, C N , we could introduce an orthogonal projector for each interaction via h i ⊗ |i i|. Then clearly (h i ⊗ |i i|)(h j ⊗ |j j|) = 0 ∀i = j. The issue with this solution is that we introduced a single N -dimensional spin with a high interaction degree, which we want to avoid.
To circumvent this problem, we introduce an extra qutrit per interaction, i.e. as before H It is easy to check that all eigenvectors of H tile are product states of the basis {|0 , |1 , |2 } (i.e. ternary strings), with an N -fold degenerate ground space L 0 (H tile ) = span{|0122 · · · 2222 , |0012 · · · 2222 , . . . , |0000 · · · 0012 }. (10) Observe that the states are such that there is precisely one, respectively, where a |1 is at position i for all 1 ≤ i ≤ N , and that the ground space energy is precisely −1, with a spectral gap of 1.
We couple the h i to H tile with interaction terms of the form so that the overall Hamiltonian then reads where we introduced a constant C to be able to satisfy the preconditions for the Feynman-Dyson expansion: since H clock has a constant gap-see Lemma 3we will have to pick C = Ω(N ); we will parametrize this dependence as C = Θ(N 2+δ ), where δ ≥ 0 is a parameter to be chosen in due course.

Restriction to Good Signatures
The first term 1 ⊗ 1 ⊗ H tile in Eq. (12) commutes with all others, which means that H is block-diagonal with respect to the eigenstates of H tile . This implies that we can restrict our attention to the blocks representing the ground space of H tile -all other blocks will have energy ≥ 1. We write ·| tile for a restriction to the ground space L 0 (H tile ) as defined in Eq. (10). More specifically, we set A| tile : (13) Observe that now products of distinct terms within the sum-those containing products h i h j for i = j-are projected out; and further all terms from H tile vanished since we are within its ground space.

Series Expansion
As in [33], we utilize a perturbative series expansion to estimate what the lowenergy subspace of H looks like; for an introduction and the notation we use in the following, see Sect. 2.1.
By Sect. 3.3, and since H is block-diagonal with respect to H tile 's eigenstates, we can simplify the notation in the following analysis by only working within the subspace under the restriction ·| tile ; all other eigenstates have energy ≥ 1. This means that we can write and partition Eq. (13) as where we dropped the H tile part of the Hilbert space; it can uniquely be reconstructed from Eq. (13). We will denote the eigenstates of The ground space projector of H clock and its complement are then given by where P 0,i is given by |Ψ 0 Ψ 0 | from Lemma 4, for a H (i) clock = H b on a chain of length T i ; we further implicitly assume an energy shift to set the ground space energy of H clock to zero by introducing an energy shift for each individual clock Hamiltonian.
To keep the notation consistent, we will denote the eigenvectors of said H (i) clock for a certain chain length T i with |Ψ j,i , and the eigenvalues by μ j,i , for j = 0, . . . , T i − 1. Then P 0,i = |Ψ 0,i Ψ 0,i | and P ⊥ 0,i = j>0 |Ψ j,i Ψ j,i |. We note that the H (i) clock -and hence of H clock -are real symmetric matrices; we can therefore choose all its eigenvectors with real entries, which we will assume henceforth.
The complement projector P + = j>0 |ψ j ψ j | is a bit more complicated to express in closed form; summing over all binary strings of length N apart from the all zero string, We can re-express Eq. (16) in terms of the eigensystems of the individual H (i) clock 's, as where T i is the number of eigenstates of H (i) clock , and the sums either just sum over a single term The products of these projectors with some |T j T j | j , j ∈ {1, . . . , N}, are as follows: We emphasize that in the last two lines, we sum over all binary strings s, which is where the factor of 1/2 stems from. Again for consistency of notation, we set p i,j := T j |Ψ i,j . Note that the p i,j are always real, since we chose our eigenbasis real.
We are interested in the low-energy space ofH, for which we can calculate the expansion terms of Σ − (z) from Eq. (2) using Eqs. (3) and (17) to (19). We have We note that the term G + is nothing but a weighted variant of the projector Π + . This is consistent with what we discussed in Sect. 2.1: solving the selfenergy Σ − (z) =H − yields the low-energy part ofH, a weighted variant of the projector Π − . Equations (20) to (24) allow us to calculate the series terms of Σ − (z); since we are still working within the ground space of H tile as per Sect. 3.3 and Eq. (13), all cross-terms h i h j for which i = j are exactly zero. Then Similarly and therefore inductively The self-energy given in Eq.
(2) then reads To finalize our proof, we will need to analyse the z-dependence of η i ; this is straightforward: since we shifted each individual clock Hamiltonian such that μ 0,i = 0 and with the scaling constant C = Ω(N 2+δ ) in Eq. (13), we have μ k,i > Cb 2 i /(b i + 1) ≥ C/2 ∀i > 0 by Lemma 3. For C ≥ 4 and for all |z| ≤ 1 we have |z − μ l,i | ≥ C/4 ∀i, ∀l > 0-where the condition C ≥ 4 simply translates into a condition on the system size N , which in turn depends on the proportionality constant in the Landau C = Ω(N 2+δ ) that was free to choose in Eq. (12); fixing it to C = 4N 2+δ , for instance, yields the result for all N ≥ 1. By Corollary 7 we then get Note that we arbitrarily chose the region of z to have radius 1; this has to do with our choice of b i ∈ [1,3], which itself is arbitrary; tuning the norm of some H eff will then have to be done by making T i larger, see Lemma 8.

Proof of Main Result Theorem 12
In order to proof Theorem 12, we start with a k-local Hamil- where each h i = 1 and |r i (n)| ≤ r(n) ∀i. We assume without loss of generality that the h i square to identity, 3 i.e. we demand h 2 i = 1 for all i ∈ {1, . . . , N}. We set r i (n) := r i (n)/(200r(n)), each of which now satisfies r i ∈ (0, 1/100). With 3 A canonical basis for the Hermitian d × d matrices is given by the d linearly independent matrices {e i } i∈{1,...,d} such that e i has a single 1 on the diagonal at the ith location, as well as the d(d − 1)/2 matrices {e i,j } 1≤i<j≤d and {e i,j } 1≤i<j≤d , where e i,j has a matching pair of 1s at location (i, j) and (j, i), and similarly e i,j a (i, −i)-pair on corresponding off-diagonal locations (i, j) and (j, i), respectively. We can define a new set of operators as follows: ∈ (0, 1/100).
Set H eff := V − . By Eq. (21), we then have with Π − defined in Eq. (14). Furthermore, Eqs. (26) and (27) tell us that where in the first line ( * ) we used the fact that the term of order l = 1 in the second sum just introduces a constant energy shift-as by assumption h 2 i = 1 ∀i. The Landau O terms are with respect to the limit N −→ ∞.
Let us now remove the tiling Hamiltonian from Sect. 3.3 and reduce the extra locality introduced in Eq. (12) by 1; we call this HamiltonianH. More explicitly, we now lift the implicit assumption of working in the ground space of H tile , within which all cross-terms h i h j vanish for i = j. This means that at order l in the above sum defining , we will get at most N l additional crossterms to take care of, all of which of unit norm within the sum in Eq. (26). A short calculation yields the final error bound = O(N −2−δ ) forH.
Invoking Theorem 2, we get where we used H eff = O(N/r(n)), V = O(N ), and λ + as the spectral gap of H clock -which scales as C.

What is left to show now is that the local dimension of the ancillary system necessary to specify H clock is as claimed for the two cases of scaling of
It is easy to verify that these operators are all Hermitian, form a basis of the d × d Hermitian matrices, and all square to 1 d . Ann. Henri Poincaré r(n)-i.e. q = 3 if r = O(exp(poly n)), and q = 9 for r = O(exp(exp(poly n))). This follows by Remark 10, which concludes the proof.

The Local Hamiltonian Problem
Hamiltonian complexity theory has spawned a whole host of the literature and research, from hardness proofs [2,8,9,12,13,26,28,33,39,42], efficient algorithms [3,4,23,35], modified proposals on encoding computation into the ground state of a local Hamiltonian [6,16,17,44], to suggestions on how to perform quantum computation with a Hamiltonian [37,38,49], or simulation and universality [20][21][22]41], just to name a few. In order to satisfy the task for physically realistic models-typically translational invariance and low local dimension-it is often necessary in these constructions to break down manybody terms into two-body terms. The traditional method is to use perturbation gadgets, which, as discussed extensively, introduces energy scales that scale both in the required absolute error, as well as in the interaction range.
Can we apply our methods to improve upon one of the existing results? In the following subsections we will pick a representative problem of each class and discuss the respective implications.
The Local Hamiltonian problem is the complexity-theoretic formalization of the question of approximating the ground state energy of a local Hamiltonian [34], which is a natural question that arises in physics. It is the quantum analogue of classical Boolean satisfiability problems such as 3-sat: while the latter asks for an assignment to Boolean variables that render a logic statement true, Local Hamiltonian asks how well a quantum state can satisfy local constraints (given by the local interaction terms of some local Hamiltonian H = N i=1 h i ). Kitaev proved that this problem is complete for the complexity class QMA, by a construction first introduced by Feynman [25]. Completeness for QMA implies that on a quantum computer one can verify a solution efficiently within poly-time and with success probability ≥ 2/3. Just like NP, QMA makes no claims about obtaining said solution in first place.
To be precise about all the parameters involved, we give the formal definition of Local Hamiltonian, as well as the complexity classes QMA, QMA EXP , and BQEXPSPACE, for which we will prove hardness results of variants of the Local Hamiltonian problem in the following; for a brief but detailed reference of complexity-theoretic terminology, as well as the notion of Turing machines and quantum circuits, we refer the reader to [48], in which the following definitions can also be found. Note that while definition 13 does not allow local terms to have exponentially large norm, it does allow exponentially small norms; yet not more as the bit complexity of the matrix entries-which comprise the input to the Local Hamiltonian problem-has to be bounded by a polynomial.

Definition 14 (Promise Problem).
Let Σ be a finite set, called alphabet. A promise problem is a set A ⊆ Σ * -where the * denotes the Kleene star, i.e. strings of symbols of Σ of length ≥ 0-such that A = A YES∪ A NO , called YES and NO instances, respectively.
Definition 15 (BQP and BQEXP). If there exists a polynomial-time terminating Turing machine which for all n ∈ N, on input 1 n , writes out the description of a quantum circuit Q n , we call the family Q = {Q n } n∈N polynomial-time generated, or polynomial-time uniform. A promise problem A is in BQP(a, b) for functions a, b : N −→ [0, 1] if there exists a polynomial-time uniform quantum circuit family Q, such that Q n acts on an n qubit input |x , x ∈ A with |x| = n and has a single measured output qubit measured either in state |0 or |1 , where the latter signifies "accept", which we write Q n (|x ) = 1. The circuit family satisfies . By convention BQP = BQP(2/3, 1/3). BQEXP is defined analogously, replacing polynomial time with exponential time (strictly speaking O(exp(n c ))-time, for any constant c ≥ 0) throughout. p (a, b) if for the same setup as in Definition 15, Q n acts on an input of size n + p(n) for some p(n) = poly n and a single output qubit, such that 1. ∀x ∈ A YES ∃|ψ ∈ (C 2 ) ⊗p(n) : Pr(Q n (|x , |ψ ) = 1) ≥ a(n), and 2. ∀x ∈ A NO ∀|ψ ∈ (C 2 ) ⊗p(n) : Pr(Q n (|x , |ψ ) = 1) ≤ b(n). We set QMA = p(n)=poly n QMA p (2/3, 1/3). The circuit family Q n is also called verifier (which itself is a BQP circuit with an extra unconstrained input), and the quantum state |ψ a witness for the instance; as in Definition 15, we define QMA EXP in a similar fashion, replacing the BQP verifier with a BQEXP one.

Definition 16 (QMA and QMA EXP ). A promise problem A is in QMA
We note that one can amplify the acceptance and rejection probabilities of 2/3 and 1/3 in Definitions 15 and 16 such that BQP = BQP(1 − 2 −q , 2 −q ), for any q(n) = poly n in the input size n [48,Prop. 3]. StoqMA is defined as QMA, but for a classical probabilistic Boolean circuit instead of a quantum circuit (i.e. a BPP verifier), and if we remove randomness completely, we end up with the complexity classes P and NP, of which BQP and QMA are the natural quantum analogues.
Instead of bounding the computational runtime, one can in a similar fashion bound the required space; yet instead of uniform families of quantum circuits a hybrid model of a classical Turing machine which can perform quantum operations on a separate tape of qubits is a more natural notion; the space requirements for such a quantum Turing machine are defined by how much classical and quantum tape the machine ingests during a computation; we again refer the reader to [48,Sec. VII.2] for an extended introduction.

Definition 17 (BQPSPACE and BQEXPSPACE). A promise problem
A is in BQPSPACE if there exists a quantum Turing machine with poly-bounded space requirement, accepting YES instances with probability ≥ 2/3, and NO instances with probability ≤ 1/3. BQEXPSPACE is defined analogously.
What might come as a surprise is that, in contrast to the amplification statement for BQP-which limits how close to 1/2 acceptance and rejection probabilities may lie-BQPSPACE =PQPSPACE, defined with > 1/2 and ≤ 1/2 acceptance and rejection probabilities. Even more surprisingly, BQPSPACE =PSPACE [47]-i.e. classical computers (without access to randomness) are as powerful as quantum computers, given the only restriction is placed on how much space each machine is allowed to demand.
The Local Hamiltonian problem as defined in definition 13 is known to be QMA-complete [34]; and as mentioned, variants of this result have been proven which impose ever more restrictions onto the types of Hamiltonians for which the same result holds. For instance, for a promise gap (i.e. the difference β − α in definition 13) which closes as ∝ 1/ exp n, the Local Hamiltonian problem is known to be PSPACE-complete [24]; this is shown by encoding a variant of a QMA-hard problem with an acceptance and rejection probability > 1/2 and ≤ 1/2, respectively, matching the probabilistic bounds in the definition of BQPSPACE. Another variant is for the case of translationally invariant local Hamiltonians for which the Local Hamiltonian problem is QMA EXPcomplete [27]: this is due to the fact that the specification of an instance has bit complexity |n| in the system's size n ∈ N-since this is the only free variable in a translationally invariant system that changes from instance to instance. To still obtain a polynomially closing promise gap, we need to allow the verifier circuit to run for an exponential time (cf. [8,Sect. 3.4]).
Returning from this digression, we now wish to analyse whether we can improve upon any of these best-known results in some aspect. To this end, we will focus on a concrete example, namely Piddock et al.'s proof that the Local Hamiltonian problem is QMA-complete, even with antiferromagnetic interactions on a triangular lattice [41].
is QMA-complete. Our goal is to employ Theorem 12 to remove the explicit variation in coupling strength in Theorem 18 given by the r e = poly n at every lattice edge for a triangular lattice on n vertices, and prove a variant of the result with a scaling limited to ∝ n 2+δ , for an arbitrarily small δ > 0.

Theorem 19
Let Λ = (V, E) be a triangular lattice as shown in with |V | = n vertices, as shown in Fig. 1, and let δ > 0. Then for n ∈ N, stacks of the lattice are given by Λ = Λ Λ 2 , where Λ 2 is a path graph of length n , and denoting the Cartesian graph product. The Local Hamiltonian problem is QMA-complete with interactions on a graph Λ , even when restricted to the following type of interactions: where h is given in Eq. (29) but such that h = 1; h only acts within a lattice layer Λ, and |0 0| is a one-local projector onto state |0 of an adjacent qubit in the next higher layer; 2. q are diagonal geometrically 3-local terms from Eq. By Theorem 12, we thus know that there exists a 3-local Hamiltonian H on H ⊗ H 2 with the following properties: H approximates H 0 within its low-energy subspace, according to definition 11, to relative precision O(N −δ ); this means where Π − are projectors onto the lower part of the spectrum of H , for some state |Ψ 0 defined on an ancillary space H 2 , and = N −δ .
To determine δ, we note that by definition 13 there is a promise gap p(n) := β(n) − α(n) = 1/ poly n associated with H 0 . In order to retain QMA-hardness of H , we need to choose δ = δ(n) such that r(n)/N δ < p(n); we will therefore increase N (i.e. the number of triangular lattice stacks) by an at most polynomial factor-uncoupled to the rest of the system-to ensure q = O(nN ).
What is left to show is that the H where {|0 , |1 } are a basis for C 2 ; the identification implies that the terms |t t + 1| in H b are three-local at most, as is easily verified; similarly, the bonus term |1 1| can be identified with a 1-local term |0 0| acting on the second qubit on H 2 .
Since every H (i) clock has an individual T i -tuned to yield an amplitude | Ψ 0,i |T i | 2 ∝ r i -we need to offset the 3-local terms in H (i) clock such that |T i T i | aligns with the triangular layer Λ on which H 0 is defined. As we are free to choose said layer-as H does not have to be translationally invariant in this construction-the claim of the theorem follows.
We remark that instead of varying the offset of H We have R(1, 1) = 1, and R(b, 1) scales exponentially in T , so the claim follows as in Lemma 8, where we note that the overall effective Hamiltonian will be rescaled by only a polynomial factor, keeping the conditions on the promise gap in definition 13 satisfied. As a short digression for the familiar reader, we emphasize that this result is weaker than it seems: QMA-hardness constructions, which are based on embedding a QMA-verifier computation into the ground state of a local Hamiltonian, are commonly given with a promise gap that scales as ∝ 1/τ 2 in the runtime τ of this embedded computation (see [6]; we further point out the connection to our bound state Hamiltonian in Sect. 2.3). For QMA, the runtime is thus τ = poly n for a system size n. In order to lift the promise gap arbitrarily close to constant in the system size, it always suffices to add a polynomially-sized non-interacting ancillary space of size n = poly n; if we express τ in n , we can thus get a runtime scaling τ = n 1/a , for some arbitrarily large a > 0, and the promise gap thus similarly follows Ω(n −2/a ).
In essence, this is an artefact of Karp-reductions allowing a polynomial overhead-which work either way, i.e. one can shrink the input to a problem by a polynomial, reducing the runtime of a QMA-hard construction in whatever parameter one chose to express the input size with, while maintaining the complexity-theoretic implications. However, while the promise gap can be made to close like the Ω(n −2/a ) for arbitrarily large but constant a, constant relative promise gap (relative in the system size) would imply a quantum analogue of the classical PCP theorem. 4 Yet instead of the necessity feature multiple, potentially wildly varying coupling strengths, Theorem 19 shows that it suffices to have a single additional energy scale ∝ n 1/a , instead of multiple ones; all other interactions are O(1), independent of the system size.
Theorem 19 and Eq. (31) are interesting for another reason. The reader might have noticed by now that our construction allows us to amplify a constant-range b ∈ [1,3] to an energy scale that varies like b f (n) , for f being a polynomial or exponential in the system size n. So what if we turn this problem around, and drastically limit the range for the biases b, say, to an interval b ∈ (1, 1 + χ), for χ very small? We will address this question in the next section. Table 2. Overview over asymptotic scaling of the achievable effective coupling ratio R(b, 1) for b = 1 + χ defined in Eq. (31), as proven in Lemma 20. The first two rows show the asymptotic behaviour of T and χ in the system size n-either power-law or exponential for a, b ≥ 1; the last row shows the resulting asymptotic scaling of R(1 + χ, 1). All Landau symbols are taken with respect to the limit n −→ ∞ n a a n

Noise Amplification and Translational Invariance
As outlined at the end of the previous section, we want to restrict the biases present in H  R(b, 1) the relative achievable scaling ratio for some bias b ≥ 1 as defined in Eq. (31). Then the asymptotic ratio with respect to n −→ ∞ is given by Proof We first note If both T and χ are power-laws, i.e. T = Θ(n a ), χ = Θ(n −b ) for a > b > 1, then an explicit calculation shows R(1 + χ, 1) = O(2 −n a−b ) = O(2 −T χ ). The other cases follow in a similar fashion.
An overview over the asymptotic scalings in Lemma 20 can be found in Table 2. One immediate corollary is the following. We emphasize that while the Local Hamiltonian problem with an exponentially small promise gap is already PSPACE-complete [24], the small promise gap in the reduction does not stem from an exponentially small penalty term, but because of the embedding of a PreciseQMA-hard computation. It is thus doubtful whether there is an analogue of Corollary 21 that holds for the PSPACE case.
We know there exist QMA-hard Local Hamiltonian constructions with terms that all have non-varying O(1) weights in the system size, albeit few of them are translationally invariant; and if they are, the local dimension is large, or the construction is contrived [8,27]. Corollary 21 is interesting for this precise reason: given a Hamiltonian with wildly varying interaction strengths, there exists another Hamiltonian where each local term has almost zero variation in strength from site to site (apart from the two energy scales; but they apply uniformly throughout the system), and with the same hardness properties. We thus conjecture that for any construction where translational invariance is hard to obtain, "almost" translational invariant models can be constructed from them, with compatible gap scaling. This, of course, comes at the expense of changing the interaction set to allow for H b from Eq. (4) to be included, and modifying the interaction graph-if only by incrementing the spatial interaction topology by at most one dimension, as e.g. done in Theorem 19 from a two-to a three-dimensional many-body system. Ann. Henri Poincaré As a final remark: in essence, one could achieve a similar effect as in Corollary 21 by writing a Hamiltonian This would be an unfair comparison though: if we expand such a Hamiltonian in a Pauli basis, there will be small constants of O(χ) 1; the large relative energy variations of order one are relevant for the complexity characteristics. Corollary 21, on the other hand, only introduces a single, uniform energy scale, with negligible relative strength variations, even when expressed in the same Pauli basis.

Hamiltonians with Hybrid Geared Asymptotics
One curious feature of our construction is that it allows scaling the interaction strength of a coupling with a spatial dimension of the system at hand. We phrase two theorems. Following a construction by [27], we first define the following one-and two-local interaction terms acting on neighbouring spins in the M direction of the lattice-which we call a row: Within each row, it is straightforward to check that these coupling terms create a unique product ground state |r 0 := |0 ⊗ |0 ⊗M −1 ; the overall ground state so far is then |r 0 ⊗L . In the ground state, there is thus precisely one column on the lattice where all spins have flag state |0 , and all other sites across the lattice are in state |1 ; and it is clear that this ground state is unique, and has a spectral gap of 1 to the next eigenstate above it.
We now take the local interactions of the QMA EXP -complete Local Hamiltonian variant, w and p, to only act non-trivially if there is a zero flag below, i.e. via |0 0| ⊗ w, and analogously for p. Similarly, we define a translationally invariant bound state Hamiltonian, i.e. by setting |1 1| ⊗ H b for b = 2; note that for any specific column index, all the latter terms commute, and that the dimension of H (dim H ≥ 42 by [8,Th. 60]) is more than enough to implement a binary counter using only 2-local terms (see [8]), yielding T = 2 M −3 by Remark 10; this includes a locally identifiable final clock state T on which we wish to condition in due course. Now, the on-site interaction p contains a so-called output penalty term p , which is used to inflict an energy penalty on invalid computation outcomes; this is what pushes the ground state energy of the history state Hamiltonian up by a 1/ poly L amount in case of an embedded NO-instance. We couple this penalty term to |T T | in the biased clock Hamiltonian's space as p := p ⊗ |T T |; this term is originally 1-local, so we do not increase the overall Hamiltonian's locality. All other terms will remain uncoupled.
Claim 1 and 2 then follow by construction. The consequence of scaling the system in dimension M is to reduce the effect of the output penalty; by Lemma 4 and for b = 2, the magnitude of the scaling will be ∝ 1/2 T . Since T ∝ 2 M , the suppression of the error term is doubly exponential in M . It is clear that if M = O(log(log(L)), the penalty term is only polynomially suppressed, and the problem remains QMA-hard-in particular, there exists a polynomial p such that with a promise gap closing as 1/p(n), where n = L×M is the system size, the YES and NO instances of the embedded computation lie above resp. below the corresponding thresholds.
On the other hand, for any polynomially closing promise gap an energy difference of O(1/ exp n) will essentially be invisible; for M = Ω(log L), all embedded computational instances-irrespective of their outputs-are thus jointly either YES or NO instances in the Local Hamiltonian problem. The claim follows.
It is clear that variants of this effect are easily constructed, by varying the bound state Hamiltonian H b , or by changing which terms couple to its final state. We emphasize that the threshold M = O(log(log(L))) is, again, an arbitrary choice, and we can e.g. set it at M = O(log(L)), implying that different directions of geared limits have distinct complexity-theoretic behaviour, as the following corollary shows. Proof The local Hamiltonian problem with a 1/ exp n promise gap is PSPACEhard (see definition 17 and the following discussion). In a similar fashion as for QMA, for a translationally invariant Hamiltonian with a single free parameter n-i.e. the system size-the input to the computational Local Hamiltonian problem has size |n| = log n ; this means that polynomial space in the input size |n| only requires a logarithmically sized subspace of the available spins in the many-body system. As a consequence, the natural hardness for a 1/ exp n promise gap and the translationally invariant Local Hamiltonian problem has to be BQEXPSPACE (which can be constructed for a PreciseQMA EXP verifier, defined analogously as in [24]).
With a smaller promise gap, we need to make the extra spatial size M (L) larger than before to not inflict any penalty on the computation output. More precisely, if M (L) = Ω(L), then the effective penalty strength is O(1/ exp(exp n)), much smaller than the promise gap-the problem becomes easily decidable. On the other hand, if M (L) = O(log L), there exists a 1/ exp n promise gap for which the Local Hamiltonian variant is BQEXPSPACE complete.

Conclusion
With the construction presented in this work we show that one can significantly reduce the unphysically large energy variations present in various models used in Hamiltonian complexity theory. While it does not completely remove the necessity of strong interactions, it decouples the scaling from the range of the interactions and precision to be simulated; furthermore, the approximation error introduced is relative, meaning that any requirements on an error bound present in a target Hamiltonian remain intact. This does not come for free: we need to add ancillary qubits, potentially increase the locality and/or the local dimension of the system. While one could certainly claim that it is arguable which model is more physical, in the end, our work draws the tradeoff between locality, local dimension, varying interaction strength and the overall norm of an operator from a new angle. We also emphasize that Eq. (4) is stoquastic-i.e. it only has non-positive off-diagonal matrix entries. Stoquastic Local Hamiltonian variants are naturally StoqMA-complete (see discussion below the introduction of QMA in definition 16); our construction is thus compatible with these constructions as well.
Another shift in perspective is given with regards to translational invariance. While most if not all many-body systems in the real world have translationally invariant interactions, many complexity-theoretic models do not. Modifying them to be translationally invariant often requires an unphysically large local dimension. With our construction, it is conceivable that nontranslationally invariant systems can be lifted to "almost" invariant models. In this way, complex systems can be arbitrarily close to true translational invariance-this becomes particularly interesting if the latter are deemed easy to solve.
To draw the connection back to the abstract, creating an effective interaction strength by coupling to an extraneous Hilbert space governed by its own Hamiltonian (H b here) is reminiscent of how e.g. leptons interact with each other via a bosonic exchange particle: a couplingqγ μ W μ q as e.g. part of the Standard Model Lagrangian, where W μ is the boson field that determines the strength of attraction between the leptonsq and q. Similarly, the Hubbard-Stratonovich transformation, used to linearize field equations for many-body interaction terms, replaces direct particle-particle interactions into a system of equations describing independent particles coupled to a background field [29,43]. Even though it is not meaningful to speak of the thermodynamic limit of our gadget Hamiltonian without the introduction of additional renormalization terms to cancel out emerging infinities, such methods are well studied in the context of field theories [10,40,50]. It is thus reasonable to assume that similar effective perturbation gadgets as in our work can be created to introduce-and potentially explain-diverging energy scales present in many continuous theories.
There is a list of open problems we wish to address in future work.
1. In the commuting case, perturbation theory can be applied in parallel without the requirement of a coupling constant that scales with the system size; this also applies to our findings. The Local Hamiltonian problem is not yet completely solved for the case of commuting terms, although there is progress [1,5,42]. While our path clock in Sect. 2.3 is not commuting, in [16] the authors present a commuting version, which could be similarly biased as ours to present a sufficient falloff. Can one construct a commuting variant of perturbation gadgets, applicable to the commuting Local Hamiltonian problem? 2. What about using e.g. the Schrieffer-Wolff transform instead of a Feynman-Dyson series? In [18,Sec. 5], the authors have analysed the tradeoff between the two constructions, and found the scaling to be favourable for the Schrieffer-Wolff expansion. And can we combine our result with the numerical optimizations of the necessary scaling as in [18]? 3. Including the tiling Hamiltonian to cancel out cross-terms renders Eq.
(26) particularly simple; indeed, if we replaced η with η −1 , Catalan numbers emerge in the sum, with an emerging link to Motzkin walks [36]. Can we learn something from this, and e.g. add Eq. (26) up exactly?
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/ by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the