Abstract
Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation accomplishes this by using the dynamics of a controlled many-body system to mimic those of another system; such a method is feasible on near-term devices. We show that previous theoretical approaches to analogue quantum simulation suffer from fundamental barriers which prohibit scalable experimental implementation. By introducing a new mathematical framework and going beyond the usual toolbox of Hamiltonian complexity theory with an additional resource of engineered dissipation, we show that these barriers can be overcome. This provides a powerful new perspective for the rigorous study of analogue quantum simulators.
Similar content being viewed by others
Introduction
The simulation of quantum systems has long been identified as a potential application for quantum technologies1, for which long-term benefits may range from condensed matter physics to quantum chemistry and the life sciences2,3. This problem is classically intractable, owing to exponential growth in the number of parameters required to describe the state of a many-body system, whereas the advantage of quantum hardware for this purpose is obvious: one merely has to prepare the required many-body state. On a universal quantum computer, time evolution can then be discretised and approximated by a quantum circuit, through a series of quantum gates4. This approach, known as digital quantum simulation5, has seen extensive theoretical development6,7 and remains a promising route towards attaining quantum advantage8. However, useful and scalable simulations remain out of reach for near-term technology9 due to the requirement of a large universal fault-tolerant quantum computer. In this work, we focus on an alternative approach: analogue quantum simulation.
Broadly speaking, an analogue quantum simulator consists of an engineered and well-controlled many-body system with adjustable interactions, with the capability to prepare initial states and perform measurements10. By tuning such a system, one aims to mimic a different target system; in this way, computing the dynamics of the target system can be accomplished through the native time evolution of the simulator, without requiring the application of a universal set of gates. These more modest physical requirements promise near-term potential for analogue quantum simulation, despite the inherent limitations fixed by a given experimental apparatus.
Characterisation of analogue quantum simulators is, unlike the digital case, relatively under-explored from a theoretical perspective. Existing work in this direction includes that of Cubitt et al.11, in which the authors define a notion of Hamiltonian simulation in terms of low-energy encodings: a low-energy subspace of the simulator Hamiltonian is required to approximate the spectrum of the target Hamiltonian. This notion has been extraordinarily successful in making complexity-theoretic reductions between various Hamiltonians, leading to the classification of many so-called universal families12,13,14,15,16 which have the power to simulate all of many-body physics. Such reductions do not necessarily aim to capture experimental possibilities, however: as we prove, the relatively simple task of encoding a system of n non-interacting qutrits into a linear number of qubits in this regime ends up requiring a simulator system whose individual interactions scale as Ω(n). This scaling arises due to the dimension mismatch when one encodes a qutrit into a set of qubits, resulting in unwanted local configurations that must be prohibited in the low-energy subspace by a large energy penalty (see Fig. 1). Similar scalings are observed to arise through the use of Hamiltonian gadgets17,18, a tool used for many Hamiltonian reductions. Although the qutrit-to-qubit result does not extend to the case where the n qutrits are simulated by Ω(n2) qubits, we also note that blowing up the system size may, in some cases, necessitate strong interactions in order for correlations to spread fast enough through the enlarged system.
A sketch of the on-site energies for a system of non-interacting qutrits under a low-energy encoding, before and after simulation in the sense introduced by Cubitt et al.11. In this example, each qutrit is mapped to a system of two qubits. The original Hamiltonian consists of a sum ∑jP(j) of rank two projectors P(j) applied to each qutrit, resulting in energy levels 0,1,1. In order to simulate the qutrit Hamiltonian, an energy penalty of at least Δ must be given to one of the four local states at each site. This is a simplification: in general the simulator sites \({{{{\mathcal{H}}}}}_{j}^{{\prime} }\) may interact and hence local energies are not well-defined.
We argue that for practical applications to large-scale many-body simulations, such as for quantum chemistry, the simulation of an n-site many-body system should not require the implementation of individual interactions whose magnitude scales with n. The necessity of this requirement is clear from a logistical perspective since an experimental device will only be able to implement a bounded range of energy scales for a single interaction. However, there is also philosophical motivation to be suspicious of such scalings: a many-body Hamiltonian is inherently a modular object, and an analogue quantum simulation should reflect this. The addition of a few qubits and local interactions to one end of the physical system should require an analogous action on the simulator—it should not require the adjustment of every other interaction in the system.
Despite this additional requirement of scalability, there is also a sense in which the framework of11 can be relaxed: the requirement to simulate the full physics of a target Hamiltonian in the low-energy subspace of a simulator is unnecessary in many cases. For example, one may only wish to simulate a specific set of local observables, or exploit symmetries to restrict to an invariant subspace under the Hamiltonian (a regime explored, in the case of a low-energy subspace, by Aharonov et al.19). Furthermore, as the experimental distinction between analogue and digital devices becomes increasingly blurred9,20, it is important to consider a range of experimental possibilities beyond pure Hamiltonian evolution, such as intermediate unitary pulses and open-system dynamics.
In this work, we propose a mathematical framework for analogue quantum simulators to address the above points and capture the full scope of experimentally realisable systems. We additionally develop a general characterisation for Hamiltonian gadgets, and find rigorous no-go results for their scalable use for locality reduction. Finally, we construct a new dissipative gadget that circumvents the restrictions we find in the pure Hamiltonian case. In the regime of scalable quantum simulators, we do not expect to talk about a simple class of universal Hamiltonians that can simulate all others in any sense resembling previous results. On the other hand, the more general notion of simulation, which we outline in this work, gives rise to a new notion of universality, not phrased in terms of Hamiltonian classification but rather the dynamics of observables. We expect that here a resource theory of simulation should arise, with the power of simulators related by a partial order in analogy to the theory of multipartite states and tensor networks21,22,23.
Results
The analogue quantum simulator
In this section, we describe our mathematical framework for analogue quantum simulation, for which further details can be found in the Methods section. The capabilities of a simulator are characterised by a target Hamiltonian H, a set of states Ωstate, and a set of observables Ωobs; the goal of the simulator is then to approximate the evolution of the observables in Ωobs under H, starting from initial states in Ωstate. Restricting the set of states Ωstate may offer practical and theoretical benefits: for example, one could reduce to those that can be reliably prepared on an experimental device, or take advantage of the symmetries of H to restrict Ωstate to a specific invariant subspace and simulate only the reduced Hamiltonian. Likewise, Ωobs may reflect the capabilities of the measurement apparatus, or for a many-body system one might take advantage of a highly localised set of observables to only simulate their Lieb-Robinson light cone24, significantly reducing the hardware overhead necessary to simulate for small times. Such techniques have been studied in the context of many-body state exploration25,26, and more recently in the realm of analogue simulation27.
An analogue quantum simulator can be mathematically described in terms of three components, which we illustrate in Fig. 2. First, a state encoding \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\), which maps initial states from the target set ρ ∈ Ωstate into the simulator system. This is defined in terms of a quantum channel, allowing one to interpret the target state as a quantum input to the simulator, in contrast to the regime of fault-tolerant digital quantum computers whose input is ultimately classical. Next, the simulator’s time evolution is specified by a family of quantum channels \({\{{T}_{t}\}}_{t\in [0,{t}_{\max }]}\). These describe the dynamics of the simulator, for example the evolution under a simulator Hamiltonian \({H}^{{\prime} }\). However, one could also consider Tt accounting for interactions with a bath (such capability is required by the criteria for analogue simulators given by Cirac et al.10), modelling errors, or capturing other engineered controls reflecting the possibilities of the experimental apparatus. The final component of the simulator is an encoding for observables \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\), a unital and completely positive map which sends an observable of interest O ∈ Ωobs to the relevant observable to be measured on the simulator system.
A schematic description of our framework for analogue quantum simulation, in contrast with the digital approach. Both approaches aim to compute the observable expectation value \(\langle O\rangle (t)={{{\rm{tr}}}}[O{e}^{-itH}\rho {e}^{itH}]\), given an initial state ρ. The analogue simulator, which uses state encodings \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\) respectively, has accuracy ϵ if \(| {{{\rm{tr}}}}[O{e}^{-itH}\rho {e}^{itH}]-{{{\rm{tr}}}}[{{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(O)({T}_{{t}^{\circ}} \, {{{{\mathcal{E}}}}}_{{{{\rm{state}}}}})(\rho )]| \le \epsilon\).
After the encoding and time evolution steps for a given initial state ρ ∈ Ωstate and time \(t\in [0,{t}_{\max }]\), the simulator system lies in the state \(({T}_{{t}^{\circ}} \, {{{{\mathcal{E}}}}}_{{{{\rm{state}}}}})(\rho )\), upon which one measures the encoded observable \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(O)\) for a chosen O ∈ Ωobs. The simulation has accuracy ϵ if the expectation value of this measurement is within ϵ of its target value—that is, the expected value of measuring O on e−itHρeitH. Note that rather than a Hamiltonian H, one could just as easily consider the simulation of an open target system, for instance described by a quantum dynamical semigroup28,29.
For practical simulators, some constraints must be placed on the maps used in this definition. We generally assume that both \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\) are local in a sense we define, to ensure that local errors correspond to local noise on the target system, and that local observables can be measured locally on the simulator system. Moreover, the time evolution channel Tt should be implementable without the need for feed-forward measurement results for adaptive control: the lack of error correction is an important and characteristic feature of analogue simulators.
Generalising Hamiltonian gadgets
A ubiquitous technique for Hamiltonian reductions in complexity theory is the use of so-called Hamiltonian gadgets17,18,30,31. These provide a recipe to simulate complicated many-body interactions from a more restrictive family, for example, to simulate a 3-body interaction using 2-body interactions. In this section, we arrive at a general formalism for such constructions, in order to prove that they are associated with unavoidable energy scalings which pose a significant challenge for experimental realisations. The usual procedure, as formulated by Bravyi et al.18 for example, is as follows: starting from a target Hamiltonian H (which might be a single interaction in a far larger system), one first adjoins an ancillary qubit m. On this enlarged system one defines the gadget Hamiltonian by \({H}^{{\prime} }=\Delta \left\vert 1\right\rangle {\left\langle 1\right\vert }_{m}+V\), where Δ ≫ 1 is a large parameter used to define a low-energy subspace approximately in terms of the \(\left\vert 0\right\rangle\) state of the mediator qubit, and V is a relatively small term which, via a perturbative approximation, effectively simulates the target H in this low-energy subspace.
It is not surprising that this method of construction generically requires strong interactions corresponding to the large value of Δ needed to provide a sufficiently high energy penalty, but it is not immediately clear that there is no way around this cost (possibly outside of the perturbative regime). Indeed, several works32,33,34 have explored the optimisation of Hamiltonian gadgets for practical implementation, though generally the problem scaling interactions is not eliminated entirely. In this work, we produce a generalized framework for gadgets in order to prove a lower bound for such scalings, suggesting that such techniques may be unsuitable for experiments on large systems. Our results are summarised in Fig. 3b, and full mathematical details can be found in the Methods section.
a The interaction hypergraph of a Hamiltonian containing a 3-local interaction which is replaced by a 2-local gadget. The gadget property requires that the spectrum is unchanged up to ϵ + ζ∥Helse∥, for ϵ, ζ > 0, when restricted by a projector \({P}^{{\prime} }\). b Structure of gadget results; boxes highlighted in yellow indicate the central argument for the energy scaling no-go. We first formalise the desirable properties of gadgets and show that they imply a general definition, from which we can prove the energy scaling theorem along with various combination properties, including a generalisation of a result of Bravyi et al.31 for ground state energy (GSE) estimation.
Let H be the target Hamiltonian on a Hilbert space \({{{\mathcal{H}}}}\), and let the gadget Hamiltonian \({H}^{{\prime} }\) act on the space \({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}}\), for \({{{\mathcal{A}}}}\) some ancillary system. We require the following two properties of \({H}^{{\prime} }\), illustrated in Fig. 3a:
-
Accuracy: The spectrum of H should be approximated by that of \({H}^{{\prime} }\), in some subspace defined by a projector \({P}^{{\prime} }\in {{{\rm{Proj}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), up to error ϵ≥0.
-
Combination: The above property should hold even when any additional Hamiltonian Helse is added to both H and \({H}^{{\prime} }\), at the expense of an additional spectral error ζ∥Helse∥, where ∥ ⋅ ∥ denotes the operator norm.
For small error parameters ϵ and ζ, these properties are—non-trivially—sufficient to force \({H}^{{\prime} }\) to satisfy the following definition, which resembles previously studied notions of simulation11,18. We say that \({H}^{{\prime} }\) is an (η, ϵ)-gadget (where η is a new parameter related to ζ, also measuring the ability of the gadget to combine with other terms) for H if there exists a projector \(P\in {{{\rm{Proj}}}}({{{\mathcal{A}}}})\setminus \{0\}\) and a unitary operator \(U\in {{{\rm{U}}}}({{{\mathcal{H}}}}\otimes A)\) satisfying two conditions. Firstly, U must be η-close to the identity: ∥U − I∥≤η. Then, defining the projector \({P}^{{\prime} }\) by \({P}^{{\prime} }=U({{{\rm{I}}}}\otimes P){U}^{{{\dagger}} }\) (so that η in some sense quantifies how close \({P}^{{\prime} }\) is to a pure projection on the ancillary system), the second condition ensures that the spectrum \({P}^{{\prime} }{H}^{{\prime} }{P}^{{\prime} }\) should approximate that of H, up to some multiplicity: \(\parallel {P}^{{\prime} }{H}^{{\prime} }{P}^{{\prime} }-U(H\otimes P){U}^{{{\dagger}} }\parallel \le \epsilon\).
This gadget definition expresses the quality of a gadget through two parameters: ϵ can be thought of as the absolute error of the gadget, whilst η bounds the error incurred when the gadget is combined with other interactions in a Hamiltonian. In particular, when ∥Helse∥ ~ n grows with the size of the system, η must correspondingly shrink to hold the error constant.
Despite the generality of this definition, it is sufficient to guarantee that such gadgets can be combined in parallel. That is, given a many-body Hamiltonian H = ∑iHi and sufficiently good gadgets \({H}_{i}^{{\prime} }\) for each of the individual terms Hi, the Hamiltonian \({H}^{{\prime} }={\sum }_{i}{H}_{i}^{{\prime} }\) constitutes a good gadget for H. A similar result holds for low-energy gadgets (for which the projector \({P}^{{\prime} }\) is replaced by a projector onto the low-energy subspace of \({H}^{{\prime} }\)), and also leads to a generalisation of the ground state energy estimation result of Bravyi et al.31.
On the other hand, we show that, when used for certain types of reduction, gadgets come at an unavoidable energy cost. In particular, any attempt to simulate a k-body interaction H via a gadget \({H}^{{\prime} }\) consisting of \({k}^{{\prime} }\)-body interactions for \({k}^{{\prime} } < k\) necessarily requires interaction strengths scaling as Ω(η−1). In order to control the absolute error of a many-body system, η−1 must grow with the size of the system, leading to unfeasible energy scalings and constituting a significant barrier for Hamiltonian reductions in the regime of experimentally realisable analogue quantum simulators.
Gadgets from the quantum Zeno effect
To circumvent our no-go result for scalable Hamiltonian locality reduction, in this section, we exhibit a new kind of gadget, taking advantage of the non-unitary possibilities afforded by a general simulation channel Tt. This works by restricting the mediator qubit to its \(\left\vert 0\right\rangle\) state not with a strong interaction but through inertia induced by the quantum Zeno effect. This powerful resource can be used to build a direct k-to-(⌈k/3⌉ + 1)-local gadget, without interactions scaling with the size of the system.
The recipe for this construction is qualitatively similar to that for usual Hamiltonian gadgets: starting from a target interaction H, a mediator qubit m is adjoined to the system, and evolves under a simulator Hamiltonian \({H}^{{\prime} }\). In this case, however, \({H}^{{\prime} }\) need not contain an interaction \(\Delta \left\vert 1\right\rangle {\left\langle 1\right\vert }_{m}\), with Δ scaling with the size of the system. Instead, a dissipative channel is applied to the qubit m at regular intervals separated by time δt. Provided that δt is small enough, the quantum Zeno effect keeps m effectively fixed in its \(\left\vert 0\right\rangle\) state with high probability, whilst the remainder of the system evolves as though under the target Hamiltonian H. This is illustrated by Fig. 4, and a rigorous description can be found in the Methods.
Circuit representation of the non-unitary gadget procedure for a single timestep. The initial state \({\left\vert {\psi }_{0}(0)\right\rangle }_{{{{\mathcal{H}}}}}{\left\vert 0\right\rangle }_{{{{\mathcal{A}}}}}\) is evolved under a Hamiltonian \({H}^{{\prime} }\) for time δt, resulting in a superposition of states with the ancillary qubit in the \({\left\vert 0\right\rangle }_{{{{\mathcal{A}}}}}\) and \({\left\vert 1\right\rangle }_{{{{\mathcal{A}}}}}\) positions. After applying the dissipative channel to the \({{{\mathcal{A}}}}\) system, the system collapses to its \({\left\vert 0\right\rangle }_{{{{\mathcal{A}}}}}\) state with high probability due to the quantum Zeno effect. Meanwhile, the resulting state on the \({{{\mathcal{H}}}}\) system approximately corresponds to evolution under a different Hamiltonian, \({H}_{{{{\mathcal{H}}}}}\).
These non-unitary gadgets may be combined with other terms in a Hamiltonian at no extra cost (effectively corresponding to a gadget with combination error parameter η = 0), yielding an improvement on any possible pure Hamiltonian gadget. On the other hand, the construction has various caveats: strong interactions (though not scaling with system size) are still necessary for high accuracy of a single gadget, and we expect that combining multiple such gadgets will require strong interactions, to suppress the probability of any ancillary qubit transitioning into the \(\left\vert 1\right\rangle\) state. Moreover, the precisely engineered stroboscopic dissipation channel constitutes a new experimental challenge.
Nevertheless, this construction provides insight into the ways in which non-unitary dynamics might be exploited for practical analogue quantum simulation problems—indeed, similar tools have already found applications in theory35,36 and in practice37 for digital quantum computing. In light of our theorems implying extensive interaction scaling for qutrit-to-qubit mappings and gadget locality reduction, which effectively serve as no-go theorems for practical universal simulators built from pure Hamiltonian dynamics, we anticipate that similar hybrid techniques will constitute a powerful tool for attaining useful quantum advantage with quantum simulators.
Methods
Criteria for quantum computation and simulation
In a review of the prospective possibilities of quantum computing38 the author provided a set of requirements, now known as the DiVincenzo criteria, designed to serve as a full specification for implementations of universal quantum computers. These are summarised in Fig. 5.
As well as concretely providing the experimentalist with a necessary set of criteria to aim towards, the sufficiency of the DiVincenzo criteria provides the theorist with a canonical yardstick to judge the applicability of their protocol to idealised quantum hardware. It is, therefore, important that such requirements reflect exactly what can be expected from quantum technology in the long term, neither excluding feasible technologies nor including unfeasible procedures.
A similar set of criteria for analogue quantum simulators is discussed by Cirac et al.10, also summarised in Fig. 5. These are all natural requirements to ask of a quantum simulator, but it is noteworthy that criterion III does not provide any restriction on the interactions that one should expect the simulator to include. This leads to a problem which does not arise for the DiVincenzo criteria: whereas a quantum computer can approximate arbitrary k-qubit gates from the compact set \({{{\rm{U}}}}({({{\mathbb{C}}}^{2})}^{\otimes k})\) of unitary transformations relatively cheaply due to the Solovay-Kitaev theorem39, the task of an analogue quantum simulator is to implement k-qudit interactions from the unbounded set of possible Hamiltonians Herm \((({\mathbb{C}})^{{{\rm{d}}}})^{\otimes k}\left)\right.\). The ability to realise arbitrarily strong interactions on a physical device is clearly an impossibility.
Thus, the key extra criterion which we demand of an analogue quantum simulator is that the encoding of the target Hamiltonian should be size-independent. Concretely, if the Hamiltonian H to be encoded consists of local interactions \({({h}_{i})}_{i=1}^{m}\) on n sites then the encoding of individual terms should not depend, for instance by polynomial scaling of interaction strengths, on the size of the physical system n. In particular, we argue that methods for practical analogue quantum simulation must respect a limit on the interaction strengths of the simulator Hamiltonian. The strongest interactions should be bounded by some constant fixed by physical limitations, and the weakest interactions should be similarly bounded from below (since sufficiently weak interactions will be overwhelmed by noise in the simulator). In addition, in order to ensure the local and size-independent encoding of each site into the simulator, we argue that the simulator should grow no faster than linearly with the size of the target system. If each site is encoded into more than O(1) simulator sites, it will be impossible to encode the full system into a simulator of the same dimension while preserving geometric locality (without introducing scaling interactions). We summarise these requirements with the following qualitative definition:
Definition 1
(Size-independent simulation) We say that an analogue quantum simulation is size-independent if the simulation of a n-site Hamiltonian can be implemented scalably with n. By this, we mean that the number of qubits used in the simulation should grow no faster than linearly in n, and the interaction strengths necessary should remain Θ(1).
It is worth noting that further formalisation is required to make this definition robust. For example, suppose we are given a Hamiltonian H = h1 + h2 where ∥h1∥, ∥h2∥ = O(n−1), which violates the size-independence requirement. One could simply define \({h}_{1}^{{\prime} }={h}_{1}+K\), \({h}_{2}^{{\prime} }={h}_{2}-K\), for some K = Θ(1), and then \(H={h}_{1}^{{\prime} }+{h}_{2}^{{\prime} }\) can be written in a form which does not obviously violate Definition 1. To exclude such possibilities, we could impose an additional requirement that H is given in a canonical form, such as that described by Wilming et al.40.
As well as being experimentally and qualitatively desirable, encoding interactions independently has quantitative benefits; as noted by Cubitt et al.11, for a suitably local Hamiltonian encoding, local errors on the simulator system will correspond to local errors on the target system. For NISQ hardware, this represents an extremely useful way to mitigate the negative effects of a noisy simulation: rather than random scrambling, noise can be viewed as the manifestation of physically reasonable noisy effects on the target system.
Finally, studying the power of Hamiltonians subject to interaction energies that are constant in system size is well-motivated in its own right, from the perspective of Hamiltonian complexity. For example, Aharonov et al.19 show that restriction to such Hamiltonians will necessarily sacrifice some sense of the universality of the simulator. Earlier results in Hamiltonian complexity theory31, however, show that in many cases, it is still possible to simulate ground state energies up to an extensive error.
Hamiltonian complexity theory
We say that a Hamiltonian H on the space of n qubits \({{{\mathcal{H}}}}={({{\mathbb{C}}}^{2})}^{\otimes n}\) is k-local if it can be written as \(H={\sum }_{j=1}^{N}{h}_{j}\), where each of the terms hj acts on at most k of the qubit sites. We consider the hj individual interactions in the Hamiltonian and make reference to the interaction hypergraph, whose vertices are qubits and whose (hyper)edges are interactions (joining the qubits on which they act), illustrated in Fig. 6.
Informally, the k-local Hamiltonian problem asks whether the ground state energy of a k-local Hamiltonian is less than a, or greater than b, for some real numbers a < b separated by a suitably large gap. This problem lies in the QMA complexity class: the natural quantum analogue to the classical NP, containing problems whose solutions can be efficiently verified (but not necessarily found) on a quantum computer.
Definition 2
(k-local Hamiltonian problem) The k-local Hamiltonian problem is the promise problem which takes as its input a k-local Hamiltonian \(H={\sum }_{j=1}^{N}{h}_{j}\) on the space of n qubits \({{{\mathcal{H}}}}={({{\mathbb{C}}}^{2})}^{\otimes n}\), where N = poly(n), and for each j we have ∥hj∥ ≤ poly(n) and hj is specified by O(poly(n)) bits.
Given a < b with b−a > 1/poly(n), let λ0(H) denote the lowest eigenvalue of H. Then the output should distinguish between the cases
-
Output 0: The ground state energy of H has λ0(H) ≤ a.
-
Output 1: The ground state energy of H has λ0(H) ≥ b.
Through the Feynman-Kitaev circuit-to-Hamiltonian construction41, it was established that the 5-local Hamiltonian problem is QMA-complete, and subsequent works optimising the construction30 and using gadget techniques42 reduced this further to show the QMA-completeness of the 2-local Hamiltonian problem. Various further optimisations have been found to refine the problem and further restrict the family of allowed Hamiltonians (see for example, refs. 43,44); indeed hardness results have been shown to hold even under the significant restriction to 1-dimensional translationally invariant systems45. QMA-completeness is closely related to a notion of universality for simulators; an equivalence was proved by Kohler et al.15.
The constructions involved in the aforementioned results contain Hamiltonian interaction strengths which scale polynomially, or exponentially, with system size—such Hamiltonians are infeasible for an analogue simulator. A notable exception to this is the work of Bravyi et al.31, in which the authors use the Schrieffer-Wolff transformation to show that bounded-strength interactions are sufficient for one to reproduce the ground state energy of the original Hamiltonian up to an extensive error.
As much of this Hamiltonian simulation literature focuses on specific complexity-theoretic problems, comparatively little work has been done to actually define a mathematical framework for analogue quantum simulation to be used in experiment. Notable recent work in this direction includes that of Cubitt et al.11, in which the authors study methods of encoding Hamiltonians via a map \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}:{{{\rm{Herm}}}}({{{\mathcal{H}}}})\to {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\), which satisfy the natural requirement of preserving the spectrum of observables. Additionally, in the case that \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\) is a space of many sites, they introduce the further notion of local encodings, which map local observables in \({{{\mathcal{H}}}}\) to local observables in \({{{{\mathcal{H}}}}}^{{\prime} }={\otimes }_{i=1}^{{n}^{{\prime} }}{{{{\mathcal{H}}}}}_{i}^{{\prime} }\). By deriving the most general possible form of a spectrum-preserving Hamiltonian encoding, and then imposing natural locality conditions, the authors arrive at the following definition.
Definition 3
(Local Hamiltonian encoding11) A local Hamiltonian encoding is a map \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}:{{{\rm{Lin}}}}({\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i})\to {{{\rm{Lin}}}}({\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}^{{\prime} })\) of the form
where P and Q are locally distinguishable orthogonal projectors on an ancillary space \({{{\mathcal{A}}}}={\otimes _{i=1}^{n}}{{{{\mathcal{A}}}}_{i}}\), and \(V={ \otimes _{i=1}^{n}}{{V}_{i}}\) where \({V}_{i}\in {{{\rm{Isom}}}}({{{{\mathcal{H}}}}}_{i}\otimes {{{{\mathcal{A}}}}}_{i},{{{{\mathcal{H}}}}}_{i}^{{\prime} })\) for all i. Here \(\bar{M}\) denotes the complex conjugate of the matrix M.
Projectors \(P,Q\in {{{\rm{Proj}}}}({\otimes }_{i}{{{{\mathcal{A}}}}}_{i})\) are locally distinguishable if, for all i, there exist orthogonal projectors \({P}_{i},{Q}_{i}\in {{{\rm{Proj}}}}({{{{\mathcal{A}}}}}_{i})\) such that (Pi ⊗ I)P = P and (Qi ⊗ I)Q = Q. Generally, we consider the case of rank(P) > 0 (referred to as standard11), for which one can define a corresponding state encoding
where τ is a state on \({{{\mathcal{A}}}}\) satisfying Pτ = τ.
Moreover, the authors define the following notion of simulation, which relaxes the requirements of locality and allows for some error in the simulated eigenvalues.
Definition 4
((Δ, η, ϵ)-simulation11) A Hamiltonian \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })={{{\rm{Herm}}}}({\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}^{{\prime} })\) is said to (Δ, η, ϵ)-simulate a Hamiltonian \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})={{{\rm{Herm}}}}({\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i})\) if there exists a local encoding (Definition 3) \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(M)=V(M\otimes P+\bar{M}\otimes Q){V}^{{{\dagger}} }\) such that
-
(i)
There exists an encoding \({\tilde{{{{\mathcal{E}}}}}}_{{{{\rm{obs}}}}}(M)=\tilde{V}(M\otimes P+\bar{M}\otimes Q){\tilde{V}}^{{{\dagger}} }\) (where \(\tilde{V}\in {{{\rm{Isom}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}},{{{{\mathcal{H}}}}}^{{\prime} })\) need not have a tensor product structure as in Definition 3) such that \(\parallel V-\tilde{V}\parallel \le \eta\) and \({\tilde{{{{\mathcal{E}}}}}}_{{{{\rm{obs}}}}}({{{\rm{I}}}})={P}_{\le \Delta ({H}^{{\prime} })}\) is the projection onto the low-energy (≤ Δ) subspace of \({H}^{{\prime} }\), and
-
(ii)
\(\parallel {P}_{\le \Delta ({H}^{{\prime} })}{H}^{{\prime} }{P}_{\le \Delta ({H}^{{\prime} })}-{\tilde{{{{\mathcal{E}}}}}}_{{{{\rm{obs}}}}}(H)\parallel \le \epsilon\).
This approach (later generalised by Apel et al.46 and refined with resource constraints by Zhou et al.16) provides an elegant framework to capture a notion of one Hamiltonian fully simulating another. However, we believe that this regime does not capture the scope of possibilities for analogue quantum simulation experiments. On one hand, the formalism requires the entire physics of the target system to be encoded into the low-energy subspace of a simulator—this rules out simulators which only simulate part of the target system, or in a different subspace. On the other hand, the formalism is too broad in the sense that it does not prohibit unrealistically scaling interaction strengths in violation of Definition 1.
Framework
The generic task of an analogue quantum simulator is to estimate the dynamics of observables in a system \({{{\mathcal{H}}}}\) under the evolution of a target Hamiltonian H, up to some maximum time \({t}_{\max }\). In particular, it is not always necessary to simulate the entire target system in arbitrary configurations: it may be convenient to restrict to a particular subset of initial states Ωstate, for example lying in a subspace invariant under the Hamiltonian or corresponding to the states which can be reliably prepared by the simulator, and similarly to a particular subset of observables of interest Ωobs. We denote by \({{{{\mathcal{H}}}}}^{{\prime} }\) the Hilbert space corresponding to the simulator system, and for \(t\in [0,\, {t}_{\max }]\) we write \({T}_{t}:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{{\mathcal{H}}}}}^{{\prime} })\) for the family of time evolution quantum channels implemented by the simulator, where \(D({{{{\mathcal{H}}}}}^{{\prime} })\) is the set of density matrices on \({{{{\mathcal{H}}}}}^{{\prime} }\). This approach, in which we view simulations in terms of individual observables rather than the entire Hamiltonian, has been considered in earlier work25,26,27.
The minimal requirement for a simulator is that it should approximate the expectation values of the elements of Ωobs. That is, \({{{\rm{tr}}}}[O{e}^{-iHt}\rho {e}^{iHt}]\) should be close to \({{{\rm{tr}}}}[{O}^{{\prime} }{T}_{t}({\rho }^{{\prime} })]\) for all ρ ∈ Ωstate and O ∈ Ωobs, where \({\rho }^{{\prime} }\) and \({O}^{{\prime} }\) are some encoded versions of the states and operators respectively. Notice that, in principle, the experimentalist could be using a completely different simulator for each choice of ρ and O, with \({{{{\mathcal{H}}}}}^{{\prime} }\) a space large enough to contain all of them and by encoding ρ into several copies. However, this would violate the size-independence requirement of Definition 1. if Ωobs and Ωstate both do not only contain O(1) elements. Furthermore, it is natural to consider analogue quantum simulators as machines taking quantum, rather than classical, input—possibly prepared by another experiment—which cannot be cloned. For this reason, we assume that the state encoding takes the form of a quantum channel \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}:D({{{\mathcal{H}}}})\to D({{{{\mathcal{H}}}}}^{{\prime} })\). Correspondingly, to accommodate for quantum outputs, we require the observable encoding \(O\mapsto {O}^{{\prime} }\) to be a unital and completely positive map \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}:{{{\rm{Herm}}}}({{{\mathcal{H}}}})\to {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\). This ensures that the Hilbert-Schmidt dual operator \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}^{*}\) is a quantum channel, so measurement of \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(O)\) on \({\rho }^{{\prime} }\) can equivalently be thought of as a measurement of O on a decoded state \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}^{*}(\rho )\). This perspective sets analogue quantum simulators apart from the framework of digital quantum computation, for which fault-tolerant architectures require both inputs and outputs to be classical.
This definition is still sufficiently versatile to capture the simulation of global observables that are a sum of local parts O = ∑kOk (a task, for example, useful for variational quantum algorithms47), in the following way. Often the Ok cannot be simultaneously measured due to non-commutativity relations or experimental limitations. The simplest approach to estimating O is to run many simulations, measuring one of the Ok each time (this process can be sped up by combining simultaneously measurable terms48), and summing the average results.
The above discussion leads us to the following definition, which is illustrated in Fig. 2.
Definition 5
(Analogue quantum simulation) Given a set of states Ωstate on a Hilbert space \({{{\mathcal{H}}}}\), a normalised set of observables Ωobs (i.e. ∥O∥ = 1 for all O ∈ Ωobs, where ∥ ⋅ ∥ denotes the operator norm), a time \({t}_{\max } > 0\), a Hamiltonian \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\), and ϵ > 0, we say that a family of quantum channels \({T}_{t}:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{{\mathcal{H}}}}}^{{\prime} })\), for \(t\in [0,{t}_{\max }]\) simulates H with respect to Ωstate and Ωobs with accuracy ϵ if there exists
-
1.
A state encoding quantum channel \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}:D({{{\mathcal{H}}}})\to D({{{\mathcal{H}}}}^{\prime} )\) which maps states to the simulator Hilbert space \({{{{\mathcal{H}}}}}^{{\prime} }\),
-
2.
An observable encoding, given by a unital and completely positive map \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}:\,{\mbox{Herm}}\,({{{\mathcal{H}}}})\to \,{\mbox{Herm}}\,({{{{\mathcal{H}}}}}^{{\prime} })\),
such that
for all ρ ∈ Ωstate, O ∈ Ωobs, and \(t\in [0,{t}_{\max }]\).
Our use of a Hamiltonian H for the target system is mostly for simplicity; the simulation of more general dynamics, of open quantum systems, for example, can be defined analogously, with the target Hamiltonian H replaced by any generator of a quantum dynamical semigroup28,29. It should be noted also that Definition 5 could equivalently have been phrased in terms of a set of POVMs rather than observables Ωobs. We use the latter for convenience in relating our work to other results. It is plausible that one could engineer a time-dependent observable observable encoding \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\), but here we restrict our focus to the time-independent case to avoid the complexity of the simulation task being hidden in this step.
By the triangle inequality, (3) holds for any convex combination of the states and observables in Ωstate and Ωobs respectively, so we could without loss of generality assume that the two sets are convex to begin with.
Often the simulation channels Tt in Definition 5 are taken simply as time evolution under some simulator Hamiltonian \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\), but it is useful to consider a more general case. Firstly, this allows one to directly account for, and possibly exploit, dissipative errors in the experimental setup49. Secondly, it enables the possibility of a more complicated simulation experiment, for example involving intermediate measurements. Moreover, it is important to allow the simulation of open quantum systems for our definition to be consistent with criterion III of Fig. 5. Despite the generality afforded by Definition 5, we emphasise that experimentally practical simulations should be size-independent as in Definition 1. That is, the implementation of Tt should not require engineering a system of size, which grows more than linearly in n, or boundlessly scaling interaction energies. Another important constraint is that Tt should not include the use of adaptive channels based on feed-forward measurements—hence distinguishing the process from digital quantum computation.
We note that Hamiltonian models of quantum computation such as quantum walks50 and previous notions of dynamical Hamiltonian simulation51 are not consistent with our definition of analogue simulation: such constructions also incur scalings in both the system size and in necessary evolution time (corresponding to scalings in interaction strength, if time is normalised) which violate the size-independence conditions of Definition 1.
Local encodings
Although Definition 5 is phrased in terms of general encoding maps, it is practically useful to ensure that states and observables are encoded in a way that is both practical to implement and behaves favourably with respect to noise. In this section, we present such a notion of local encodings and state some basic properties; proofs are contained in Supplementary Note 1. A similar discussion is presented for the stronger case of local Hamiltonian encodings by Cubitt et al.11, and a discussion of the stability of local observable measurements to local noise is given by Trivedi et al.27.
Definition 6
(Local state encoding) Let \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\) and \({{{{\mathcal{H}}}}}^{{\prime} }={\otimes }_{j=1}^{{n}^{{\prime} }}{{{{\mathcal{H}}}}}_{j}^{{\prime} }\). We say that a state encoding \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}:D({{{\mathcal{H}}}})\to D({{{{\mathcal{H}}}}}^{{\prime} })\) is local if it has a Stinespring representation of the form
where F = ⊗ kFk and E = ⊗ lEl are ancillary systems and \(U\in {{{\rm{U}}}}({{{\mathcal{H}}}}\otimes F,{{{{\mathcal{H}}}}}^{{\prime} }\otimes E)\) is a constant-depth quantum circuit.
It is immediate that constant-depth quantum circuits (built from one-qubit and two-qubit gates) preserve locality. That is, given a local operator A on \({{{\mathcal{H}}}}\otimes F\), the operator UAU† is local (acting on the forward light cone of the support of A) on \({{{{\mathcal{H}}}}}^{{\prime} }\otimes E\), and similarly for the inverse U†. In fact, it is known in the theory of quantum cellular automata that this constraint is equivalent to representability as a constant-depth quantum circuit52.
For simulating physical systems, one particularly desirable feature of a simulator is local error back-propagation. That is, local noise on the simulator system should correspond in some way to local (perhaps realistic) noise on the target system. Ideally, we would like to prove that for any state \(\rho \in D({{{\mathcal{H}}}})\) and local error channel \({{{{\mathcal{N}}}}}^{{\prime} }:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{{\mathcal{H}}}}}^{{\prime} })\) on the simulator, there exists a corresponding local error channel \({{{\mathcal{N}}}}:D({{{\mathcal{H}}}})\to D({{{\mathcal{H}}}})\) on the target system satisfying
However, we cannot hope to prove this in general, since the noise operator \({{{{\mathcal{N}}}}}^{{\prime} }\) may take the simulator system outside the image of \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\). Instead we have a slightly weaker version of this statement, which is a direct consequence of the causal structure of local state encodings.
Proposition 7
(Local error back-propogation) Let \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}:D({{{\mathcal{H}}}})\to D({{{{\mathcal{H}}}}}^{{\prime} })\) be a local state encoding as in Definition 6, and let \({{{{\mathcal{N}}}}}^{{\prime} }:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{{\mathcal{H}}}}}^{{\prime} })\) be a channel whose Kraus operators \(\{{X}_{k}^{{\prime} }\}\) each act on O(1) sites in \({{{{\mathcal{H}}}}}^{{\prime} }\). Then there exists a channel \({{{\mathcal{N}}}}:D({{{\mathcal{H}}}}\otimes F)\to D({{{\mathcal{H}}}}\otimes F)\) whose Kraus operators {Xk} each act on O(1) sites in \({{{\mathcal{H}}}}\otimes F\), and such that for all \(\rho \in {{{\mathcal{H}}}}\),
In other words, local noise on the simulator corresponds to local noise on the target system and ancillary encoding system. The corresponding result with locality replaced by geometric locality holds in the case when the light cones of U are local with respect to the underlying geometry of the simulator and target systems.
Similarly, we have local forward-propogation under such an encoding, in the sense that local operations on a site \({{{{\mathcal{H}}}}}_{i}\) to \(\rho \in D({{{\mathcal{H}}}})\) will not affect the reduced density matrix \({{{{\rm{tr}}}}}_{A}[{{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}(\rho )]\), where A is the forward light cone of \({{{{\mathcal{H}}}}}_{i}\) under U in \({{{{\mathcal{H}}}}}^{{\prime} }\).
We define local observable encodings analogously to the state encoding case.
Definition 8
(Local observable encoding) Let \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\) and \({{{{\mathcal{H}}}}}^{{\prime} }={\otimes }_{j=1}^{{n}^{{\prime} }}{{{{\mathcal{H}}}}}_{j}^{{\prime} }\). We say that an observable encoding \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}:{{{\rm{Herm}}}}({{{\mathcal{H}}}})\to {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\) is local if it is the adjoint (with respect to the Hilbert-Schmidt inner product) of a local state encoding.
It is immediate from this definition that one can measure the encoded observable \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(O)\) by first applying the constant-depth quantum circuit \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}^{*}:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{\mathcal{H}}}})\) to \({\rho }^{{\prime} }\in D({{{{\mathcal{H}}}}}^{{\prime} })\), and then measuring O. When O is local, we can alternatively implement the measurement via a local POVM directly on the simulator system.
Proposition 9
(Encoded measurements) Let \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\) be a local observable encoding as in Definition 8, and let O be a local operator on \({{{\mathcal{H}}}}\). Then \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}(O)\) can be measured using a local POVM on \({{{{\mathcal{H}}}}}^{{\prime} }\).
Applications of the framework
In this section, we discuss some basic applications of our notion of analogue quantum simulation in the sense we have introduced in Definition 5. Firstly, we give an example of a trivial but illustrative situation in which encoding qudits into qubits incurs an unavoidable cost for low-energy encodings, but which is not an issue in our framework. We then demonstrate the robustness of the definition under noise, and show that it is consistent with the existing notion of simulation given in Definition 4. Finally, we note how Lieb-Robinson bounds can be used to reduce the overhead of simulating local observables.
Qudits to qubits
To motivate this example, we first notice that the requirement of Cubitt et al.11 (Definition 4) that the simulator Hamiltonian should reproduce the target dynamics in its low-energy subspace is too strong for some practical situations. As observed by the authors, this can require the simulator to use strong interactions to push unwanted states out of the low-energy subspace. Proposition 10 provides a formal statement of this fact (proved in Supplementary Note 2) in the context of encoding a simple qutrit Hamiltonian into qubits.
Here we consider qutrits with individual state spaces \({{\mathbb{C}}}^{3}\) spanned by a basis \(\{\left\vert \downarrow \right\rangle,\left\vert 0\right\rangle,\left\vert \uparrow \right\rangle \}\). We write \({P}_{0}^{(j)}=\left\vert 0\right\rangle \left\langle 0\right\vert\) and \({P}_{\uparrow }^{(j)}=\left\vert \uparrow \right\rangle \left\langle \uparrow \right\vert\), where the superscript indicates that the projectors act on the jth qutrit.
Proposition 10
Let \({{{\mathcal{H}}}}={({{\mathbb{C}}}^{3})}^{\otimes n}\) be the space of n qutrits acted on by the Hamiltonian
Suppose \({H}_{n}^{{\prime} }={\sum }_{j=1}^{K}{h}_{j}^{{\prime} }\) is a k-local Hamiltonian on \({{{{\mathcal{H}}}}}^{{\prime} }={({{\mathbb{C}}}^{2})}^{\otimes m}\), where m = O(n1+α), for α ≥ 0 and k = O(1). Assume the interaction hypergraph of \({H}_{n}^{{\prime} }\) has degree bounded by d = O(1).
If \({H}_{n}^{{\prime} }\) is a (Δ, η, ϵ)-simulation for Hn in the sense of Definition 4, for η ∈ [0, 1) and ϵ ≥ 0, then
From (8) we see that simulating this simple system with a low-energy encoding, an interaction hypergraph of bounded degree, and bounded locality, requires either the qubit count or interaction energy (or a mixture) to scale unfeasibly with n. This constitutes a violation of the requirements of Definition 1. and imposes an unnecessary experimental requirement for the task of simulating non-interacting qutrits. The proof of this fact follows from a dimension-counting argument, since the state space of the qutrits cannot be surjectively encoded into the qubit simulator, see Fig. 1. In contrast, the simulation task is trivial in our framework given in Definition 5 because the low-energy encoding requirement is relaxed.
Letting \({H}_{n}={\sum }_{j=1}^{n}({P}_{0}^{(j)}+{P}_{\uparrow }^{(j)})\) as in Proposition 10, we can simulate all observables under Hn on \({{{{\mathcal{H}}}}}^{{\prime} }={\otimes }_{j=1}^{n}({{\mathbb{C}}}^{2}\otimes {{\mathbb{C}}}^{2})\) via any isometry
encoding each qutrit into two qubits. To realise a simulator in the sense of Definition 5, we let
and
which is just time evolution under a 2-local Hamiltonian with bounded-strength interactions.
Although Proposition 10 does not necessarily rule out simulations in which the n qutrits are encoded into Ω(n2) qubits, such approaches suffer from a different problem. Generally, if each qudit in a D-dimensional system is encoded into Ω(nα) qudits for α > 0, whilst keeping the dimension fixed, then the inflated system size will necessarily cause the distances between encoded sites to grow with n. In a system of interacting qutrits (for which the proof of Proposition 10 still holds), this means that scaling interactions can be necessary to overcome Lieb-Robinson bounds and ensure that correlations can spread sufficiently fast through the enlarged system. The following simple geometric lemma provides some intuition for a quantitative lower bound on the growing length scales in such situations.
Lemma 11
Let \({\{{x}_{i}\}}_{i=1}^{n}\) be the points in a hypercube of side length L ~ n1/D in the square lattice \({x}_{i}\in {{\mathbb{Z}}}^{D}\). Let \({{{\mathcal{E}}}}:{x}_{i}\mapsto {X}_{i}\subseteq {{\mathbb{Z}}}^{D}\) be a map which encodes each point xi into a connected set of points in \({{\mathbb{Z}}}^{D}\) such that ∣Xi∣ = Ω(nα) and \({X}_{i}\cap {X}_{j}={{\emptyset}}\). Let \(d(x,y):{{\mathbb{Z}}}^{D}\times {{\mathbb{Z}}}^{D}\to {\mathbb{Z}}\) be the taxicab metric on \({{\mathbb{Z}}}^{D}\).
For a radius R = O(L), and any \(y\in {{\mathbb{Z}}}^{D}\), the number of encoded points intersecting with the ball of radius R centred at y is bounded by
Letting \(\lambda=\min \{\alpha,\, 1/D\}\), we see that there are at most O(n1−λ) sites Xj within radius R = O(L) = O(n1/D) of any Xi. On the other hand, there are at least Ω(n1−λ) of the xj within radius O(n(1−λ)/D) of xi in the original lattice. In particular, this implies that there exist a pair of sites xi, xj with d(xi, xj) = O(n(1−λ)/D) whose encodings have d(Xi, Xj) = Ω(n1/D)—in the encoded system, the distance is increased by a factor of nλ/D.
The scalings here apply as a result of the requirement that analogue quantum simulators reproduce the dynamics of a target system. In other situations, such as adiabatic quantum simulation in which an approximately simulated ground state is the only requirement, encodings with superlinear qubit overhead are possible53,54.
Noisy analogue simulators
Suppose we have quantum channels Tt, for \(t\in [0,\, {t}_{\max }]\) which simulate some \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) with respect to Ωstate and Ωobs up to accuracy ϵ as in Definition 5, corresponding to encoding maps \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\).
In practice, the experimental setup will suffer from noise in the steps of state preparation, evolution, and measurement. This will correspond to noisy versions of the above maps, which we denote by \({\tilde{T}}_{t}\), \({\tilde{{{{\mathcal{E}}}}}}_{{{{\rm{state}}}}}\), and \({\tilde{{{{\mathcal{E}}}}}}_{{{{\rm{obs}}}}}\). For any O ∈ Ωobs, ρ ∈ Ωstate, we may bound the additional error in observable expectation values incurred by the noisy maps by
where ∥⋅∥1→1 denotes the one-to-one norm \(\parallel \Lambda {\parallel }_{1\to 1}=\mathop{\sup }_{\rho }\parallel \Lambda (\rho ){\parallel }_{1}\) (defined as the induced trace norm55—note that this is in particular upper bounded by the diamond norm), and \({{{{\mathcal{E}}}}}^{*}\) denotes the Hilbert-Schmidt dual of a superoperator \({{{\mathcal{E}}}}\). Hence the noisy simulator \({\tilde{T}}_{t}\) also simulates H with respect to Ωstate and Ωobs, up to error
Local Hamiltonian simulation in a subspace
Suppose that \({H}^{{\prime} }\) is a (Δ, η, ϵ)-simulation of H as defined by Cubitt et al.11 (Definition 4), corresponding to encodings \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\), with the projector Q = 0. Here we show that the time evolution channel under \({H}^{{\prime} }\), \((\cdot )\mapsto {e}^{-it{H}^{{\prime} }}(\cdot ){e}^{it{H}^{{\prime} }}\) gives a simulation in our sense, Definition 5.
We make use of the following lemmas. Lemma 12 ensures that measurement and time evolution are consistent with the encodings of Definition 4, and Lemma 13 bounds the error of (Δ, η, ϵ)-simulations under time evolution.
Lemma 12
(Cubitt et al., Proposition 411) If \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\) are encodings as in Definition 4 and (2), then for all observables O and states ρ on the target system \({{{\mathcal{H}}}}\),
Moreover if the encoding is standard (rank(P) > 0 in Definition 4) then
Lemma 13
(Cubitt et al., Proposition 2811) Let \({H}^{{\prime} }\) be a (Δ, η, ϵ)-simulation of H in the sense of Definition 4 corresponding to encodings \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\), \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\). If \({\rho }^{{\prime} }\) is a state in the simulator system \({{{{\mathcal{H}}}}}^{{\prime} }\) satisfying \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}({{{\rm{I}}}}){\rho }^{{\prime} }={\rho }^{{\prime} }\), then for all t
Combining these lemmas, we see that for any observable O and state ρ on \({{{\mathcal{H}}}}\),
Hence the channels \({T}_{t}:{\rho }^{{\prime} }\mapsto {e}^{-i{H}^{{\prime} }t}{\rho }^{{\prime} }{e}^{i{H}^{{\prime} }t}\), for \(t\in [0,{t}_{\max }]\) simulate H in the sense of Definition 5 with respect to any Ωstate and Ωobs, up to error
This provides some consistency between existing work and our notion of simulation; we have shown that evolution under a simulator Hamiltonian in the sense of Cubitt et al.11 constitutes an analogue quantum simulator in our framework given by Definition 5.
Short-time simulation with Lieb-Robinson bounds
One advantage of only requiring the simulation of a particular set of observables Ωobs in Definition 5, as opposed to reproducing the entire physical system, is that one can take advantage of the limited spread of correlations for short-time dynamics24. The idea of exploiting Lieb-Robinson bounds to reduce necessary hardware overhead has already been considered for the study of many-body quantum states on quantum computers25,26, and more recently in the setting of analogue simulators27. We explain here how the latter fits into our framework.
Consider the case of a Hamiltonian Hn on a d-dimensional lattice of n qubits \({{{\mathcal{H}}}}\cong {({{\mathbb{C}}}^{2})}^{\otimes n}\), such that
where the hx is a nearest-neighbour local interaction with ∥hx∥ ≤ 1, translated to position x in the lattice, so that Hn is translationally invariant.
If one is only interested in simulating the finite-time dynamics of a few local observables Ωobs which are contained within a small neighbourhood of the origin, starting from a state \(\rho=\left\vert 0\right\rangle {\left\langle 0\right\vert }^{\otimes n}\), then it is sufficient (up to exponentially small error) to simulate a far smaller subsystem, corresponding to the Lieb-Robinson light cone, as in Fig. 7. This situation is studied by Trivedi et al.27, in particular for the thermodynamic limit n → ∞.
Let \({H}_{m}={\sum }_{y=1}^{m}{h}_{y}\) be the simulator Hamiltonian, defined identically to Hn but on a lattice of size m < n, \({{{{\mathcal{H}}}}}^{{\prime} }\cong {({{\mathbb{C}}}^{2})}^{\otimes m}\). We encode ρ and O simply by restricting them to the smaller subsystem. Then a simulation of an observable O ∈ Ωobs up to accuracy ϵ, satisfying
can be accomplished in the large-n regime for all \(t\in [0,{t}_{\max }]\) if one takes \(m=O\left({\log }^{d}(1/\epsilon )+{t}_{\max }^{d}\right)\) (see Trivedi et al.27, Lemma 1).
Modular encodings and gadgets
In this section, we focus on the case of a simulator channel Tt given by time evolution under a local simulator Hamiltonian \({H}^{{\prime} }\), which should reproduce the dynamics of the local target Hamiltonian H = ∑iHi. In light of the size-independence requirement of Definition 1., it is natural to encode each Hi term separately into some term \({H}_{i}^{{\prime} }\), but systematically doing so is a non-trivial task: we need the encoded terms to interact with each other in a way that mimics the original system.
This problem can be tackled using perturbative gadgets. Perturbative gadgets were initially introduced by Kempe et al.42 as a means of proving QMA-completeness of the 2-local Hamiltonian problem by reduction from the three-local case30, and have since been used extensively in the field of Hamiltonian complexity theory. In this work, we especially focus on the use of gadgets for Hamiltonian locality reduction, though it should be noted that perturbative gadgets can also be used to simplify the structure of the interaction hypergraph17 and, in general, to reduce Hamiltonians to more restrictive families of interactions44,56,57. Moreover, beyond Hamiltonian complexity-theoretic results, gadgets can be tailored to improve the performance of variational quantum algorithms34.
In this work, we introduce a formalism which we argue encompasses any attempt at gadgetisation, in a sense which we make precise Definition (14), in order to prove general properties of such constructions. Note that our approach, and the (η, ϵ) accuracy parameters, are closely related to those used in other definitions of simulation11,18. We refine the approach of the latter by generalising to a potentially non-perturbative regime and by considering the feature of combining well with other interactions as a generic requirement for gadgets. We use these results to argue that any size-independent encoding of a Hamiltonian H into another \({H}^{{\prime} }\) cannot reduce the locality of interactions (for example, reducing a 3-local Hamiltonian to a 2-local Hamiltonian).
The setup is as follows: we consider a large system \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\), within which a local interaction \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) acts on a subsystem of O(1) sites. With the introduction of a small ancillary system \({{{\mathcal{A}}}}\), we aim to replace H by some gadget \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), which acts on O(1) sites in \({{{\mathcal{H}}}}\) and \({{{\mathcal{A}}}}\).
A simulator Hamiltonian in the sense of Definition 5 need not necessarily capture the entire spectrum of its target Hamiltonian. In this case, however, we are thinking of H as a single interaction in a larger system, and as such we cannot generally assume that its eigenspaces will be preserved under time evolution. Therefore, we require as a minimum that \({H}^{{\prime} }\) should (when restricted to some subspace defined by a projector \({P}^{{\prime} }\)) approximately reproduce the full spectrum of H. Moreover, for \({H}^{{\prime} }\) to be a useful gadget, it must combine well with other Hamiltonian terms acting on \({{{\mathcal{H}}}}\). That is to say, there should exist \({P}^{{\prime} }\in {{{\rm{Proj}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) such that \({P}^{{\prime} }({H}^{{\prime} }+{H}_{{{{\rm{else}}}}}\otimes {{{\rm{I}}}}){P}^{{\prime} }\) approximates the spectrum of H + Helse, for any \({H}_{{{{\rm{else}}}}}\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) (see Fig. 3a). We formalise this with the following definition.
Definition 14
((ζ, ϵ)-gadget property) Given a Hamiltonian \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) acting on a system \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\), and \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) for \({{{\mathcal{A}}}}\) an ancillary system, we say that \(({H}^{{\prime} },\, {{{\mathcal{A}}}})\) satisfies the (ζ, ϵ)-gadget property for H if there exists \({P}^{{\prime} }\in {{{\rm{Proj}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), \(\tilde{P}\in {{{\rm{Proj}}}}({{{\mathcal{A}}}})\setminus \{0\}\) such that, for any \({H}_{{{{\rm{else}}}}}\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\), there exists a unitary \({\tilde{U}}_{{H}_{{{{\rm{else}}}}}}\in {{{\rm{U}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) with
In other words, \(({H}^{{\prime} },{{{\mathcal{A}}}})\) satisfies the (ζ, ϵ)-gadget property for H if, when restricted a subspace defined by \({P}^{{\prime} }\), \({H}^{{\prime} }+{H}_{{{{\rm{else}}}}}\otimes {{{\rm{I}}}}\) approximates the spectrum of H + Helse up to error ϵ + ζ∥Helse∥. Notice that \(\tilde{P}\) is almost arbitrary; its rank determines the multiplicity of each eigenvalue of H + Helse in the simulator system, but otherwise it can be rotated by \({\tilde{U}}_{{H}_{{{{\rm{else}}}}}}\), which rotates the eigenvectors of \((H+{H}_{{{{\rm{else}}}}})\otimes \tilde{P}\) approximately onto those of \({P}^{{\prime} }({H}^{{\prime} }+{H}_{{{{\rm{else}}}}}\otimes {{{\rm{I}}}}){P}^{{\prime} }\).
As noted by Cubitt et al.11, there are two distinct types of gadgets used in literature:
-
Mediator gadgets, in which ancillary qubits are inserted between logical qubits to mediate interactions, and
-
Subspace gadgets, in which single logical qubits are encoded into several physical qubits, restricted to a two-dimensional subspace by strong interactions.
Definition 14 encompasses the former, but not the latter. Qualitatively this is because whereas mediator gadgets replace interactions, subspace gadgets replace entire qubits, including all of the interactions they take part in. It would be possible to extend our formalism to subspace gadgets, by restricting the range of Helse in Definition 14 to terms, which do not interact with the target qubit. We do not consider this here, however, for brevity and because subspace gadgets do not reduce the locality of interactions, which is our primary motivation for this section.
Although Definition 14 is a natural requirement, it is not convenient to work with due to the appearance of the general Helse acting on the entire of \({{{\mathcal{H}}}}\), upon which \(\tilde{U}\) depends. The following alternative definition does not suffer from this problem.
Definition 15
((η, ϵ)-gadget) Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) be a Hamiltonian on a Hilbert space \({{{\mathcal{H}}}}\), and let \({{{\mathcal{A}}}}\) be an ancillary Hilbert space. For \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), we say that \(({H}^{{\prime} },{{{\mathcal{A}}}})\) is a (η, ϵ)-gadget for H if there exists \(P\in {{{\rm{Proj}}}}({{{\mathcal{A}}}})\setminus \{0\}\) and \(U\in {{{\rm{U}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) such that
where \({P}^{{\prime} }=U({{{\rm{I}}}}\otimes P){U}^{{{\dagger}} }\in {{{\rm{Proj}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\).
The advantage of Definition 15 is that it is stated in terms of a local rather than global property. Assuming that \(H,{H}^{{\prime} },{P}^{{\prime} }\) act on only O(1) sites in \({{{\mathcal{H}}}}\) and \({{{\mathcal{A}}}}\), we can without loss of generality restrict to this significantly smaller subspace to check whether \({H}^{{\prime} }\) is a gadget. This is in contrast with Definition 14, which requires us to in principle consider interactions over the full n-site space in order to check the gadget property.
To motivate the use of Definition 15, we show that the above notions are in correspondence; things that look like gadgets are always gadgets, and vice-versa. This is formalised by the following two theorems, proved in Supplementary Note 3.
Theorem 16
((η, ϵ)-gadgets have the (ζ, ϵ)-gadget property) Suppose that \(({H}^{{\prime} },\, {{{\mathcal{A}}}})\) is a (η, ϵ)-gadget for H. Then \(({H}^{{\prime} },\, {{{\mathcal{A}}}})\) satisfies the (ζ, ϵ)-gadget property for H, where ζ = O(η).
Theorem 17
(The (ζ, ϵ)-gadget property requires a (η, ϵ)-gadget) Suppose that \(({H}^{{\prime} },{{{\mathcal{A}}}})\) satisfies the (ζ, ϵ)-gadget property for H, where H, \({H}^{{\prime} }\), and \({P}^{{\prime} }\) act on O(1) sites in \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\). Then \(({H}^{{\prime} },\, {{{\mathcal{A}}}})\) is a \((\eta,{\epsilon }^{{\prime} })\)-gadget for H, where \(\eta=O(\epsilon )+O({\zeta }^{\frac{1}{2}})\) and \({\epsilon }^{{\prime} }=O(\epsilon )+O(\zeta )\).
The roles of the η and ϵ parameters are to bound the error in the eigenvectors and eigenvalues respectively. Roughly speaking, η quantifies how well the gadget combines with other terms, and ϵ quantifies the spectral error of the gadget in isolation. A good gadget requires both of these parameters to be small. In the next section we present a 3-to-2 local gadget which is an extreme case of this, with ϵ = 0 at the cost of a large η error.
Prior work in Hamiltonian complexity theory has focused on gadgetisation in the context of ground state estimation18,30,44 or simulation in a low-energy subspace11; as a result, a case of particular relevance is when \({P}^{{\prime} }\) projects onto the low-energy subspace of \({H}^{{\prime} }\). For \(\Delta \in {\mathbb{R}}\), we write \({P}_{\le \Delta ({H}^{{\prime} })}\) for the projector onto the span of the eigenvectors of \({H}^{{\prime} }\) with eigenvalues in the range ( − ∞, Δ].
Definition 18
((Δ, η, ϵ)-gadget) Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) be a Hamiltonian on a Hilbert space \({{{\mathcal{H}}}}\), and let \({{{\mathcal{A}}}}\) be an ancillary Hilbert space. For \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), we say that \(({H}^{{\prime} },{{{\mathcal{A}}}})\) is a (Δ, η, ϵ)-gadget for H if there exists \(P\in {{{\rm{Proj}}}}({{{\mathcal{A}}}})\setminus \{0\}\), and \(U\in {{{\rm{U}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) such that \({P}_{\le \Delta ({H}^{{\prime} })}=U({{{\rm{I}}}}\otimes P){U}^{{{\dagger}} }\), and
In other words, the pair \(({H}^{{\prime} },{{{\mathcal{A}}}})\) satisfy Definition 15, in the special case where we can use \({P}^{{\prime} }={P}_{\le \Delta ({H}^{{\prime} })}\).
Notice that Definition 18 imposes a significantly stronger requirement on \({H}^{{\prime} }\) than Definition 15; a priori there is no reason to expect that there will exist any choice of P and U such that \({P}_{\le \Delta ({H}^{{\prime} })}=U({{{\rm{I}}}}\otimes P){U}^{{{\dagger}} }\). Definitions Definition 15 and Definition 18 are sufficient to guarantee desirable combination properties, and are satisfied by widely-used constructions.
Examples of gadgets
Lemmas 4–7 of Bravyi et al.18 can be naturally adapted to give several constructions for (Δ, η, ϵ) gadgets, which we use to demonstrate that Definition 15 encompasses commonly-used techniques. In the following we take \({{{{\mathcal{H}}}}}^{{\prime} }={{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}}\), and \({{{\mathcal{A}}}}\cong {{\mathbb{C}}}^{2}\). For V an operator on \({{{{\mathcal{H}}}}}^{{\prime} }\) we write it in block-diagonal form with respect to the basis of \({{{\mathcal{A}}}}\) as
where, for instance, \({V}_{00}=({{{\rm{I}}}}\otimes \left\langle 0\right\vert )V({{{\rm{I}}}}\otimes \left\vert 0\right\rangle )\).
Lemma 19
(First-order gadgets, adapted from Bravyi et al.18) Suppose \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) and \(V\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\) are such that
Then \({H}^{{\prime} }=\Delta {H}_{0}+V\) defines a (O(Δ), η, ϵ)-gadget for H, where \({H}_{0}={{{\rm{I}}}}\otimes \left\vert 1\right\rangle \left\langle 1\right\vert\), provided that Δ ≥ O(ϵ−1∥V∥2 + η−1∥V∥).
Lemma 20
(Second-order gadgets, adapted from Bravyi et al.18) Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\), and suppose \({V}^{(1)},{V}^{(0)}\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\) are such that ∥V(1)∥, ∥V(0)∥ ≤ Λ, \({V}_{10}^{(0)}={V}_{01}^{(0)}={V}_{00}^{(1)}=0\), and
Then \({H}^{{\prime} }=\Delta {H}_{0}+{\Delta }^{\frac{1}{2}}{V}^{(1)}+{V}^{(0)}\) is a (O(Δ), η, ϵ)-gadget for H, where \({H}_{0}={{{\rm{I}}}}\otimes \left\vert 1\right\rangle \left\langle 1\right\vert\), if
Lemma 21
(Third-order gadgets, adapted from Bravyi et al.18) Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\), and suppose \({V}^{(2)},{V}^{(1)},{V}^{(0)}\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\) are such that ∥V(2)∥, ∥V(1)∥, ∥V(0)∥ ≤ Λ, \({V}_{10}^{(1)}={V}_{01}^{(1)}={V}_{10}^{(0)}={V}_{01}^{(0)}=0\), \({V}_{00}^{(2)}=0\),
Then \({H}^{{\prime} }=\Delta {H}_{0}+{\Delta }^{\frac{2}{3}}{V}^{(2)}+{\Delta }^{\frac{1}{3}}{V}^{(1)}+{V}^{(0)}\) is a (O(Δ), η, ϵ)-gadget for H, where \({H}_{0}={{{\rm{I}}}}\otimes \left\vert 1\right\rangle \left\langle 1\right\vert\), if
We illustrate the application of these lemmas to our definition with the following ubiquitous gadgets from Oliviera et al.17:
Given a target Hamiltonian \(H=A\otimes B\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B})\), the subdivision gadget on \({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B}\otimes {{{{\mathcal{H}}}}}_{C}\) (where \({{{{\mathcal{H}}}}}_{C}\cong {{\mathbb{C}}}^{2}\)) is defined by
where
Then by Lemma 20 we see that, for sufficiently large Δ, \(({H}^{{\prime} },{{{{\mathcal{H}}}}}_{C})\) defines a (O(Δ), η, ϵ)-gadget for H (see Fig. 8a).
Given a target Hamiltonian \(H=A\otimes B\otimes C\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B}\otimes {{{{\mathcal{H}}}}}_{C})\), the 3-to-2 local gadget on \({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B}\otimes {{{{\mathcal{H}}}}}_{C}\otimes {{{{\mathcal{H}}}}}_{D}\) (where \({{{{\mathcal{H}}}}}_{D}\cong {{\mathbb{C}}}^{2}\)) is defined by
where
By Lemma 20 we see that, for sufficiently large Δ, \(({H}^{{\prime} },{{{{\mathcal{H}}}}}_{D})\) defines a (O(Δ), η, ϵ)-gadget for H (see Fig. 8b).
We provide the following example to illustrate the importance of the η parameter as a quantifier of how well a gadget combines with other terms.
Let \(H=A\otimes B\otimes C\in {{{\rm{Herm}}}}({({{\mathbb{C}}}^{2})}^{\otimes 3})\) be a 3-qubit interaction, and diagonalise A, B, and C as
Let \({H}^{{\prime} }\in {{{\rm{Herm}}}}({({{\mathbb{C}}}^{2})}^{\otimes 4})\) be defined as
and let \({P}^{{\prime} }\in {{{\rm{Proj}}}}({({{\mathbb{C}}}^{2})}^{\otimes 4})\) be
Then in fact the restriction of \({H}^{{\prime} }\) to the image of \({P}^{{\prime} }\) exactly reproduces the spectrum of H. This hence defines a 3-to-2 (η, 0)-gadget—or a (Δ, η, 0)-gadget, if one adds a term of the form \(O(\Delta )({{{\rm{I}}}}-{P}^{{\prime} })\) to \({H}^{{\prime} }\). The caveat is that this gadget has a large η parameter, and hence it does not combine well with other interactions. For instance, in Definition 15 we might take \(P=\left\vert 0\right\rangle \left\langle 0\right\vert \otimes {{{\rm{I}}}}\otimes {{{\rm{I}}}}\otimes {{{\rm{I}}}}\), and \(U=({\mathbb{F}}\otimes \left\vert 0\right\rangle \left\langle 0\right\vert+{{{\rm{I}}}}\otimes {{{\rm{I}}}}\otimes \left\vert 1\right\rangle \left\langle 1\right\vert )\otimes {{{\rm{I}}}}\), where \({\mathbb{F}}\) is the two-qubit swapping operator. This gives η = 2.
The construction of \({H}^{{\prime} }\) can be thought of as splitting the A qubit into two qubits (see Fig. 9), and controlling whether the first or second qubit is excited depending on the value of the B qubit. Therefore, if the full Hamiltonian contains another interaction term that acts on the A site in H, then the locality of this term will be increased under the gadgetisation procedure. Such a gadget cannot be used to systematically reduce the locality of a Hamiltonian with many interactions.
The (blue) 3-local interaction between A, B, and C is replaced by a series of (blue) 2-local interactions, where the A site has been split into two sites A1 and A2. However, after this process, the 2-local interaction (red) between A and another qubit E is replaced by two 3-local interactions between E, A1, B and E, A2, B. Compare this with Fig. 8b, for which additional interactions on qubit A will remain on qubit A of the gadgetised Hamiltonian without any need for adjustment.
Gadget combination results
The following results show that gadgets satisfying Definition 15 or Definition 18 can be systematically combined as desired. Our techniques and proofs extend prior work17,31,58, using the convenient formalism of the direct rotation59. The scalings of the parameters \({\eta }^{{\prime} },{\epsilon }^{{\prime} }\) are not necessarily optimal, though they sufficient for application to the subdivision and 3-to-2 gadget constructions exhibited above. The proofs of our gadget combination results can be found in Supplementary Note 4.
We summarise the setup below, which will be used throughout the following results.
Setup 22
Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) be a Hamiltonian on n sites, \({{{\mathcal{H}}}}={\otimes }_{i=1}^{n}{{{{\mathcal{H}}}}}_{i}\). Assume \(H={\sum }_{i=1}^{N}{H}_{i}\), where N = O(n), such that each Hi acts on at most k = O(1) of the sites \({{{{\mathcal{H}}}}}_{i}\), and each site participates in at most d = O(1) interactions. Assume also that H has bounded interaction strengths, that is, ∥Hi∥ ≤ J for all i.
In the below propositions we consider a family (depending on n) of gadgets \(({H}_{i}^{{\prime} },{{{{\mathcal{A}}}}}_{i})\) for Hi, with Ui, Pi, and \({P}_{i}^{{\prime} }\) defined as in Definition 15, for each i. Assume that \({{{{\mathcal{A}}}}}_{i}\) consists of O(1) ancillary sites and that \({H}_{i}^{{\prime} }\) is a local Hamiltonian consisting of O(1) interactions, such that
Firstly, we state the main result: that gadgets as in Definition 15 may be systematically combined to produce new gadgets.
Proposition 23
(Parallel (η, ϵ)-gadget combination) Let H = ∑i Hi be as in Setup 22, and suppose that each \(({H}_{i}^{{\prime} },{{{{\mathcal{A}}}}}_{i})\) defines a (η, ϵ)-gadget for Hi.
Define
Then \(({H}^{{\prime} },{\otimes }_{i}{{{{\mathcal{A}}}}}_{i})\) is a \(({\eta }^{{\prime} },{\epsilon }^{{\prime} })\)-gadget for H, where
For completeness, we also prove a similar result that (Δ, η, ϵ)-gadgets can be combined to create a new \(({\Delta }^{{\prime} },{\eta }^{{\prime} },{\epsilon }^{{\prime} })\)-gadget. It follows from Proposition 23 that the combination of many (Δ, η, ϵ)-gadgets defines a \(({\eta }^{{\prime} },{\epsilon }^{{\prime} })\)-gadget, however it still remains to show that the projector \({P}^{{\prime} }\) in the sense of Definition 15 may be taken as a low-energy projector \({P}_{\le {\Delta }^{{\prime} }({H}^{{\prime} })}\).
Proposition 24
(Parallel (Δ, η, ϵ)-gadget combination) Let H = ∑i Hi be as in Setup 22„ and suppose that each \(({H}_{i}^{{\prime} },{{{{\mathcal{A}}}}}_{i})\) defines a (Δ, η, ϵ)-gadget for Hi, where
and assume that the scaling of η with n is bounded as
and moreover that, for large \({J}^{{\prime} }\),
Define
Then \(({H}^{{\prime} },{\otimes }_{i}{{{{\mathcal{A}}}}}_{i})\) is a \(({\Delta }^{{\prime} },{\eta }^{{\prime} },{\epsilon }^{{\prime} })\)-gadget for H, where
For an example of how these conditions can be satisfied, consider the case of combining many of the 3-to-2 gadgets described above. Setting J = 1 for convenience, we have \({J}^{{\prime} }=\Theta (\Delta )\), \({J}_{O}^{{\prime} }=\Theta ({\Delta }^{2/3})\), and ϵ, η = O(Δ−1/3). The errors \({\epsilon }^{{\prime} }\) and \({\eta }^{{\prime} }\) both grow as O(nΔ−1/3), so a good gadget will require Δ = Ω(n3). A direct computation verifies that this condition also ensures that ((46)–(48)) are satisfied. Hence reduction from a 3-local to 2-local Hamiltonian in this way requires interaction strengths to scale as n3.
To combine (Δ, η, ϵ) gadgets using Proposition 24 requires the unappealing conditions of (46)–(47), which explicitly require the gadget energies to scale with n. In fact, as noted by Bravyi et al.31, the regime of bounded-strength interactions does still allow approximation of the ground state energy of H—the caveat being that the errors are extensive. Below is a generalisation of their main result.
Theorem 25
(Ground state energy estimation with (Δ, η, ϵ)-gadgets, generalising Bravyi et al., Theorem 131) Let H = ∑iHi be as in Setup 22, and suppose that each \(({H}_{i}^{{\prime} },{{{{\mathcal{A}}}}}_{i})\) defines a (Δ, η, ϵ)-gadget for Hi.
Define
Then the ground state energies of H and \({H}^{{\prime} }\) satisfy
Gadget energy scaling
Here we present the main result of the section: general locality reduction gadgets cannot exist without unfavourably scaling energies. This result holds in the most general setting of (η, ϵ)-gadgets (Definition 15), and hence follows even from the relaxed (ζ, ϵ)-gadget property of Definition 14.
Theorem 26
(Gadget energy scaling) Let \({{{\mathcal{H}}}}={({{\mathbb{C}}}^{2})}^{\otimes k}\) be the space of k = O(1) qubits, and let H be the k-fold tensor product of Pauli Z operators with strength J > 0,
Suppose \(({H}^{{\prime} },\, {{{\mathcal{A}}}})\) is a (η, ϵ)-gadget for H for \({H}^{{\prime} }\) a \({k}^{{\prime} }\)-local Hamiltonian, where \({k}^{{\prime} } < \, k\).
Then, provided ϵ < J, the gadget must have energy scale \(\parallel {H}^{{\prime} }\parallel \ge \frac{J-\epsilon }{\eta }=\Omega ({\eta }^{-1})\).
The method of proof (found in Supplementary Note 5) is simple, and very likely does not provide an optimal lower bound for \(\parallel {H}^{{\prime} }\parallel\), due to the lack of any dependence on k. We expect that such dependence should be present; any approach which iteratively lowers the locality of an interaction from k-local to 2-local will accumulate scalings from each round of gadgetisation, but this does not rule out a more direct approach. Existing methods to reduce locality, such as the subdivision and 3-to-2 gadgets of Oliviera et al.17 and higher-order gadgets34,60, give scalings that suggest that any k-to-2-local gadget construction should require energies which scale exponentially in k. The question of whether such exponential scaling is the best possible was first raised by Bravyi et al.31, and is still unresolved. Using the formalism introduced here, this problem can be precisely stated, and optimisation of Theorem 26 may provide a negative result. Furthermore, we expect that it may be possible to answer similar questions about gadget energy scaling in other cases, for example in simplifying the structure of an interaction graph or reducing to smaller families of interactions.
The significance of Theorem 26 is that it essentially rules out a size-independent (Definition 1.) simulation of a k-local Hamiltonian H by another \({k}^{{\prime} }\)-local Hamiltonian \({H}^{{\prime} }\) for \({k}^{{\prime} } < \, k\), for the following reason. Any modular encodings require the use of term-by-term gadgets, which must each satisfy the (ζ, ϵ)-gadget property (Definition 14) with ζ, η = O(n−1) to guarantee that they can be combined (since the rest of the Hamiltonian will have ∥Helse∥ = O(n)). By Theorem 17, this requires the use of (η, ϵ)-gadgets (Definition 15) with η = O(n−1/2), and by Theorem 26 this will require interactions which scale at least as Ω(n1/2).
A couple of notes on gadget energy scalings in existing work: Bausch61 gives a method to reduce the exponential or doubly-exponential scaling in perturbative Hamiltonians to polynomial scaling, and Cao et al.33 present gadgets whose interaction strengths do not grow with accuracy. However, both cases violate size-independence (Definition 1.) in other ways such as polynomial scaling in the number of simulator qubits or instead shrinking the interaction strengths.
Gadgets from the quantum Zeno effect
In this section, we demonstrate an alternative approach for reducing the locality of an interaction in a Hamiltonian—a task for which Theorem 26 establishes the need for energies which scale with the size of the system, when conventional gadgets are used. The construction presented here, however, uses the freedom afforded by the general simulation channel Tt in Definition 5 to take advantage of an additional resource: dissipation.
We will see that, despite some impractical features for experimental implementation, this approach offers a theoretical improvement in scalings over the conventional gadget techniques discussed earlier in the section. Additionally, this construction captures a key feature of our framework for analogue simulators given in Definition 5 in contrast with existing work: we define simulators in terms of their dynamic behaviour, rather than in terms of the properties of static Hamiltonians.
For the process we describe here, we repeatedly refer to measurement for conceptual simplicity when talking about probabilities, but this terminology is somewhat misleading; we do not record or use the outcome.
Let \(H\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) be a single interaction in a many-body system, which we intend to simulate. As before, we will introduce an ancillary qubit \({{{\mathcal{A}}}}\cong {{\mathbb{C}}}^{2}\), and evolve under a Hamiltonian \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\), but now we supplement the natural time evolution with regular projective measurements on the \({{{\mathcal{A}}}}\) system at time intervals of δt. By the quantum Zeno effect62, this forces the \({{{\mathcal{A}}}}\) system to stay in the \(\left\vert 0\right\rangle\) state with high probability, meanwhile simulating the desired interaction on the \({{{\mathcal{H}}}}\) system.
The following result, Proposition 27, provides a formal construction for the measurement-based gadgets described above—see Supplementary Note 6 for the proof. Qualitatively, this result tells us that if we evolve \(\left\vert \psi \right\rangle \otimes \left\vert 0\right\rangle\) for time δt under the simulator Hamiltonian \({H}^{{\prime} }\), and then measure the ancillary qubit, we will obtain a ‘1’ result with probability O((δt)3) (corresponding to an amplitude of O((δt)3/2). In the more likely case that we obtain ‘0’, the post-measurement state (on the \({{{\mathcal{H}}}}\) space) is \({e}^{-i\delta tH}\left\vert \psi \right\rangle\), for some new Hamiltonian H, up to error O((δt)2). By repeating this process t/δt times, we will hence obtain a state \({e}^{-itH}\left\vert \psi \right\rangle+O(t(\delta t))\) on the \({{{\mathcal{H}}}}\) space if ‘0’ is measured in every round of measurement. The probability of a measurement error in this process scales as t(δt)2, hence can be controlled provided that δt = O(t−1/2), which will always be satisfied if we choose δt = O(t−1) in order to control the error on the post-measurement state.
Proposition 27
For a Hilbert space \({{{\mathcal{H}}}}\) and an ancillary qubit \({{{\mathcal{A}}}}={{\mathbb{C}}}^{2}\), let \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) be a Hamiltonian given by
for some \({H}_{{{{\rm{I}}}}},\, {H}_{X},\, {H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) depending on a small parameter δt such that ∥HI∥ = O(1), ∥HX∥ = O((δt)−1/2), and \(\parallel {H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }\parallel=O({(\delta t)}^{-1})\) with \({H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }^{2}={\omega }^{2}{{{\rm{I}}}}\), \(\omega=\frac{2\pi }{\delta t}\).
Then, for any \(\left\vert \psi \right\rangle \in {{{\mathcal{H}}}}\),
where
This provides a new 3-to-2-local gadget for Pauli strings. For example, we can set HI = −Z1, \({H}_{X}=\sqrt{\frac{\omega }{2}}({Z}_{2}+{Z}_{3})\), \({H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }=-\omega {Z}_{1}\); this yields a 2-local Hamiltonian \({H}^{{\prime} }\) simulating the 3-local interaction H = Z1 ⊗ Z2 ⊗ Z3. More generally, given three commuting Pauli strings Aa, Bb, Cc, we can set HI = −Aa, \({H}_{X}=\sqrt{\frac{\omega }{2}}({B}_{b}+{C}_{c})\), \({H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }=-\omega {A}_{a}\) to simulate the interaction H = Aa ⊗ Bb ⊗ Cc. This procedure may be used to simulate a k-local Pauli string using a (⌈k/3⌉ + 1)-local Hamiltonian.
Although Proposition 27 shows that evolution and repeated measurements under \({H}^{{\prime} }\) reproduce the dynamics of H, it is also important to guarantee that it can be combined with other interactions. Proposition 28 provides the necessary result for this, by verifying that the conclusions of Proposition 27 also hold when an additional term \({H}_{{{{\rm{else}}}}}\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) is added to both the target and simulator Hamiltonian.
Proposition 28
Let Helse = ∑ihi be a k-local Hamiltonian on \({{{\mathcal{H}}}}={\otimes }_{i}{{{{\mathcal{H}}}}}_{i}\) such that ∥hi∥ = O(1), and whose interaction graph has a degree bounded by an O(1) constant.
Introduce an ancillary qubit \({{{\mathcal{A}}}}={{\mathbb{C}}}^{2}\), and let \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}})\) be a Hamiltonian given by
for some \({H}_{{{{\rm{I}}}}},{H}_{X},{H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) depending on a small parameter δt such that ∥HI∥ = O(1), ∥HX∥ = O((δt)−1/2), and \(\parallel {H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }\parallel=O({(\delta t)}^{-1})\) with \({H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }^{2}={\omega }^{2}{{{\rm{I}}}}\), \(\omega=\frac{2\pi }{\delta t}\). Assume that HI, HX, and \({H}_{\left\vert 1\right\rangle \left\langle 1\right\vert }\) act on O(1) sites in \({{{\mathcal{H}}}}\).
Then, for any \(\left\vert \psi \right\rangle \in {{{\mathcal{H}}}}\),
where
The significance of Proposition 28 is that the errors do not depend on the size of the system through ∥Helse∥, due to bounds we place on the Trotter error in the expansion \({e}^{-i\delta t(H+{H}_{{{{\rm{else}}}}})} \, \approx \, {e}^{-i\delta tH}{e}^{-i\delta t{H}_{{{{\rm{else}}}}}}\).
Discussion
Given the result of Proposition 28, we can now describe how the measurement gadget construction fits into our framework of analogue quantum simulation described in Definition 5.
Given a Hamiltonian H = Z1 ⊗ Z2 ⊗ Z3 + Helse on n qubits \({{{\mathcal{H}}}}={({{\mathbb{C}}}^{2})}^{\otimes n}\), with \({H}_{{{{\rm{else}}}}}\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) satisfying the requirements of Proposition 28, we fix some δt > 0 and define the simulator space \({{{{\mathcal{H}}}}}^{{\prime} }={{{\mathcal{H}}}}\otimes {{{\mathcal{A}}}}\), where \({{{\mathcal{A}}}}={{\mathbb{C}}}^{2}\). Let \({H}^{{\prime} }\in {{{\rm{Herm}}}}({{{{\mathcal{H}}}}}^{{\prime} })\) be given by
where \(\omega=\frac{2\pi }{\delta t}\). Define the state and observable encodings \({{{{\mathcal{E}}}}}_{{{{\rm{state}}}}}\) and \({{{{\mathcal{E}}}}}_{{{{\rm{obs}}}}}\) by
and define channels \({E}_{\delta t},\, M:D({{{{\mathcal{H}}}}}^{{\prime} })\to D({{{{\mathcal{H}}}}}^{{\prime} })\) by
so that Eδt corresponds to evolution under the Hamiltonian \({H}^{{\prime} }+{H}_{{{{\rm{else}}}}}\) for time δt, and M corresponds to a measurement of the \({{{\mathcal{A}}}}\) system. Then, for all t, define the time evolution channel
containing ⌊t/δt⌋ copies of (M ∘ Eδt). This evolution is described by Fig. 4. The content of Proposition 28 tells us that
and hence for any observable \(O\in {{{\rm{Herm}}}}({{{\mathcal{H}}}})\) with ∥O∥ = 1,
The channels Tt therefore simulate H (in the sense of Definition 5) with respect to any states Ωstate and normalised observables Ωobs, up to accuracy ϵ > 0 and maximum time \({t}_{\max }\), provided that one chooses \(\delta t=O(\epsilon {t}_{\max }^{-1})\). Therefore we require interaction strengths and measurement frequency which scale as \(J=O({\epsilon }^{-1}{t}_{\max })\)—note that this does not depend on n, the size of the system.
We can compare these scalings with those obtained if we were to use conventional gadgets. Suppose we have a (η, ϵ)-gadget in the sense of Definition 15 with η = O(n−1ϵ) to ensure an absolute error of O(ϵ) when combined with a Hamiltonian of order n, comparable with the above construction. By Theorem 26, this must involve energy scalings of J = Ω(ϵ−1n) (and even without Theorem 26, a low-energy (Δ, η, ϵ)-gadget as in Definition 18 would require energies scaling as Ω(n) to ensure that unwanted states are sufficiently penalised). In fact, this is likely not the optimal bound; the best known 3-to-2 gadget construction requires energy scales of O(ϵ−3 + η−3), which in this case would require interaction strengths scaling as \(J=O({({\epsilon }^{-1}n)}^{3})\). Even if the system size is restricted via Lieb-Robinson bounds to set \(n=O({\log }^{d}(1/\epsilon )+{t}_{\max }^{d})\) (where d is the dimension of the system), the measurement-based gadget still provides an improvement.
Despite this advantage, the measurement gadget construction involves repeated instantaneous decoherence of the ancillary qubit at precise time intervals without disturbing the rest of the system, and may still require large (albeit non-scaling) interaction strengths. Moreover, if Ngad such gadgets were used in parallel, we expect (though do not calculate here) that an additional overhead of at least \(\delta t=O({({t}_{\max }{N}_{{{{\rm{gad}}}}})}^{-1/2})\) would be necessary to control the probability of measuring a 1 at any of the ancillary sites. Nonetheless, the construction provides a marked improvement in scalings over existing gadgets for a single 3-local term in a Hamiltonian, and gives some positive clues as to the ways in which simulators might take advantage of more general possibilities for channels allowed by Definition 5. We leave the detailed study of such gadgets, and their robustness to error for future work. We anticipate that, for a suitable adaptation of Definition 15 for the dissipative case, there may be similar no-go results preventing locality reduction by gadgets independently of the size of the system.
Data availability
No datasets were generated or analysed during the current study.
References
Feynman, R. P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982).
Wecker, D. et al. Solving strongly correlated electron models on a quantum computer. Phys. Rev. A 92, 062318 (2015).
Baiardi, A., Christandl, M. & Reiher, M. Quantum computing for molecular biology. ChemBioChem 24, e202300120 (2023).
Lloyd, S. Universal quantum simulators. Science 273, 1073–1078 (1996).
Georgescu, I. M., Ashhab, S. & Nori, F. Quantum simulation. Rev. Mod. Phys. 86, 153 (2014).
Berry, D. W., Childs, A. M., & Kothari, R. Hamiltonian simulation with nearly optimal dependence on all parameters. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 792–809. IEEE, 2015.
Low, GuangHao & Chuang, I. L. Hamiltonian simulation by qubitization. Quantum 3, 163 (2019).
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J. & Su, Y. Toward the first quantum simulation with quantum speedup. Proc. Natl Acad. Sci. 115, 9456–9461 (2018).
Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Cirac, J. I. & Zoller, P. Goals and opportunities in quantum simulation. Nat. Phys. 8, 264–266 (2012).
Cubitt, T. S., Montanaro, A. & Piddock, S. Universal quantum Hamiltonians. Proc. Natl Acad. Sci. 115, 9497–9502 (2018).
Piddock, S. & Bausch, J. Universal translationally-invariant Hamiltonians. arXiv https://arxiv.org/abs/2001.08050 (2020).
Piddock, S. & Montanaro, A. Commun. Math. Phys. 382, 721–771 (2021).
Kohler, T., Piddock, S., Bausch, J. & Cubitt, T. Translationally invariant universal quantum Hamiltonians in 1D. In Annales Henri Poincaré, pages 1–32. Springer, 2020.
Kohler, T., Piddock, S., Bausch, J. & Cubitt, T. General conditions for universality of quantum Hamiltonians. PRX Quantum 3, 010308 (2022).
Zhou, L. & Aharonov, D. Strongly universal Hamiltonian simulators. arXiv https://arxiv.org/abs/2102.02991 (2021).
Oliveira, R. & Terhal, B. M. The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Inf. Comput. 8, 900–924 (2008).
Bravyi, S. & Hastings, M. On complexity of the quantum Ising model. Commun. Math. Phys. 349, 1–45 (2017).
Aharonov, D. & Zhou, L. Hamiltonian sparsification and gap-simulations. arXiv https://arxiv.org/abs/1804.11084 (2018).
Bluvstein, D. et al. A quantum processor based on coherent transport of entangled atom arrays. Nature 604, 451–456 (2022).
Dür, W., Vidal, G. & Cirac, J. I. Three qubits can be entangled in two inequivalent ways. Phys. Rev. A 62, 062314 (2000).
Walter, M., Doran, B., Gross, D. & Christandl, M. Entanglement polytopes: multiparticle entanglement from single-particle information. Science 340, 1205–1208 (2013).
Christandl, M., Lysikov, V., Steffan, V., Werner, A. H. & Witteveen, F. The resource theory of tensor networks. arXiv https://arxiv.org/abs/2307.07394 (2023).
Lieb, E. H. & Robinson, D. W. The finite group velocity of quantum spin systems. Commun. Math. Phys. 28, 251–257 (1972).
Kim, I. H. & Swingle, B. Robust entanglement renormalization on a noisy quantum computer. arXiv https://arxiv.org/abs/1711.07500 (2017).
Borregaard, J., Christandl, M. & Stilck França, D. Noise-robust exploration of many-body quantum states on near-term quantum devices. npj Quantum Inf. 7, 45 (2021).
Trivedi, R., Rubio, A. F. & Cirac, J. I. Quantum advantage and stability to errors in analogue quantum simulators. arXiv https://arxiv.org/abs/2212.04924 (2022).
Gorini, V., Kossakowski, A. & Sudarshan, EnnackalChandyGeorge Completely positive dynamical semigroups of n-level systems. J. Math. Phys. 17, 821–825 (1976).
Lindblad, G. On the generators of quantum dynamical semigroups. Commun. Math. Phys. 48, 119–130 (1976).
Kempe, J. & Regev, O. 3-local Hamitonian is QMA-complete. Quantum Inf. Comput. 3, 258–264 (2003).
Bravyi, S., DiVincenzo, D. P., Loss, D. & Terhal, B. M. Quantum simulation of many-body Hamiltonians using perturbation theory with bounded-strength interactions. Phys. Rev. Lett. 101, 070503 (2008).
Cao, Y., Babbush, R., Biamonte, J. & Kais, S. Hamiltonian gadgets with reduced resource requirements. Phys. Rev. A 91, 012315 (2015).
Cao, Y. & Nagaj, D. Perturbative gadgets without strong interactions. Quantum Inf. Comput. 15, 1197–1222 (2015).
Cichy, S., Faehrmann, P. K., Khatri, S. & Eisert, J. A perturbative gadget for delaying the onset of barren plateaus in variational quantum algorithms. arXiv https://arxiv.org/abs/2210.03099 (2022).
Lewalle, P. et al. A multi-qubit quantum gate using the Zeno effect. Quantum 7, 1100 (2023).
Ball, C. & Cohen, T. D. Zeno effect suppression of gauge drift in quantum simulations. arXiv https://arxiv.org/abs/2405.09462 (2024).
Blumenthal, E. et al. Demonstration of universal control between non-interacting qubits using the Quantum Zeno effect. npj Quantum Inf. 8, 88 (2022).
DiVincenzo, D. P. The physical implementation of quantum computation. Fortschr. der Phys.: Prog. Phys. 48, 771–783 (2000).
Kitaev, A. Y. Quantum computations: algorithms and error correction. Russian Math. Surv. 52, 1191 (1997).
Wilming, H. & Werner, A. H. Lieb-Robinson bounds imply locality of interactions. Phys. Rev. B 105, 125101 (2022).
Kitaev, Alexei Yu, Shen, A. & Vyalyi, M. N. Classical and quantum computation. American Mathematical Society, 2002.
Kempe, J., Kitaev, A. & Regev, O. The complexity of the local Hamiltonian problem. SIAM J. Comput. 35, 1070–1097 (2006).
Hallgren, S., Nagaj, D. & Narayanaswami, S. The local Hamiltonian problem on a line with eight states is QMA-complete. Quantum Inf. Comput. 13, 721–750 (2013).
Cubitt, T. & Montanaro, A. Complexity classification of local Hamiltonian problems. SIAM J. Comput. 45, 268–316 (2016).
Gottesman, D. & Irani, S. The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 95–104. IEEE, 2009.
Apel, H. & Cubitt, T. A mathematical framework for quantum Hamiltonian simulation and duality. arXiv https://arxiv.org/abs/2208.11941 (2022).
Cerezo, M. et al. Variational quantum algorithms. Nat. Rev. Phys. 3, 625–644 (2021).
McClean, J. R., Romero, J., Babbush, R. & Aspuru-Guzik, Alán The theory of variational hybrid quantum-classical algorithms. N. J. Phys. 18, 023023 (2016).
Verstraete, F., Wolf, M. M. & Cirac, J. I. Quantum computation and quantum-state engineering driven by dissipation. Nat. Phys. 5, 633–636 (2009).
Childs, A. M., Gosset, D. & Webb, Z. Universal computation by multiparticle quantum walk. Science 339, 791–794 (2013).
Bohdanowicz, T. C. & Brandão, Fernando G.S.L. Universal Hamiltonians for exponentially long simulation. arXiv https://arxiv.org/abs/1710.02625 (2017).
Farrelly, T. A review of quantum cellular automata. Quantum 4, 368 (2020).
Lechner, W., Hauke, P. & Zoller, P. A quantum annealing architecture with all-to-all connectivity from local interactions. Sci. Adv. 1, e1500838 (2015).
Nguyen, Minh-Thi et al. Quantum optimization with arbitrary connectivity using Rydberg atom arrays. PRX Quantum 4, 010316 (2023).
Watrous, J. The Theory of Quantum Information (Cambridge University Press, 2018).
Biamonte, J. D. & Love, P. J. Realizable Hamiltonians for universal adiabatic quantum computers. Phys. Rev. A 78, 012352 (2008).
Schuch, N. & Verstraete, F. Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nat. Phys. 5, 732–735 (2009).
Piddock, S. & Montanaro, A. The complexity of antiferromagnetic interactions and 2D lattices. Quantum Inf. Comput. 17, 636–672 (2017).
Bravyi, S., DiVincenzo, D. P. & Loss, D. Schrieffer–Wolff transformation for quantum many-body systems. Ann. Phys. 326, 2793–2826 (2011).
Jordan, S. P. & Farhi, E. Perturbative gadgets at arbitrary orders. Phys. Rev. A 77, 062329 (2008).
Bausch, J. Perturbation gadgets: Arbitrary energy scales from a single strong interaction. Ann. Henri Poincaré 21, 81–114 (2020).
Misra, B. & Sudarshan, E. C. George The Zeno’s paradox in quantum theory. J. Math. Phys. 18, 756–763 (1977).
Acknowledgements
We acknowledge financial support from the Novo Nordisk Foundation (Grant No. NNF20OC0059939 ‘Quantum for Life’), the European Research Council (ERC Grant Agreement No. 818761) and VILLUM FONDEN via the QMATH Centre of Excellence (Grant No. 10059). A.H.W. thanks the VILLUM FONDEN for its support with a Villum Young Investigator Grant (Grant No. 25452). I.D. was supported in part by the AFOSR under grant FA9550-21-1-0392 and a National Science Foundation (NSF) Graduate Research Fellowship under Grant No. DGE 1656518. I.D. thanks everyone at QMATH for their hospitality during his research visit to KU and especially Prof. Adam Bouland for encouraging and supporting the visit. I.D. gratefully acknowledges Harriet Apel for generously offering insights and guidance during fruitful discussions at the early stages of this work.
Author information
Authors and Affiliations
Contributions
All authors discussed and made substantial contributions to the main ideas of the work. D.H. contributed the mathematical proofs and, with input from I.D., F.R.K., A.B., D.S.F., A.H.W., and M.C., drafted the manuscript. M.C. supervised the project.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Peer review
Peer review information
: Nature Communications thanks the anonymous reviewer(s) for their contribution to the peer review of this work. A peer review file is available.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Harley, D., Datta, I., Klausen, F.R. et al. Going beyond gadgets: the importance of scalability for analogue quantum simulators. Nat Commun 15, 6527 (2024). https://doi.org/10.1038/s41467-024-50744-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41467-024-50744-9
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.