Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions

We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent 2-qubit ZZ and XX+YY interactions on an (almost) planar grid. The effective Hamiltonian is arrived at by a single use of first-order perturbation theory avoiding the use of perturbation gadgets. The dynamics and spectral properties of the effective Hamiltonian can be fully determined as it corresponds to a particular realization of a mapping between a quantum circuit and a Hamiltonian called the space-time circuit-to-Hamiltonian construction. Because of the simple interactions required, and because no higher-order perturbation gadgets are employed, our construction is potentially realizable using superconducting or other solid-state qubits.


I. INTRODUCTION
The first proposals for quantum computers used time-dependent Hamiltonians to enact unitary quantum logic gates [1][2][3][4][5] and the first prototype quantum computers were realized using such time-dependent methods via electromagnetic resonance [6,7]. In 1986, Feynman proposed a method for performing quantum computation using a time-independent Hamiltonian [8]. His motivation was to make a model of quantum computation that resembled more closely the time-independent Hamiltonian dynamics of the fundamental laws of physics.
Feynman's trick was to adjoin a global clock variable that regulated the pace of the computation. In 1987, Margolus constructed a model for Hamiltonian quantum computation that was spatially homogeneous, eliminating the pointer variable by embedding the computation in an asynchronous cellular automaton [9]. In the Margolus method, the role of the pointer variable is subsumed in the positions of clock particles or 'chronons' that carry quantum bits with them as they progress through the computation. The global clock variable is thus replaced by a local clock variable, one for each degree of freedom in the computation.
The Feynman and Margolus models were originally conceived as dynamic models in which the clock or the chronons are prepared in a traveling wave state that propagates through the computation. Later analyses of these models have shown that it is not necessary to prepare the initial state in traveling wave state: one can just initialize the input state at fixed initial clock time (see e.g. [10]).
It was also noted that the Feynman Hamiltonian allows quantum computation to be embedded in the ground state of the quantum system; it provides a means for mapping the time-dynamics of a quantum system or a quantum circuit onto the ground-state of a master 'circuit' Hamiltonian which includes the dynamics of the clock variable [11]. This ground state can then be reached via adiabatic quantum computation [12]. The practical disadvantage of the universal circuit Hamiltonian obtained through this construction is that it involves many-qubit interactions or qudit degrees of freedom. Such interactions can rewritten in terms of simpler, say, 2-qubit interactions through the use of perturbation theory (by using so-called perturbation gadgets [13][14][15][16][17]). However, effective interactions obtained in kth-order degenerate perturbation theory with perturbative coupling g and gap ∆ of the unperturbed Hamiltonian scale in strength as g(g/∆) k−1 leading to a correspondingly small gap of the effective Hamiltonian (as compared to the physical device temperature).
In addition, multiple uses of (higher-order) perturbation theory lead to Hamiltonians with undesirable qubit overhead and complexity. Consequently, existing models of Hamiltonian quantum computation based on pairwise qubit interactions are not particularly suitable for physical implementation using, e.g., solid-state quantum information processors.
The Margolus asynchronous cellular automaton model of Hamiltonian quantum computation relies on spatially homogeneous interactions which allow the chronons that carry the computation to progress at different rates at different points: this construction can be thought of as a quantum-computation based model of Wheeler's 'many-fingered time' [18], and has been recently formalized in [19] under the name space-time circuit-to-Hamiltonian construction. Several works have either explicitly or implicitly formulated proposals of doing universal Hamiltonian computation [20,21] or quantum adiabatic computation [22][23][24][25] using this construction. A related proposal which seeks to do adiabatic computation using the idea of quantum adiabatic transistors has been formulated in [26,27]. Ref. [28] has proposed a way of doing Hamiltonian computing using the Feynman construction using only 2-qubit interaction and no application of perturbation theory. However, in order to make this model geometrically local on a 2D grid, the author estimates that each qubit is involved in a high number, at most 28, qubit interactions. In addition, the use of the global Our results are an improvement over the previous constructions in the following sense: The 2D grid Hamiltonian proposed in [20] for running an autonomous programmable quantum computation is based on a strong attractive interaction between hopping spin-1/2 particles so that in first-order perturbation theory these particles hop together through spatial areas where their internal states are changed according to the circuit to be implemented. This particular realization uses, similarly to the current work, an attractive interaction between particles. If one translates this construction to qubits the author's use of holonomic computation to implement logic results in 4-qubit interactions. If the construction is described with particles with spin, it uses attractive particle interactions, single particle hopping terms and terms which couples the spins of pairs of particles. In addition, our construction goes beyond the results in Refs. [20,28] by showing how to do adiabatic computation using similar 2-qubit interactions and known bounded gap above the ground state.
In [26] the resulting Hamiltonian requires particular 4-qubit interactions and thus a further use of perturbation theory. Even though we reduce particular 4-qubit interactions to 2-qubit interactions by means of a single use of 1st order perturbation theory, it is unlikely that this trick is possible for arbitrary 4-qubit interactions. The Hamiltonian and adiabatic computation that we propose bears the closest resemblance to the 2D grid model Hamiltonian in [25]: we show how mathematical results concerning this construction directly carry over to the results in this paper. The particle interactions in [25] (and the original [24]) require pairs of particles to jointly move or hop while updating their internal states: we expect that a reduction of such interactions to 2-local interactions is inefficient, thus strongly favoring the novel construction in this paper. Two crucial steps give us this improvement over [25], namely the use of the railroad switch idea [8,10,28] to do a classical CNOT or Toffoli gate, and the use of 1st order perturbation theory to coordinate the joint movement of the particles so that they execute the computation jointly.
A goal of this paper is to construct models for Hamiltonian and adiabatic quantum computation that are compatible with experimentally available couplings in a physical device such 2D arrays of spin qubits in semi-conducting quantum dots or superconducting qubits.
The recent demonstration of large-scale quantum annealers using superconducting circuits suggests that adiabatic or Hamiltonian computation might provide a fruitful method for performing quantum computation. While existing quantum annealers realize a transverse Ising model system, the more general couplings afforded by superconducting and other solidstate and quasi-solid state systems such as optical lattices might be used to perform general adiabatic quantum computation. We discuss possible physical realizations in Section V A.
Running a solid-state (quantum) computation using a time-independent Hamiltonian has the advantage of requiring no AC fields on chip, thus removing the challenge of placing active control lines between quantum degrees of freedom and turning interactions on and off. A disadvantage of running the quantum degrees of freedom through stationary, in-place gates is that we trade a time-dependence for a space-dependence and thus a 1D quantum circuit is executed on a 2D grid.

