# Spectral Gap Amplification

###### Abstract

Many problems can be solved by preparing a specific eigenstate of some Hamiltonian . The generic cost of quantum algorithms for these problems is determined by the inverse spectral gap of for that eigenstate and the cost of evolving with for some fixed time. The goal of spectral gap amplification is to construct a Hamiltonian with the same eigenstate as but a bigger spectral gap, requiring that constant-time evolutions with and are implemented with nearly the same cost. We show that a quadratic spectral gap amplification is possible when satisfies a frustration-free property and give for these cases. This results in quantum speedups for optimization problems. It also yields improved constructions for adiabatic simulations of quantum circuits and for the preparation of projected entangled pair states (PEPS), which play an important role in quantum many-body physics. Defining a suitable black-box model, we establish that the quadratic amplification is optimal for frustration-free Hamiltonians and that no spectral gap amplification is possible, in general, if the frustration-free property is removed. A corollary is that finding a similarity transformation between a stoquastic Hamiltonian and the corresponding stochastic matrix is hard in the black-box model, setting limits to the power of some classical methods that simulate quantum adiabatic evolutions.

Keywords: Quantum Algorithms, Adiabatic Quantum Computing, Quantum Monte-Carlo

## I Introduction and summary of results

Many problems in physics and optimization, such as describing quantum phases of matter or solving satisfiability, can be reduced to the computation of low-energy states of Hamiltonians (see, e.g.sachdev_2001 (); farhi:qc2001a ()). Methods to compute such states exist, with adiabatic state transformation (AST) being one of the most acknowledged and powerful heuristics for that goal amara:qc1993a (); finnila:qc1994a (); kadowaki:qc1998a (); farhi_quantum_2000 (); farhi:qc2001a (); farhi_quantum_2002 (). The problem in AST involves transforming a pure quantum state into ; these being the endpoints of a state path , , where each is an eigenstate of a Hamiltonian . Quantum strategies to solve the AST problem typically require evolving with the Hamiltonians for time , which determines the cost of the method. A well-known example is given by the quantum adiabatic theorem and requires changing the interaction parameter sufficiently slowly in time messiah_1999 (); jansen_bounds_2007 (), but more efficient strategies exist boixo:qc2009a (); wocjan_speed-up_2008 (); boixo:qc2010a (). When direct access to Hamiltonian evolutions is not possible, such evolutions can be simulated in the standard quantum circuit model by means of Trotter-Suzuki-like formulas berry_efficient_2007 (); wiebe_product_2010 (); papageorgiou_efficiency_2010 (). For these cases, the cost of the method does not only depend on , but also depends on the additional cost of approximating fixed-time Hamiltonian evolutions by quantum circuits. For this reason, it is standard to restrict to those whose fixed-time evolutions can be approximated by quantum circuits of small size (e.g., size bounded by constant-degree polynomials).

Let be the angular length determined by and the spectral gap to the other nearest eigenvalue of . Recently, we provided fast quantum methods for eigenpath traversal that do not exploit the structure of the Hamiltonians and solve the AST problem in time boixo:qc2010a (). Such methods were shown to be optimal in a black-box model boixo:qc2009b (). However, the results in Ref. boixo:qc2009b () do not forbid the existence of faster methods for solving the AST problem if additional knowledge about the structure of is available. Our paper focuses on this observation and introduces the spectral gap amplification problem or GAP. Basically, we intend to answer: Can we construct a Hamiltonian that also has as eigenstate, but spectral gap ?

When spectral gap amplification is possible, it can be used as a technique to find new quantum speedups in both, the Hamiltonian-based model and the quantum circuit model. In Refs. somma_quantum_2008 (); somma_optimization_2010 (), for example, we constructed the so-called quantum simulated annealing algorithm that provided speedups of the well-known simulated annealing method implemented using Monte-Carlo. The reason for such speedups is a gap amplification step: if is the spectral gap of the stochastic matrix used in Monte-Carlo, there is a Hamiltonian with spectral gap and eigenstate that allows to sample from the fixed point of . To build we used previously-developed tools for quantum walks szegedy_quantum_2004 (); ambainis_walk_2004 ().

