Searcharxiv⌕ Search

arXiv subjects

Edward Farhi

Publications and source records attributed to Edward Farhi.

68 records · Page 4Linked to original sources
arXiv2000

Finding cliques by quantum adiabatic evolution

Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n <= 18), the quantum algorithm appears to require only a quadratic run time.

quant-ph↗
arXiv2000

A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability

Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm requires a running time that grows as a polynomial in the number of bits. In this paper we present numerical results on randomly generated instances of an NP-complete problem and of a problem that can be solved classically in polynomial time. We simulate a quantum computer (of up to 16 qubits) by integrating the Schrodinger equation on a conventional computer. For both problems considered, for the set of instances studied, the required running time appears to grow slowly as a function of the number of bits.

quant-ph↗
arXiv2000

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.

quant-ph↗
arXiv1999

Invariant Quantum Algorithms for Insertion into an Ordered List

We consider the problem of inserting one item into a list of N-1 ordered items. We previously showed that no quantum algorithm could solve this problem in fewer than log N/(2 log log N) queries, for N large. We transform the problem into a "translationally invariant" problem and restrict attention to invariant algorithms. We construct the "greedy" invariant algorithm and show numerically that it outperforms the best classical algorithm for various N. We also find invariant algorithms that succeed exactly in fewer queries than is classically possible, and iterating one of them shows that the insertion problem can be solved in fewer than 0.53 log N quantum queries for large N (where log N is the classical lower bound). We don't know whether a o(log N) algorithm exists.

quant-ph↗
arXiv1998

Quantum Computation and Decision Trees

Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.

quant-ph↗
arXiv1998

Finite Quantum Fluctuations About Static Field Configurations

We develop an unambiguous and practical method to calculate one-loop quantum corrections to the energies of classical time-independent field configurations in renormalizable field theories. We show that the standard perturbative renormalization procedure suffices here as well. We apply our method to a simplified model where a charged scalar couples to a neutral "Higgs" field, and compare our results to the derivative expansion.

hep-th↗
arXiv1997

Quantum Mechanical Square Root Speedup in a Structured Search Problem

An unstructured search for one item out of N can be performed quantum mechanically in time of order square root of N whereas classically this requires of order N steps. This raises the question of whether square root speedup persists in problems with more structure. In this note we focus on one example of a structured problem and find a quantum algorithm which takes time of order the square root of the classical time.

quant-ph↗
arXiv1996

An Analog Analogue of a Digital Quantum Computation

We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where $| w>$ is an unknown (normalized) state. We show how to discover $| w >$ by adding a Hamiltonian (independent of $| w >$) and evolving for a time proportional to $N^{1/2}/E$. We show that this time is optimally short. This process is an analog analogue to Grover's algorithm, a computation on a conventional (!) quantum computer which locates a marked item from an unsorted list of N items in a number of steps proportional to $N^{1/2}$.

quant-ph↗
arXiv1995

Gauge Invariant Variables for Spontaneously Broken SU(2) Gauge Theory in the Spherical Ansatz

We describe classical solutions to the Minkowski space equations of motion of SU(2) gauge theory coupled to a Higgs field in the spatial spherical ansatz. We show how to reduce the equations to four equations for four gauge invariant degrees of freedom which correspond to the massive gauge bosons and the Higgs particle. The solutions typically dissipate at very early and late times. To describe the solutions at early and late times, we linearize and decouple the equations of motion, all the while working only with gauge invariant variables. We express the change in Higgs winding of a solution in terms of gauge invariant variables.

hep-ph↗
arXiv1994

Energy-Momentum Restrictions on the Creation of Gott Time Machines

The discovery by Gott of a remarkably simple spacetime with closed timelike curves (CTC's) provides a tool for investigating how the creation of time machines is prevented in classical general relativity. The Gott spacetime contains two infinitely long, parallel cosmic strings, which can equivalently be viewed as point masses in (2+1)-dimensional gravity. We examine the possibility of building such a time machine in an open universe. Specifically, we consider initial data specified on an edgeless, noncompact, spacelike hypersurface, for which the total momentum is timelike (i.e., not the momentum of a Gott spacetime). In contrast to the case of a closed universe (in which Gott pairs, although not CTC's, can be produced from the decay of stationary particles), we find that there is never enough energy for a Gott-like time machine to evolve from the specified data; it is impossible to accelerate two particles to sufficiently high velocity. Thus, the no-CTC theorems of Tipler and Hawking are enforced in an open (2+1)-dimensional universe by a mechanism different from that which operates in a closed universe. In proving our result, we develop a simple method to understand the inequalities that restrict the result of combining momenta in (2+1)-dimensional gravity.

gr-qc↗
arXiv1994

Spherical Shells of Classical Gauge Field and their Topological Charge as a Perturbative Expansion

We consider the classical equations of motion of $SU(2)$ gauge theory, without a Higgs field, in Minkowski space. We work in the spherical ansatz and develop a perturbative expansion in the coupling constant $g$ for solutions which in the far past look like freely propagating spherical shells. The topological charge $Q$ of these solutions is typically non-integer. We then show that $Q$ can be expressed as a power series expansion in $g$ which can be nonzero at finite order. We give an explicit analytic calculation of the order $g^5$ contribution to $Q$ for specific initial pulses. We discuss the relation between our findings and anomalous fermion number violation, and speculate on the physical implications of our results.

hep-ph↗
arXiv1993

Correlation functions of the One-Dimensional Random Field Ising Model at Zero Temperature

We consider the one-dimensional random field Ising model, where the spin-spin coupling, $J$, is ferromagnetic and the external field is chosen to be $+h$ with probability $p$ and $-h$ with probability $1-p$. At zero temperature, we calculate an exact expression for the correlation length of the quenched average of the correlation function $\langle s_0 s_n \rangle - \langle s_0 \rangle \langle s_n \rangle$ in the case that $2J/h$ is not an integer. The result is a discontinuous function of $2J/h$. When $p = {1 \over 2}$, we also place a bound on the correlation length of the quenched average of the correlation function $\langle s_0 s_n \rangle$.

hep-th↗
arXiv1992

Minkowski Space Non-Abelian Classical Solutions with Non-Integer Winding Number Change

Working in a spherically symmetric ansatz in Minkowski space we discover new solutions to the classical equations of motion of pure $SU(2)$ gauge theory. These solutions represent spherical shells of energy which at early times move inward near the speed of light, excite the region of space around the origin at intermediate times and move outward at late times. The solutions change the winding number in bounded regions centered at the origin by non-integer amounts. They also produce non-integer topological charge in these regions. We show that the previously discovered solutions of Luscher and Schechter also have these properties.

hep-ph↗