A. Quantum Field Effect Transistor and Perturbation Theory
An essential element in our construction is that we use high energy 'blocking' terms (H 0 ) to prevent lower energy hopping or kinetic terms (V ) from operating. Blocking can be thought of as a coherent quantum version of the field-effect transistor that underlies classical computation: the presence of particles (electrons/holes) in the gate electrode prevents other particles from moving from source to drain. In classical computation the high-energy terms correspond to a tuning of the classical electrostatic potential by the gate electrode so that a sufficiently high barrier, larger than the kinetic energy of the particle at the source, blocks the forward motion. In the quantum version the potential itself is formed by the presence or absence of a (charged) particle. Considering that the hopping particle can always tunnel through the energy barrier, one has to choose the kinetic energy perturbatively weak compared to the height of the barrier.
We illustrate the idea of blocking with a small example, shown in Fig. 1(a). Take the state |1 to represent the presence of a 'particle' on a site (represented in Fig. 1 by a filled circle •) and the state |0 to represent the absence of a particle (represented by an empty circle •).

Consider a Hamitonian
g the term H 0 'blocks' a particle from making the transition from site 2 to site 3 if another particle already occupies site 1. H 123 has a simple block-diagonal form in the basis |0 0| 1 and |1 1| 1 , that is In the |0 0| 1 part of the low-energy sector the Hamiltonian is simply gV . In the |1 1| 1 sector the eigenstates on sites 2 and 3 couple the unperturbed low-energy state |10 23 and high-energy state |01 23 , i.e |ψ ± ∝ 2g ∆ |01 23 + (1 ± 1 + 4g 2 /∆ 2 )|10 23 with energy E ± = ∆ 2 (1 ∓ 1 + 4g 2 /∆ 2 ). To zero'th order in g/∆ the low-energy state equals |ψ + ≈ |10 23 while in first-order in g/∆ |ψ + has an amplitude O(g/∆) for the high-energy state |01 23 : the maximum probability of finding the system in the high-energy sector over time is thus suppressed to O(g 2 /∆ 2 ). The probability of finding the system in the high-energy sector could be further decreased by interactions with the environment at temperature T < E.
We can thus say that to lowest order in g, there exists an effective low-energy Hamiltonian whose dynamics is decoupled from the unperturbed high-energy sector and which equals We see from this simple example that in the presence of blocking, 2-local hopping terms can take on a conditional nature: a particle can only hop from one site to another if it is not blocked. As a consequence, the effective low-energy Hamiltonian H eff is now 3-local.
When performed coherently using multiple particles, by the method described below, such blocking allows one to build up a quantum computation out of a sequence of blocking and hopping moves. We note that the idea of creating blocking energy barriers for certain particle occupations is also used in various first-order perturbation gadgets in [29].
In our detailed construction in Section II the hopping of particles is controlled by the presence of particles nearby. In particular, the presence of a neighbor particle provides a 2-site energy well for another particle. This means that the energy barrier for a particle to go off by itself is high on all sites where there are no particles nearby and thus tunneling through this long energy barrier is completely suppressed.
When the blocking site separates a 'source' and 'drain' site, as in Fig. (1b), the resulting device makes up a Hamiltonian quantum field effect transistor (qFET), where the particle at site 2 can move to site 4 only if site 3 is not blocked. Just as in a conventional electronic computer, where field effect transistors are used to guide charged particles through the computation and to perform logic, the quantum field effect transistor will be used to guide qubits through the computation and to perform quantum logic. The detailed construction of the use of quantum field effect transistors to perform Hamiltonian quantum computation will be given in Section V.
Note that even when the particle at site 2 is blocked by an energy barrier at 3, it can still tunnel through this barrier to site 4, leading to incorrect dynamics at higher order in perturbation theory. To suppress such tunneling, we can add a sequence of intermediate sites over which the energy barrier remains high: the details of this construction are given in Section IIB.
For a general analysis of the effect of blocking and weak particle hopping for many particles we can invoke the results of degenerate perturbation theory. Let us briefly summarize the results of the systematic Schrieffer-Wolff peturbative method [15,30]. Let H 0 be a many-particle Hamiltonian with an energy gap ∆ between a degenerate ground-state sector with, say, zero energy, and higher-energy states. For example, the Hamiltonian H 0 will add energy penalties when particles do not stay together, i.e. it is blocking a particle from moving away while other particles stay behind. Let P 0 be the projector onto the degenerate ground state sector of this Hamiltonian. Let a perturbation gV be added to H 0 where V is a sum of hopping terms for the particles and g ∆. One can show [30] that there always exist a unitary transformation U such that U (H 0 + V )U † is block-diagonal in the original low-and high-energy eigenspaces of H 0 . One defines a 'low-energy Hamiltonian' H = P 0 U (H 0 + V )U † P 0 which has then, by definition, the same spectrum as part of H 0 + V .
One can define a perturbative expansion for the unitary operator U which gives rise to a Taylor expansion forH in g/∆. Cutting off this Taylor expansion forH at a given desired, In our analysis we will also discuss the effect of higher-order terms in a perturbative expansion ofH. We can show that such higher-order terms do, assuming an otherwise error-free running of the computation, not affect the logic of the quantum computation that is executed, although it will affect the spectral properties of the Hamiltonian, the form of the dressed states and thus the time-dynamics.
It is important to note that errors in the perturbatively derived effective dynamics always scale extensively with system size, i.e. number of single-particle modes n [15]. This is the reason why in some quantum complexity applications of perturbation theory [14] it is required that g||V || ∆ implying an unphysical scaling of g ∼ 1/n as ||V || ∼ n. Of course, an extensive scaling of errors with computation size, is entirely natural from the point of view of a quantum circuit model in which each gate has a certain error rate so that the total error rate scales with the total number of gates. Furthermore, in many physical implementations of quantum computation, two qubit gate interactions are derived using perturbation theory from more basic interactions and even though these qubits all need to couple together and thus perturbation theory should be applied at the level of a many-qubit system, this is never undertaken. The answer to error accumulation in the quantum circuit model is the use of quantum error correction and fault-tolerance so that error rates on logical qubits are suppressed [31]. We discuss some aspects of making the computation fault-tolerant in Section VI.