Motivated by the results in Refs. somma_quantum_2008 (); somma_optimization_2010 () we study the GAP in different scenarios. We first show that, for Hamiltonians that satisfy a frustration-free property perez_PEPS_2008 (); bravyi_stoquastic_2009 (); beaudrap_frustfree_2010 (); wolf_phase_2006 (), a quadratic spectral gap amplification is possible and optimal in some suitable black-box model. Quadratic spectral gap amplification was previously known only for Hamiltonians that result from a similarity transformation of stochastic matrices szegedy_quantum_2004 (); somma_quantum_2008 (); somma_optimization_2010 (). These Hamiltonians, which are the so-called discriminants, are also stoquastic, i.e. the off-diagonal entries are non-positive. A direct consequence of our new construction is that spectral gap amplification can now be achieved for any frustration-free Hamiltonian as those used in quantum adiabatic simulations of quantum circuits, improving upon the results in Refs. aharonov_adiabatic_2007 (); mizel_equivalence_2007 (); aharonov_line_2009 (). The eigenstate in our construction is not the lowest-energy state of the Hamiltonian induced by the quantum circuit (which was the case in Refs. aharonov_adiabatic_2007 (); mizel_equivalence_2007 (); aharonov_line_2009 ()). Nevertheless, techniques for AST work for any eigenstate and still apply to our case, giving more efficient quantum adiabatic simulations to prepare the circuit’s output state. In addition, some low-energy eigenstates of general frustration-free Hamiltonians (termed PEPS) were shown to play an important role in physics, renormalization, and optimization verstraete_peps_2006 (); wolf_phase_2006 (); perez_PEPS_2008 (): PEPS are useful variational states reproducing the local physics with high accuracy verstraete_peps_2004 (); verstraete_peps_2006 (). Our method for spectral gap amplification can be used to speedup the preparation of PEPS on a quantum computer, with an expected improvement of other methods for this goal (e.g., schwarz_peps_2011 ()).

Interestingly, it is hard to achieve spectral gap amplification for general Hamiltonians that do not satisfy the frustration-free property. It would otherwise imply fast quantum methods for some problems, contradicting known complexity bounds in the oracle setting bennett_searchbound_1997 (). In addition, a natural generalization of our technique for spectral gap amplification would output a Hermitian operator only if the input Hamiltonian is semidefinite positive (as is the case for frustration-free Hamiltonians). Such a generalization could then be used to solve the decision problem of whether a given is semidefinite positive or not (with some small error bound), and provide an estimate to the lowest eigenvalue of . This is a complete problem for the class QMA kitaev_computation_2002 (), and finding its solution may require a quantum circuit of undesirably large size.

The result on the impossibility of general spectral gap amplification has additional implications on the power of classical methods that solve the AST problem. For example, some stoquastic Hamiltonians can be mapped to stochastic matrices through a similarity transformation somma_thermod_2007 (); bravyi_stoquastic_2008 (); bravyi_stoquastic_2009 (). The fixed point of the stochastic matrix coincides with the distribution induced by the ground state of the Hamiltonian. The stochastic matrix would allow us to build a Monte-Carlo method to sample from the fixed point and classically solve the AST problem in this case. The same similarity transformation could then be used to give a frustration-free representation of the Hamiltonian verstraete_peps_2006 (); somma_thermod_2007 (), allowing us to use the results for frustration-free Hamiltonians to amplify the gap. This contradicts the impossibility result, implying that finding the transformation is hard (in the black-box setting).

We organize the manuscript as follows. First, in Sec. II we define the GAP in more detail and present some methods for the proofs of the quadratic amplification in the frustration-free case, and for the impossibility of amplification in general. In Sec. III we show the construction of for frustration-free Hamiltonians. In Sec. III.1 we prove that the cost of implementing evolutions under is nearly the same as the cost of implementing evolutions under in the black-box model, and present a simulation method. In Sec. III.2 we prove that the quadratic amplification is optimal for frustration-free Hamiltonians in this black-box model. In Sec. IV we comment on the advantages of our gap amplification construction for the adiabatic simulation of quantum circuits and give a local Hamiltonian. In Sec. V we prove that no gap amplification is possible for general Hamiltonians in the black-box model. This results in limits on the power of classical simulations for quantum systems, that are discussed in Sec. VI. We conclude in Sec. VII.

## Ii Definitions and methods