II. HAMILTONIAN QUANTUM COMPUTATION
Here we describe in detail the execution of a one-dimensional quantum circuit using a two-dimensional time-independent Hamiltonian with nearest-neighbor interactions. For clarity of exposition, we present our analysis in terms of hopping of spin-1/2 particles. Each spin-1/2 particle implements a 'chronon' that propagates through the computation, carrying with it an internal qubit on its spin degree of freedom. In section V we discuss what the terms in the Hamiltonian look like when one represents the spin-1/2 particles using dualrail qubits, so that the state |00 represents the absence of a particle, |10 represents the presence of a particle with internal qubit state |0 , and |01 represents the presence of a particle with internal qubit state |1 (the state |11 is unused). In the spin-1/2 hopping model, particles hop from site to site in the presence of neighboring particles. As they hop, their internal qubits can change according to SU (2) rotations. When the path along which hopping takes place is determined by the internal state of a neighboring particle -a spindependent quantum field effect transistor -then the internal qubit of the hopping particle can undergo a controlled rotation or a CNOT controlled by the internal state of the neighbor.
Although the goal of this paper is to show how Hamiltonian quantum computation can be implemented using pairwise interactions between qubits, the construction given in this section using pairwise interactions between spin-1/2 particles also represents a viable path to implementable Hamiltonian quantum computation, using, e.g., spin-dependent electron tunneling [32].
For concreteness, we consider a rotated 2D grid depicted in Fig. 2. At each site (i, j), i, j ∈ {0, . . . , m} on this lattice a particle with spin 1/2 can reside. There is assumed to be only one particle per horizontal line so in total 2m + 1 particles: the dynamics of the Hamiltonian preserves this property and will let particles move along the horizontal lines, hopping from site to site. At the top and bottom of the lattice, i.e. sites (0, m) and (m, 0), the particle is therefore fixed in position and undergoes no dynamics.
Initially, at the beginning of the computation, the particles are all residing on the left end of the grid, one on each site. Using nearest-neighbor interactions on this grid, one can embed a one-dimensional quantum circuit with nearest-neighbor interactions (see [20,25]). Each horizontal line then represents a single qubit wire of the one-dimensional quantum circuit.
Using SWAP gates such circuit can be used to run an arbitrary quantum computation.
Instead of using this rectangular grid one can imagine a line of particles hopping forward over a grid, -a spatial execution of a one-dimensional quantum circuit-. It was noted however in [20,25] that if the embedded quantum circuit is relatively small compared to m so that it can be embedded in the expanding region of the grid where particles are gradually added at the boundaries, then the forward motion of the particles in the Hamiltonian computation is very efficient. In essence the boundary condition imposed by this grid breaks the timereversal of the computation: the string is more likely to move from the boundary to the bulk as the number of bulk strings is much larger. Furthermore, both adiabatic and Hamiltonian computation are easy to analyze in this geometry.
The entire Hamiltonian of the system will be H = H string + gV hop where H string is a strong term which enforces particles to stay close together and form a connected string. In other words, H string gives a penalty to particle configurations which do not form a connected string over the lattice as in Fig. 2. H string will have a degenerate ground space with zero energy separated by a gap ∆ to higher excited 'broken string' states. In H string each particle interacts via a strong Ising-like interaction with four other particles, namely its neighbor particles on the rotated grid. The perturbative parameter g ∆ and V hop is a sum of hopping (kinetic) terms which move particles forward or backwards from site to site (on a horizontal line).
If we treat V hop perturbatively, the effective Hamiltonian in 1st order perturbation theory equals H eff = P string V hop P string + O(g 2 /∆). This effective Hamiltonian is thus comprised of hopping terms which preserve the connectedness of the string. Higher-order terms in a perturbative expansion correspond to multiple hops of one or more particles which, taken together, preserve the connectedness of the string.
We will first show how one can execute a simple circuit comprised of single-qubit gates with H. In order to include gates such as a CNOT (or controlled-U gate), some of the sites on the grid will be replaced by pairs of sites, for example, one sitting below the 2D plane and another one above. At such locations, the string has the possibility of splitting and running through either of the sites, below or above the plane, see an example in Fig. 3. We will modify H string so that depending on the internal (spin) state of a control particle, only one of these choices has zero energy. Thus H string has zero energy for all connected correct strings where the correctness depends on the state of some control particles. Similarly, V hop is modified to allow particles to hop to the newly defined sites above and below the plane and undergo internal dynamics which is different for when they hop to a site below or above the plane, thereby allowing controlled-rotations and CNOTs. The string is thus being routed in two different ways capturing the idea of a railroad switch which temporarily routes a train along two different paths. During the quantum computation while the control particles are in superpositions of different internal states, one thus works with a coherent superposition of strings routed partially above or below the plane.
The standard procedure to analyze the dynamics of the (space-time) circuit-to-Hamiltonian construction is to define a unitary transformation which transforms away the internal dynamics of the spin degrees of freedom leaving only the dynamics for the pointer or multiplepointer/string degrees of freedom, see e.g. [19]. The difference with the previous constructions is the coupling between the internal spin degree of freedom and position of the string used in the CNOT or Toffoli gate. In Appendix A we show how to rotate away the internal dynamics, both for Hamiltonian computation as well as for the quantum adiabatic model introduced below. It then follows that the string dynamics due to H eff is easy to represent as one can parametrize a string in Fig. 2 by a bit-string z of length 2m and Hamming weight m, where bit 0 = / (resp. 1 = \). For example, the initial string on the left |z init is the configuration |00 . . . 01 . . . 1 . The dynamics of the string in the Hamiltonian computation (resp. adiabatic computation), and therefore the forward motion of the computation, can then be unitarily mapped onto a one-dimensional XY model (resp. Heisenberg model) and this dynamics has been considered previously in [20,25]. Given that one initializes the computation with a string on the left, the probability of finding the string elsewhere on the lattice after a time-evolution exp(−iH eff t) is also known [25].
The Hamiltonian that we present assumes that there exists only a single-particle or chronon on each line. It is not possible to enforce this condition locally, but we will show at the end of the paper, Section VI A, that one can add simple local interaction terms (which translate as two-qubit ZZ terms in the dual-rail encoding) which ensure that states with multiple particles on a line are of higher energy.

A. Single-Qubit Gates
It is useful to define the particle number operator at site (i, j) as where n s [i, j] is the number operator for the particle at site (i, j) in internal state s = 0, 1 is the creation (annihilation) operator for a particle in internal state s at site (i, j). Sometimes we also where the v label just stands for site v, to avoid cumbersome notation.
We define where e labels all the edges e of the 2D grid in Fig. 2  However at boundary sites, which connect to only 3 other sites, this penalty for a connected string becomes ∆ 2 and for the 4 corner sites of the grid a connected string going through these sites picks up no penalty at that site. Thus in order for all connected strings to have equal energy with respect to H string , we need to add ∆ 2 penalties at the boundary sites. One takes H boundary as A connected string will then have energy (2m + 1)∆. For a broken string at least two sites will be end-points of a string: such string thus has energy ∆ above the ground space of connected strings. This establishes that the gap of H strings is ∆ and the degenerate ground space consists of connected strings (independent of the spin-state of the particles) with projector P string onto this ground space.
To implement some single-qubit gates U one takes V hop = p V p hop where p runs over plaquettes p of the grid and each plaquette corresponds to some single qubit gate U or I.
The term V p hop for a plaquette with corner sites (i, j), (i + 1, j), (i + 1, j + 1), (i, j + 1) lets a particle at site (i, j) hop to site (i + 1, j + 1) while it is changing its internal spin state according to the gate U , i.e.
This form of executing single-qubit gates has been first proposed in [22]. When U = I gate, this interaction is a simple kinetic energy term of moving particles/fermions on a 1D line.
If we treat H string + gV hop perturbatively, the effective Hamiltonian reads In words: particles can only hop forward or backward over a plaquette when there are particles at the top and bottom of the plaquette so that hopping keeps the string connected.
It has been shown in [20,25] that the string dynamics induced by such effective Hamiltonian H eff can be unitarily related to an XY model.
In principle, it is possible to give an effective Hamiltonian in the string subspace which includes higher-order virtual hopping processes from string subspace to high-energy disconnected string subspace and then back to string subspace. Such effective Hamiltonian in the low-energy string subspace realizes the proper logical single-qubit gates, but the string dynamics will not be described by an XY model. For example, in second-order in g, one has the following possible processes: (1) twice application of some V p hop leading to no string motion, or a term proportional to I, (2) the application of two different terms V p hop and V q hop with q = p, each of which keeps the string connected leading to terms which are unitarily equivalent to H 2 XY , and (3) the application of two adjacent terms V p hop and V q hop with q = p, such that the application of either one breaks the string but together they map back onto a connected string. This third process has a prefactor g 2 /∆ and does not lead to terms which are equivalent to H 2 XY . which path the string is allowed to take depends on the state of the control qubit of the CNOT gate.