We first comment on the implementation cost of Hamiltonian evolutions. Ignoring precision, we assume Hamiltonians given as black boxes that implement the evolution on ancilliary input , satisfying . When we write for the Hamiltonian, we assume a modified black-box that implements on ancilliary input . Such a black box is typically an efficient quantum circuit in applications. We write for the black-box. The implementation cost of in the black-box model, where is the Hamiltonian resulting from the gap amplification construction applied to , will be the number of times is called to implement the operation in either case.

###### Definition 1

Let be a finite-dimensional Hamiltonian, a (unique) eigenstate of with eigenvalue , and the gap to the other nearest eigenvalue of ; i.e. is the spectral gap. The goal of the GAP is to find a new Hamiltonian that has as (unique) eigenstate and spectral gap , for . is any subsystem’s state for which an efficient quantum circuit is known. The implementation cost of in the black-box model must be of the same order as the implementation cost of .

The last requirement forbids naive constructions such as for and is needed to carry quantum speedups from the Hamiltonian-based model, in which the cost is the evolution time, to the black-box model, in which the cost is the number of black boxes. If both and are sparse with a bounded number of (efficiently computable) non-zero entries per row and matrix oracles for the are provided, the last requirement can be satisfied somma_physics_2002 (); aharonov_adiabatic_2003 (); berry_efficient_2007 (); childs_efficient_2010 ().

###### Definition 2

A Hamiltonian is frustration free if it can be written as , with (known) , projectors, and . Further, if is a lowest-eigenvalue eigenstate (ground state ) of , then .

is then a ground state of every term in the decomposition of . We will assume that when there is no loss of generality. Then is still frustration free, it has as ground state, it has at least the spectral gap of , and . While the ’s may be local operators, we do not make that assumption here. It will suffice to have access to the black box .

We consider the unstructured search problem or SEARCH to prove the optimality of quadratic gap amplification for frustration-free Hamiltonians and also the impossibility of gap amplification for general Hamiltonians. We introduce SEARCH and describe a simple variant of Grover’s algorithm to solve it.

###### Definition 3

Consider a family of Boolean functions or oracles , with domain , that satisfy . The goal of SEARCH is to find the unknown word , with high probability, by querying the least possible number of times.

For quantum algorithms, we use a reversible version of defined as

(1) |

with . We refer to as the search oracle. Quantum algorithms that solve SEARCH with uses of , and other -independent operations, exist bennett_searchbound_1997 (); farhi_analog_1998 (). Classical algorithms require queries to .

From Ref. childs_quantum_2002 () we can give a quantum algorithm to solve SEARCH using projective measurements.

###### Lemma 1

Let be a family of Hamiltonians with unique eigenstates satisfying and , where is the equal superposition state. A quantum algorithm can find with cost , where is a bound on the eigenvalue gap of .

###### Proof 1

The probabilities and are bounded independently of . If we initialize a quantum computer in and next we perform two projective measurements of and , respectively, we can find with probability no smaller than . The cost of this method is measured by , the time of evolving with . This is needed to simulate the measurement of , with high accuracy, using the well-known phase estimation algorithm kitaev_quantum_1995 (); childs_quantum_2002 () or by phase randomization boixo:qc2009a (). The cost is dominated by the inverse gap of . In optimal constructions, so that .

## Iii GAP: Frustration-free Hamiltonians

When a Hamiltonian is frustration free, local, and stoquastic bravyi_stoquastic_2008 (), we could use the results in Ref. bravyi_stoquastic_2009 () and Refs. somma_quantum_2008 (); somma_optimization_2010 () to build a Hamiltonian with a quadratically bigger spectral gap. In that case, is the so-called discriminant of a Markov process or stochastic matrix. Such a construction uses tools from quantum walks szegedy_quantum_2004 () to speed up Markov chain based algorithms and requires full knowledge of each . Here, we present a novel and more efficient technique that allows for quadratic gap amplification of any frustration-free Hamiltonian, without the requirement of being local and stoquastic. Later we show that this technique provides the optimal amplification and present a black-box simulation method for the evolution with that does not require full knowledge of each .

###### Theorem 1

Let be a frustration-free Hamiltonian, a ground state, and the spectral gap or smallest nonzero eigenvalue. Then, there exists satisfying and eigenvalue gap . The dimension of the null space of is that of the null space of .

###### Proof 2

The proof is constructive. We let

(2) |

be a Hamiltonian, and a rank-one projector acting on . It is easy to show that for . We define the unitary operator