B. CNOT Gate
We describe the modification of the Hamiltonians H string and gV hop which one allow one to perform controlled-U gates. We illustrate the construction with a CNOT gate. In order to execute a CNOT we will modify a region of four adjacent plaquettes on the lattice; we call this region a CNOT region, see Fig. 4 We modify the edges which are internal to the CNOT region in H string : these are the edges a, b, c and d in Fig. 4(b). We choose the control qubit above the target qubit. The control qubit is just undergoing the I gate when hopping from (i, j − 1) to (i + 1, j) in Fig. 4.
The qubit on the horizontal line below the target qubit and the qubit on the line above the target qubit are not participating in the CNOT gate and could be undergoing single-qubit is doubled (the target particle can hop to a site below or above the plane). Depending on the internal state of the control particle at site (i, j − 1) and (i + 1, j) an energy penalty is assigned when the target particle is present on the wrong side of the plane. Edges which involve these two What is the spectrum of, say, H a ? Remember we assume that there is at most one particle per horizontal line. When there are no particles on sites (i, j − 1) and (i, j, k) for k = 0, 1 H a has zero energy. When there is a particle at (i, j − 1) but no particle at (i, j, k = 0) or (i, j, k = 1), then ∆ 4 H a equals ∆/2. When n[i, j, k = 1] = 1, n s=1 [i, j − 1] = 1, then n s=0 [i, j − 1] = n[i, j, k = 0] = 0, hence the energy is again zero. When n[i, j, k = 1] = 0 but n s=1 [i, j − 1] = 1, we have n s=0 [i, j − 1] = 0 and two choices namely n[i, j, k = 0] = 0 or n[i, j, k = 0] = 1. In the first case, the energy is zero, the string simply does not yet run over the edge a. In the second case, the energy of ∆ 4 H a is ∆ 2 , and we can say that the string runs incorrectly over edge a: even though the control qubit is in state s = 1, the target particle is found at site (i, j, k = 0). These arguments imply that not continuing along edge a has the same energy penalty as incorrectly continuing along edge a. The same arguments apply to the modified edge b. This means that the ground space of H string is formed by all correct strings which have energy (2m + 1)∆ as before. We denote the projector onto the ground space of H string as P correct string . What is the energy of broken or incorrect strings and thus the gap of the modified string Hamiltonian? Again a string can be broken such that it has ∆ energy above the ground space. A string can also be connected but incorrect on the central site in the CNOT region: in that case the string is picking up an energy penalty only on the incorrect edge which costs ∆ 2 . The gap of the modified H string is thus ∆/2 (which we can of course rescale to ∆ again).
In order to execute a CNOT gate in a region, the weak hopping terms towards the central now doubled site (i, j) also need to be modified. If the particle passes through the site (i, j, k = 0), its internal state should be unchanged as the control particle was in the state |0 . If the particle passes through the site (i, j, k = 1), its internal state should undergo a bit-flip X (for a controlled-U gate this can be an arbitrary unitary U ). We thus modify Eq. (6) for plaquettes p 1 and p 2 as in Fig. 4. We take With the introduction of the CNOT region(s), the effective Hamiltonian in Eq. (7), These terms represent the execution of the CNOT gate via two steps p 1 and p 2 : the target particle hops from site (i−1, j −1) onto either site (i, j, k = 0, 1) depending on whether there are particles right above and below it and depending on whether the control particle above it is in the state 0 or 1. In the next hopping process p 2 the particle does not undergo internal dynamics and it can hop from either site (i, j, k = 0) or (i, j, k = 1) onto (i+1, j +1), at least when there is a particle in the correct spin state above and a particle in an arbitrary state below it. Of course, the Hamiltonian also includes the reverse conditional hopping process.
One can note that these controlled-hopping processes H p 1 cond.hop and H p 2 cond.hop. will take place sequentially as the particles above and below the target particle have to move forward or backward after one of the process takes place in order to have the next one executed.
We can consider what terms are present in the next order of the perturbative expansion where contributions are coming from twice hopping from the correct string space back to the correct string space. If double hopping involves a single particle, then in order for the string to stay connected (and correct), the particle has to hop backward and forward, inducing no effective dynamics. The only other contributions in second-order in the perturbation V hop , are from two different particles hopping so that together they preserve the connectedness of the string. The same is true for all third-order processes as it takes at least four hopping processes in order for the particles to hop/tunnel through a CNOT region. Thus terms up to O(g 3 /∆ 2 ) give rise to a change in string dynamics, but the logic is still properly executed. In other words, if the string has traveled through the region where the gates have been applied, then the correct circuit has been implemented.
A fourth-order process can however lead to incorrect logic in the CNOT gate as follows.
Assume the control particle is in the state |0 . The target particle hops from site (i−1, j −1) through incorrect site (i, j, 1), and then again to (i + 1, j + 1) and the control particle hops from (i, j −1) to (i+1, j), while the particle below hops from (i−1, j) to (i, j +1), so that the string stays connected and is correct after these four processes. In this fourth-order process (of order O(g 4 /∆ 3 )) the target particle undergoes a bitflip although the control qubit was 0. One can suppress these higher-order virtual tunneling processes by replacing the short CNOT by a long CNOT. The idea of the long CNOT is to enlarge the CNOT region to an elongated CNOT region in which the central site is a sequence of L sites where the string can only go below or above the plane. The hopping terms of these L sites propagate the particles on one site of the plane or the other. For such long CNOT with L central sites, it takes L + 1 hops for the target particle to be on the plane again where the fact that it has taken the wrong route is no longer visible (in other words, it takes L + 1 hops for the particle to tunnel through the energy barrier). For the string to stay connected, the particles above and below the target particle also have to hop along, over L sites. Hence, the first term which gives rise to incorrect logic is of order O g( g ∆ ) 3L+1 .

III. TOFFOLI GATE AND PROGRAMMABLE CIRCUITS
The principle of the spin-dependent quantum field effect transistor can also be used to do a Toffoli gate or make the quantum circuit programmable. In the Toffoli gate two particles determine how a third qubit should be routed, above or below plane. One can choose these two particles as a particle above and below the target particle, as in the CNOT region in Fig. 4. For a short Toffoli gate, the modification of H string then involves all four edges a, b, c, d, each one of them should depend on the internal state of the control particle(s), as in Eq. (8).
In order to make the computation programmable, one can add classical control bits to the grid which can route the particles to regions where they can undergo the desired logic. These bits do not need to participate in the dynamics, i.e. but they can interact with the particles involved in the computation in the Hamiltonian H string giving penalties for incorrect string configurations.