(3) |

with the identity matrix whose dimension will be clear from context (here it is ). The implementation of requires a single black box and . In addition, is an ancilliary state and its projector. Because , quantum circuits that prepare efficiently exist (e.g. somma_physics_2002 ()).

We define the Hamiltonian

(4) |

If are the eigenstates of with eigenvalues , leaves invariant the at most two-dimensional subspace spanned by , for all . To show this, we need an important property that is a consequence of our construction:

(5) |

The eigenvalues of are and the eigenstates are also the . To avoid technical issues we assume that . If this were not the case, the projector could be easily modified so that instead, and the assumption is fulfilled. We can think of as being , so that is the angular distance between the states and (Fig. 1). When is such that , we have and is one dimensional. This implies that is an eigenstate of of eigenvalue 0. When , Eq. (5) gives , and is invariant in .

When (or ), we define as the unit state orthogonal to in the subspace . We can use simple geometry arguments (Fig. 1) to show that the two-dimensional block of in the basis is

(6) |

The eigenvalues of in this subspace are . Because , a quadratic amplification in the spectral gap follows.

We need to account for a small technical issue to obtain . acts trivially on any other eigenstate orthogonal to . The dimension of the null space of is much larger than the dimension of the null space of . Usually, this poses no difficulty in the AST problem because does not generate transitions between the states and any other state in the null space of . In those cases we can assume so that . Otherwise, since , we can easily remove the unwanted degeneracy of by adding a “penalty term” to those states whose ancilliary register is not in . That is,

(7) |

for some determined below. Note that, if , is still in the null space of . For , the matrix of in is

(8) |

It suffices to choose to guarantee that , the eigenvalues of in this subspace, satisfy . The gap of is then and the dimension of the null space of coincides with that of the null space of .

Our choice of uses , which may be unknown. We can then safely use a lower bound on the spectral gap of , , and build using instead. The loss is that the resulting gap of may not be the largest possible. However, this is not a drawback if we use (or ) for the AST problem. As mentioned, the relevant spectral gap is of order even if is unknown, and the role of is unimportant in this case.

### iii.1 Black-box simulation

In a Hamiltonian-based model of quantum computation, a gain on the spectral gap readily provides a quantum speedup for the AST problem. This model assumes the ability of evolving under , i.e. applying directly. To carry those speedups to the quantum circuit model, we need a way of approximating a fixed-time evolution by a short sequence of gates. Usually, such a sequence is obtained by using Trotter-Suzuki-like approximations berry_efficient_2007 (); wiebe_product_2010 (). In those approximations, the evolution of a Hamiltonian is built upon short-time evolutions under each , and each such evolution is written as a constant-size sequence of gates somma_physics_2002 (). In other words, what determines the size of the circuit that approximates is the implementation cost as given by the number of uses of , the black box described in Sec. II. Here we describe a simulation method for whose overall cost is almost linear in . In most cases this result implies a quantum speed-up, in the circuit model, for those methods that solve the AST problem using paths of frustration-free Hamiltonians.

###### Lemma 2

For any and , there is a black-box simulation of that requires using the black box times, , and satisfies .

###### Proof 3

Up to a trivial offset, , with , , and . We can then use known results on Hamiltonian simulations aharonov_adiabatic_2003 (); berry_efficient_2007 (); childs_efficient_2010 (); papageorgiou_efficiency_2010 () to approximate at precision by a sequence of concatenated evolutions under and . For fixed and , is constant. The proof follows by noticing that

(9) |

i.e. it requires two uses of , and each can be implemented using once on input . Evolutions under for any time do not require the black box and can be implemented with a quantum circuit of size or smaller.

### iii.2 Optimal amplification

We are interested in finding the biggest spectral gap amplification possible for frustration-free . To this end, we consider the set of all those that have as eigenstate and such that evolving with for time can be done using black boxes ; i.e. is constant. Under these assumptions, the quadratic spectral gap amplification is optimal in the black-box model:

###### Theorem 2

.

###### Proof 4

We sketch the proof here and leave the full version in Appendix A. We consider instances , unknown, that can be used to solve SEARCH as described in Lemma 1. Each is frustration free and the spectral gap is of order . The corresponding black box can be implemented with a single call to the search oracle of Eq. (1). If is the Hamiltonian with the amplified gap , SEARCH can be solved by evolving with for time . By assumption, this would require using black boxes and thus search oracles. The lower bound on SEARCH implies , with .