IV. QUANTUM ADIABATIC COMPUTATION
To execute an adiabatic quantum computation on the grid, we define the Hamiltonian . This construction follows the ideas in [25], but the adiabatic Hamil-tonian has to be chosen differently in order for the spectral analysis of [25] to apply. Furthermore, for adiabatic computation the previously defined Hamiltonian H = H string + gV hop does not suffice: new interactions have to be included in the adiabatic Hamiltonian and the adiabatic parameter has to be chosen so that the ground state is a (weighted) superposition over all strings, thus encoding the computation.
We will take H(λ) = H string + H input + gH circuit (λ). Here H input is a term setting the initial internal state of the particles to the correct input state of the circuit: one can simply choose the proper occupation of sites on the left half of the lattice. If these initial states are set correctly, H input has zero energy and thus keeps the degeneracy between all correct strings. We will further neglect H input in the discussion here (see [25] for how H input makes the ground state of the quantum adiabatic computation unique).
We construct H circuit (λ) as a modification of V hop . Let us first do this for all plaquettes which correspond to single-qubit gates. Let a plaquette p enable a particle to hop from site (i, j) to (i + 1, j + 1) while there is a particle at the top of the plaquette, site (i + 1, j) and at the bottom of the plaquette (i, j + 1). The idea of the quantum adiabatic computation is to gradually turn on the motion/kinetic energy of the string using a parameter λ. Initially are the top and bottom sites. More precisely, we will take where V p hop is as before. The additional terms that we have thus added are diagonal in the string basis. Thus in the string subspace, the effective Hamiltonian just equals When the quantum circuit contains CNOT gates, we can define the adiabatic Hamiltonian in the same way, using Eq. (11). For certain plaquettes p in the CNOT region V p hop is chosen according to Eq. (9) and for a doubled-site (i, j) we simply use the definition n[i, j] = k n[i, j, k], that is, we use the total particle operator on the site. It can be shown for this effective Hamiltonian H eff circuit (λ) that one can rotate away the internal spin dynamics including the dependence on the position on the control qubits, see Appendix A. It then follows that we can represent the action of the effective Hamiltonian by a XXZ Heisenberg chain as in [25] in the string subspace spanned by 2m-bitstrings |z : In addition, the term H init can be represented as a kink boundary condition which allows this model to be exactly solvable: thus all previous results concerning the ground state and the gap in [25] apply to this effective Hamiltonian.