## Iv Gap amplification and adiabatic quantum computation

A property of our spectral gap amplification method is that it yields quantum speed-ups for the AST problem. It is also important to describe additional advantages of the method, including the simulation of quantum circuits. It is known that any quantum circuit specified by quantum gates can be simulated, in a Hamiltonian-based model, by an adiabatic quantum evolution involving frustration-free Hamiltonians . For , the ground state of has large overlap with the state output by the quantum circuit. In some constructions, and denotes nearest-neighbor (two-body) interactions between spins of corresponding many-body systems in one or two-dimensional lattices aharonov_line_2009 (); aharonov_adiabatic_2007 ().

The cost of the adiabatic simulation depends on the inverse minimum gap of , . We can therefore use our gap amplification construction for frustration-free Hamiltonians to speed-up the adiabatic simulation. However, in doing so, we encounter difficulties regarding the locality of . For example, the projector can be interpreted as an interaction term involving qubits and this is undesired if we want to find a physical whose interactions address a limited number of subsystems. A simple procedure to avoid many-body terms is to consider each state in as a state of qubits of the form

(10) |

The subspace defined by Eq. (10) is typically termed the single-particle subspace. The terms appearing in map to , with , and the corresponding Pauli operator. The terms map to . In this subspace,

(11) |

If the are two-subsystem interaction terms, will map to a combination of four-subsystem terms. This makes local but not spatially local. We also note that, while the overall spectrum of may have changed because of the mapping, the spectrum of in the single-particle subspace corresponds to the one analyzed in Sec. III.

We note that our construction to amplify the gap is not unique. Indeed, as seen in Appendix B, the Hamiltonian

(12) |

has a similar property: its eigenvalues are . Note that if we can modify it as
.
The action of in the single-particle subspace is equivalent to that of
^{1}^{1}1The corresponding states are still those in Eq. (10),
but each having qubits labeled from (left) to (right).

(13) |

To eliminate the degeneracy of the null eigenvalue in this subspace, we can proceed as in Sec. III and add a term proportional to , so that

(14) |

The relevant spectral gap of in the single-particle subspace is still of order .

Nevertheless, an unwanted degeneracy of the null eigenvalue from other (many-particle) states is possible. (Note that any eigenstate in the 0-particle subspace has eigenvalue exactly ). To remove such a degeneracy we set “penalties” to states that belong to different particle subspaces. To this end, we note that

(15) |

where is proportional to the so-called spin raising operator. Let be the eigenstates of , with eigenvalue , and total spin proportional to . Then, , , and

(16) |

It implies

(17) | ||||

where denotes the state of the qubit in the -th position. The operator leaves the -particle subspace invariant, and we write . From Eqs. (16) and (17), the eigenvalues of in that subspace are bounded from above by . The upper bound to the absolute value of the eigenvalues of , in that subspace, is .

We define and note that acts trivially in the single-particle space and nontrivially elsewhere. We also define

(18) |

. acts invariantly in the -particle subspaces. The eigenvalues of are then bounded from below by

(19) |

For the specific case of , , we already know that the eigenvalues of are in the range ; this case corresponds to the single-particle one whose spectrum was analyzed previously. Also, for , , all the eigenvalues coming from the -particle subspaces do not mix with the eigenvalues of the single-particle subspace, and the potentially high degeneracy of the null space is avoided. For the exact eigenvalues of are if .

Summarizing, the Hamiltonian

(20) |

has as unique eigenstate of eigenvalue 0, and all other eigenvalues are at distance at least if . can be regarded as a physical Hamiltonian. In Fig. 2 we represent for the case in which is the frustration-free Hamiltonian of a system in one spatial dimension, and .

The construction in Ref. aharonov_line_2009 ()
leads indeed a family of frustration-free Hamiltonians in one spatial dimension.
For a quantum circuit with gates,
the spectral gap of in Ref. aharonov_line_2009 () can be made of order
^{2}^{2}2We acknowledge discussions with S. Irani..
in Eq. (20) allows us to amplify the gap
up to order , with an important gain if and .

## V GAP: General Hamiltonians

We show that spectral gap amplification is not possible for general Hamiltonians in the black-box model. Again, we consider instances whose unique ground states can be used to solve SEARCH as in Lemma 1. As before, the cost of an evolution with is the number of black boxes required to implement it. We obtain:

###### Theorem 3

There are stoquastic (sparse) Hamiltonians for which spectral gap amplification is not possible.

###### Proof 5

The result will follow again from the known lower bound on SEARCH. We consider the family with

(21) |

and unknown. The constant will be specified later and is a symmetric matrix proportional to the adjacency matrix of a square lattice in five spatial dimensions. The matrix entries of are if is an edge in the lattice and otherwise. is sparse and independent of the unknown . In this case we assume a matrix oracle for . This is stronger than in the sense that can be implemented with a single call to . Further, by construction, requires calling the search oracle of Eq. (1) only once.

We present some useful properties of and refer to Ref. childs_spatialsearch_2004 () for details. There is a phase transition point at where the spectral gap is

(22) |

and

(23) | ||||

(24) |

Then, the ground state has good overlap with both and as in Lemma 1. SEARCH can be solved with cost using the black boxes or, similarly, the search oracles. If gap amplification for were possible, this would yield a faster method to solve SEARCH. The proof follows by contradiction.

## Vi Stoquastic vs. stochastic matrices

Because stoquastic Hamiltonians do not suffer from the so-called sign problem suzuki_qmc_1998 (), an important task is to devise classical probabilistic methods to solve the AST problem by sampling from the distribution as determined by the ground state. A well-known method for this purpose is quantum Monte-Carlo (QMC) anderson_montecarlo (). Another method may be obtained by finding a diagonal similarity transformation that maps stoquastic Hamiltonians to stochastic matrices bravyi_stoquastic_2009 (). The fixed point of the resulting Markov chain is the desired distribution. Contrary to QMC, this second method requires knowledge of the ratio of amplitudes of the ground state for the mapping. Our result on no gap amplification for all stoquastic Hamiltonians implies that finding the transformation to stochastic matrices should be hard in the black-box model. Otherwise it would imply a method to amplify the gap by following the results on frustration-free Hamiltonians.

We can go further and give a family of stoquastic Hamiltonians for which classical probabilistic methods, that solve the AST by sampling from the ground state, has a large black-box implementation cost. For some QMC algorithms, our result implies that the spectral gap of the constructed stochastic matrix rapidly decreases with the problem size. Once more, our proof considers a family of Hamiltonians such that sampling from the ground state of outputs the unknown with large probability.

###### Lemma 3

Consider the family of Hamiltonians

(25) |

where is independent of and . Then, the lowest eigenvalue is bounded as , the spectral gap satisfies , and the ground state has large support on , i.e. .

###### Proof 6

(Sketched) All results can be simply proved by considering and using perturbation theory in the range for .

If is stoquastic and irreducible, the ground state of is , with . In this case we let be a stochastic matrix whose fixed point is almost the distribution . We assume that a matrix oracle for follows from a matrix oracle for . The latter requires using the (classical) search oracle only once: for input , the matrix elements of in the th row depend on whether or not. In path integral QMC, for example, can be constructed efficiently as follows. For sufficiently large the probability is (almost) proportional to

(26) |

Because , it suffices to choose to bound the approximation error. Next, because the exponentiation of might be hard to compute, we write , with , and approximate . We can relate with a “classical system” (diagonal Hamiltonian) that acts on a larger Hilbert space of dimension . More precisely, we define

(27) |

with . Note that . The computation of any diagonal entry of requires evaluating matrix elements of and thus the same number of search oracles. Sampling from the distribution determined by requires choosing an appropriate Markov chain, like the one in the Metropolis algorithm. From known complexity bounds on the search problem, any choice of Markov chain will lead, in the black-box model, to a mixing time

(28) |

## Vii Conclusions

We introduced and studied the spectral gap amplification problem or GAP. The goal is to efficiently construct a Hamiltonian that has the ground state of a given Hamiltonian as eigenstate, but a bigger spectral gap. This problem is motivated by the results in Ref. somma_quantum_2008 (), where we showed quantum speedups of Monte-Carlo methods by giving a quadratic gap amplification for a specific family of Hamiltonians. The GAP has important applications in adiabatic quantum computing and other methods for adiabatic state transformations, where the implementation cost is dominated by the inverse gap: If gap amplification is possible, this results in a quantum speedup.