V. DUAL RAIL ENCODING: REQUIRED INTERACTIONS
There are different ways of representing the particle with spin physically: the simplest is a dual-rail encoding using two qubits to represent one spin-1/2 particle. We note that the fermionic nature of the particles in the construction is not relevant: each fermionic mode can be represented by a qubit where occupation of the mode is |1 and no occupation of the mode is |0 (see [33] for the argument). This means that the two fermionic modes of a particle with spin can be represented by two qubits. We label these two qubits as qubit 0 and 1. We can choose to represent a particle in state s = 0 as |10 01 , i.e. qubit 0 is |1 , particle in state s = 1 as |01 01 , no particle present is |00 01 and the two-qubit state |11 01 is not used as there is at most one particle present.
Thus, each creation operator a † s [i, j, k] (or annihilation operator a[i, j, k]) with spin-label s can be represented as a single-qubit operator σ + . This implies that all hopping terms in V hop , Eq. (6), are weak two-qubit terms of the general form In Fig. 5(c) we show these interactions for some specific single-qubit gates.
What about the diagonal terms in H string (or H circuit (λ), Eq. (11) For adiabatic quantum computing the Hamiltonian in Eq. (11) contains additional interactions which can be represented as weak Z and two-qubit ZZ interactions. In Fig. 5 we show the connectivity of the two-qubit interactions for Hamiltonian and adiabatic computing. One can note that qubits connected via Ising ZZ terms are never connected via XX+YY or XY+YX terms and vice versa. For Hamiltonian computing, each qubit 0 or 1 at a site v in the bulk of the lattice interacts with 8 other qubits, along the four different edges, via a ZZ interaction. When that qubit is part of the control particle of a CNOT gate, it interacts with 10 other qubits as the state-space is doubled on the central CNOT site.
If we assume that we intersperse single-qubit gates and CNOT gates with I gates, then each qubit interacts in addition with at most 3 other qubits via XX+YY and XY+YX interactions. For adiabatic computing each qubit at a site interacts in addition with 4 other qubits (above and below the site), via ZZ, see Fig. 5

(b).
A possible universal gate set is comprised of the T = diag(1, e π/4 ) gate, a CNOT gate and a Hadamard gate. For the T gate one needs to connect two qubits via a linear combination of XX+YY and XY+YX, see Fig. 5(c), which requires more physical interaction engineering than only XX+YY. Alternatively, one can use Hadamard and the Toffoli gate to get universality [34]. In this case both for the Hamiltonian computation and the adiabatic computation, one only needs the interaction ZZ, Z and ± XX+YY. The set of interactions ZZ, Z and -(XX+YY) are stoquastic (sign-free) and can be mapped via perturbative reductions onto a transverse field Ising model [29]. Note that in order to do the Hadamard gate one needs ± XX+YY and thus the quantum adiabatic Hamiltonian which realizes a universal computation using a Hadamard and Toffoli gate is not stoquastic or sign-free and is unlikely to map onto a transverse field Ising model quantum annealer. (not shown) use sites above and below the grid, similar strong ZZ edges and an X and I gate.

A. Physical Implementations
The methods for Hamiltonian quantum computation developed in this paper are potentially suitable for implementation on multiple physical platforms. In the form given here, we require (a) strong ferromagnetic ZZ interactions between neighboring qubits (plus strong local Z terms), and (b) weak XX+YY interactions. For example, superconducting transmon qubits may be suitable to realize the 2-qubit interactions for Hamiltonian computation described in this proposal. The strong ZZ interactions can be obtained by strong capacitively-coupled 'octmon' (in analogy with Xmon qubits [35]) qubits which have eight arms through which they couple with nearest-neighbors octmons. The weak XX+YY interaction between two qubits across a plaquette can be obtained by placing a bus-resonator on the plaquette through which both qubits couple. This resonator-mediated interaction through which the qubits can virtually exchange a photon is the basis of the iSWAP gate [36]. The coupling strength J of such term J(σ + i σ − j + σ − j σ + i ) scales as J = g 2 JC /∆ where ∆ is the detuning between resonator frequency and qubit frequency (assuming that both qubits are at the same frequency) and g JC is the Jaynes-Cummings coupling. The frequency of each bus-resonator and thus ∆ can be adjusted to fix the strength of the weak coupling J.
In such a physical set-up one would realize Hamiltonian computation in a rotating frame of each octmon qubit, where the rotating frame is chosen such that one retains single-qubit Z terms of the correct strength, as in Eq. (15), (16).
Adiabatic computation is less suitable for qubits whose spectrum is nondegenerate since the thermal environment tends to relax the qubits to their individual ground state |0 instead of the joint multiple-qubit ground state of the adiabatic Hamiltonian. Thus other qubits with a degenerate spectrum such as flux-qubits currently used in quantum annealing could be considered for an implementation of adiabatic computation.
A direct realization using electrons and their spins may also be possible: at least one can imagine a spin-dependent hopping term realizing the Hadamard gate. In this direct realization the Hamiltonian requires a strong attractive interaction between neighboring electrons propagating over one-dimensional lines (in the adiabatic model there is in addition a repulsive interaction between next-nearest neighbor electrons across a plaquette, see Fig. 5). One could consider using an particle/hole encoding alternating for adjacent wires so that particle and hole on nearest-neighbor wires attract via the Coulomb interaction (while repelling each other on next-nearest neighbor wires). Another idea is to use spin qubits localized in arrays of quantum dots and obtain the XX+YY coupling by letting two spin qubits virtually exchange a boson via a quantum bus. Such a quantum bus can be a superconducting microwave resonator as in e.g. [37] or a standing surface acoustic wave as proposed in e.g. [38]. Strong ZZ coupling could again be obtained via an electrostatic interaction.
We emphasize that these proposed implementations are simply sketches of how to attain the requisite interactions using existing technologies. Any quantum technology that allows the implementation of strong Ising couplings and weak hopping terms allows the construction of a Hamiltonian quantum computer in principle. In the next section we discuss various obstacles that stand in the way of constructing such quantum computers in practice.

VI. INACCURACY, NOISE AND ERRORS
Any physical implementation of the construction given here will be susceptible to manufacturing inaccuracies and to dynamic noise, which will induce errors in the computation.
Instead of simulating a one-dimensional quantum circuit the Hamiltonian or adiabatic computation could simulate a fault-tolerant quantum circuit. In general such fault-tolerant quantum circuit, for example the surface code architecture [31], is a 2D nearest-neighbor circuit. This implies that the time-independent Hamiltonian or adiabatic computation takes place on a 3D grid where the degrees of freedom are represented by a 2D-dimensional propagating membrane. Quantum measurements of subsets of qubits during the computation (to implement quantum error correction) can in principle be incorporated in any geometry by terminating the spatial regions of qubits which are to be measured so that they cannot propagate any further. No rigorous mathematical analysis of adiabatic or Hamiltonian computation on such a 3D grid with regions in which partial membranes terminate early has been undertaken, although one expects similar (spectral) results to hold as in the 2D grid case.
Running the encoded quantum circuit could provide protection against all errors or inacurracies in the Hamiltonian or adiabatic computation which can represented as errors on the qubits in the simulated fault-tolerant circuit as long as the induced errors have sufficient locality in space and time [39]. We discuss a few issues to be resolved. Consider what happens if the string dynamics is very slow so that a single-qubit noisy gate realized in some plaquette is repeatedly done and undone. It means that the error rate on this single-qubit gate will be high. It was argued in [25] that the forward motion of the string is constant in the expanding region of the grid, but does this still hold for a noisy version of the string motion?
Static disorder in the Feynman Hamiltonian leads to Anderson localization of the clock variable [40]. While the extended nature of the multi-clock string may render the Margolus Hamiltonian less susceptible to localization, no analysis of localization in this system has been performed.
Static or dynamic disorder in the ideal time-independent Hamiltonian or coupling to a finite temperature bath also leads to errors which represent leakage errors in the original encoded circuit. For example, in the dual rail encoding, amplitude damping on one of the qubits at a site leads to the state |00 , i.e. the loss of a particle. Bitflip errors on the pair of qubits at a site can lead to the state |11 and thus again a leakage error.
Another important source of errors (due to perturbative corrections, static disorder in the blocking terms or thermal activation of forbidden tunneling) leads to the string to become disconnected or incorrect. This can lead to the computation getting stuck: the forward motion of a particle 1 is blocked as the particle, say, 2, which gates this motion has already moved further in its computation. However the forward motion of particle 2 will continue to be blocked while its backward motion, rejoining particle 1, can lead to a lowering of its energy. Incorrect string states in which by some means a particle gets on the wrong CNOT track and picks up a X can be surpressed by making a CNOT gate long. One can thus expect that a sufficiently low-density of string breaks or wrong string turns can be dealt with by simulating a fault-tolerant quantum circuit which includes leakage protection.
Leakage errors are of course also an issue in circuit-based quantum computation requiring leakage reduction units such as quantum teleportation or swapping into fresh qubits (see e.g. [41] and references in [31]).

A. String Loops and Multiple-Time Wavefronts
Last but not least, we consider what happens when the number of particles on a line is not conserved, or in the dual-rail encoding, bit-flip errors generate new particles on the line. These are dangerous sources of errors which in the presented model can lead to lower energy states if we do not add additional penalty terms. If there is at most one particle per line the string always runs down the lattice as in Fig. 2. However, if one allows for errors which create new particles, then one can create a string which loops back onto itself. The terms of H string are such that when one particle is present on a site, it is favorable to have all nearest-neighbor sites be occupied with particles, so a string which comes from the top, loops back and closes onto itself will in fact have lower energy than the ground space of H string in the single-particle per line sector (as on the looping string there is one site where a particle has 3 neighbor particles, elsewhere each particle has 2 neighbors). But  One expects that the membrane computation in 3D will be more robust than string computation in 2D. A piece of open membrane which has been disconnected from the rest of the membrane computation costs an energy scaling with the perimeter of the membrane, thus suppressing the formation of large open disconnected membranes. Closed membranes are made energetically unfavorable by using no-loop terms as in the string computational model presented in this paper.

VII. CONCLUSION
This paper has shown how to perform universal Hamiltonian and adiabatic quantum computation using only two-qubit interactions and without higher-order perturbation gadgets.
Instead, energy penalties are used to enforce the desired Hamiltonian at lowest order. The resulting low-energy Hamiltonian could be used either in a dynamic fashion or in an adiabatic/quantum annealing context to encode the quantum computation in the ground state.
The construction given here was designed to be potentially physically realizable using large-scale quantum integrated circuits consisting of superconducting qubits or quantum dots.
Many open questions remain, notably how to deal with errors induced by manufacturing inaccuracy and by dynamic noise.
hopping along a one-dimensional wire and interactions between particles on different wires only use number operators. For a Hamiltonian of such a system the Jordan-Wigner transformation mapping fermions onto qubits (i.e. upon ordering all the fermionic sites i = 1, . . . , N one represents a † i → Z 1 . . . Z i−1 σ + i ) does not introduce any long-range Z-like interactions. However, the construction contains loops of hopping fermionic terms when CNOT gates are included in the circuit. In a loop, one inevitably has hopping terms a † i a j for j = i ± 1 which under the Jordan-Wigner transformation become for i < j, a † i a j → σ + i Z i . . . Z j−1 σ − j . However, there is at most one particle in any such loop, which means that if the action of such terms is states of the control particles through which the string z goes. Clearly, the number of these additional labels k(z) depends on the string z, i.e. some strings do not have any additional labels.
We can write P correct string = z,s |z, s z, s|.
Let V (z, s|z , s ) be the transformation on the internal states which is executed by the circuit in going from a correct string (z , s ) to another correct string (z, s). In other words, V is the total matrix-valued amplitude of the path from string (z , s ) to (z, s). We can write H eff = −g (z,s) (z ,s )∈Neigh(z,s) V (z, s|z , s )|z, s z , s |.
where Neigh(z, s) are the correct strings which are neighbors of (z, s) meaning that conditional hopping terms in H eff can map (z, s) onto (z , s ) and vice versa.
In addition, we have the composition V (z, s|z , s ) = s V (z, s|z , s )V (z , s |z , s ) where V (z, s|z , s ) is independent of the intermediate string z : all paths from (z , s ) to (z, s) execute the same computation independent through which intermediate string z they go. A transformation V (z|z , s ) is unitary on the internal state space if the string z has no control particle labels, hence we do not post-select the dynamics on the final state of some control particles. It also holds that V † (z, s|z , s ) = V (z , s |z, s).
We write down an isometry W such that W † H eff W is a transition matrix in the string subspace |z independent of the internal dynamics and the spin-labels s: so that W † W = z |z z| = P string . Note that W is an isometry as it maps from the string space to a higher-dimensional correct string space where the string has additional labels.
Using that s V (z, s|z , s )V (z , s |z init ) = V (z, s|z init ), V (z|z) = I etc., one obtains representing only the string dynamics on the grid.
In the quantum adiabatic computation the effective Hamiltonian, Eq. (11) is slightly different than the Hamiltonian in Eq. (A1). It includes a diagonal term of the general form z,s α z |z, s z, s| where the weights α z do not depend on the internal states of the control particles s. Conjugation with W of such term gives W † z,s α z |z, s z, s|W = z α z |z z|, again removing the internal control particle labels. In addition, the effective Hamiltonian includes a diagonal term H input which penalizes the internal states of particles before they run through the computation: this means that the strings (z, s) for which this term is nonzero are always strings z without control-particle labels and V (z, s|z init ) = V (z|z init ) = I, or the dynamics from z init to these strings z is trivial. This implies that conjugation by W leads to a term which penalizes the internal state of particles before the computation is executed, identical to the effect of such term in [25].
In all, what these arguments show is that even for a circuit with CNOT and Toffoli gates, one can transform away the unitary dynamics of the computation and obtain a model which purely represents the string dynamics. One can then invoke the previous results which analyze the string dynamics in the case of Hamiltonian computation (XY model) or quantum adiabatic computation (ferromagnetic XXZ chain with kink boundary conditions, Eq. (13)).
It can be noted that the inclusion of higher-order terms in the perturbative expansion (of O(g k+1 /∆ k )) in the correct string subspace do not affect the validity of this analysis.
Such higher-order terms, due to multiple hopping, lead to new terms in Eq. (A1) of the form γ z,z V (z, s|z , s )|z, s z , s | for some coefficients γ zz where (z, s) and (z , s ) are not direct neighbors, but are connected through multiple hops.