We showed that a quadratic spectral gap amplification is indeed possible for frustration-free Hamiltonians. This generalizes the results in Ref. somma_quantum_2008 () and gives a more efficient construction to speedup classical Markov-chain based methods. In a suitable black-box model, we proved that our method provides the biggest amplification possible. The result for frustration-free Hamiltonians also provides more efficient quantum adiabatic methods to simulate quantum circuits and for the preparation of projected entangled pair states or PEPS.

We presented a family of Hamiltonians for which spectral gap amplification is not possible under some assumptions. The Hamiltonians in this case can be sparse and stoquastic. They are constructed so that by preparing their ground states one can solve the unstructured search problem, and then use known lower complexity bounds to prove the impossibility result by contradiction. A corollary is that classical probabilistic methods that sample from the ground state distribution of some Hamiltonians may require a large implementation cost.

## Acknowledgments

RS thanks Aaron Allen (UNM), Jonas Anderson (UNM), Stephen Jordan (NIST), and Barbara Terhal (IBM) for discussions on constructions of local Hamiltonians, A. Childs (IQC) for pointing out Ref. childs_spatialsearch_2004 (), and Andrew Landahl for discussions on constructions of local Hamiltonians. RS acknowledges support from the National Science Foundation through the CCF program, and the Laboratory Directed Research and Development Program at Los Alamos National Laboratory and Sandia National Laboratories. SB thanks the National Science Foundation for support under grant PHY-0803371 through the Institute for Quantum Information at the California Institute of Technology and Lockheed Martin.

## Appendix A Proof of optimal amplification

Each is a symmetric matrix related to the adjacency matrix of a sparse expander graph . is the number of vertexes, is the degree of , and is the second largest eigenvalue of . WLOG, (e.g., a Ramanujan graph). Before specifying in a frustration-free form, we define by its matrix elements as follows:

(29) |

is the set of edges of the graph . has the following unique ground state of eigenvalue 0:

(30) |

This state satisfies the requirements of the algorithm in Lemma 1: has constant overlap with and the equal superposition state. Since is unknown, the preparation of will allow us to solve SEARCH.

We can bound the spectral gap of in terms of . We define . Because , the norm of is . We can write , with and a unit state orthogonal to , to obtain

(31) |

An upper bound on the rhs of Eq. (31) implies a lower bound on the gap. We write . The first term on the rhs of Eq. (31) is

(32) |

We use

(33) |

and

(34) |

to show

(35) |

Further, from the diagonal matrix elements of , we have ():

(36) |

Finally, if is the projector onto the orthogonal subspace of , then the third term in the rhs of Eq. (31) is bounded by . In addition,

(37) |

where is the adjacency matrix of . If is the equal superposition state, , and this is the only eigenstate of with largest eigenvalue . We can write

(38) |

and consequently,

Because the second largest eigenvalue of is , we obtain

(39) |

Using Eqs. (35), (36), and (39), we get

(40) |

The maximum is found when satisfies

(41) |

Inserting Eq. (41) in Eq. (40), and since , yields

(42) | ||||

(43) |

for . This implies

(44) |

We now focus on the specification of (or a modified version ) as a frustration-free Hamiltonian. To this end, we first describe a particular choice for the projectors appearing in . We define the function

(45) |

We also define as the set of ordered pairs of edges in , where each edge appears only once. That is, if , then either or appears in . For each edge we define the (unnormalized) state

(46) |

Then,

(47) |

as the matrix entries coincide with those in Eq. (29). Because for all edges, is frustration free.

For consistency with the definitions in previous sections, we define the projectors

(48) |

and the corresponding modified Hamiltonian

(49) |

is still the unique ground state of . Since

(50) |

the spectral gap of is also bounded from below as .

The number of terms in Eq. (49) grows with the number of edges in the graph, . It is convenient to reduce the number of projectors so that , and playing no significant role in the scaling of the amplified gap. We then assume a given edge coloring of the graph with edge chromatic number of order vizing1964 () [i.e., ]. Let be the different colors. All the projectors belonging to one of the colors are, by construction, orthogonal to each other as they don’t share a vertex. For each , we define the projectors

(51) |

Then, .

The specification of in this proof is as follows. For each we assume the existence of a reversible version of the matrix oracle that, on input , it outputs , where is the only vertex that shares an edge of coloring with . Note that all the matrix elements are equal unless or