\relax 
\citation{garey79}
\citation{benioff82}
\citation{bernstein92}
\citation{deutsch85}
\citation{deutsch89}
\citation{divincenzo95}
\citation{feynman86}
\citation{lloyd93}
\citation{shor94}
\citation{boyer96}
\citation{grover96}
\citation{hogg95d}
\citation{hogg97}
\citation{hogg94b}
\citation{kirkpatrick94}
\citation{monasson96}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
\citation{grover96}
\citation{hogg95d}
\citation{hogg97}
\citation{minton92}
\citation{selman92}
\citation{kirkpatrick83}
\citation{garey79}
\citation{mackworth92}
\@writefile{toc}{\contentsline {section}{\numberline {2}The Satisfiability Problem}{3}}
\newlabel{sect.sat}{{2}{3}}
\newlabel{eq.hamming}{{1}{3}}
\citation{nijenhuis78}
\citation{feynman85}
\citation{mermin85}
\newlabel{eq.conflicts}{{2}{4}}
\newlabel{eq.mMax}{{3}{4}}
\citation{divincenzo95}
\citation{hogg95d}
\citation{boyer96}
\citation{hoyer97}
\@writefile{toc}{\contentsline {section}{\numberline {3}Quantum Computers}{5}}
\newlabel{sect.quantum}{{3}{5}}
\citation{feynman85}
\citation{grover96}
\citation{hogg95d}
\citation{hogg97}
\newlabel{eq.Umix}{{4}{6}}
\citation{kirkpatrick83}
\@writefile{toc}{\contentsline {section}{\numberline {4}Neighborhood Relations and Quantum Search}{7}}
\newlabel{eq.map}{{5}{7}}
\citation{boyer96}
\citation{boyer96}
\citation{luby93}
\citation{boyer96}
\newlabel{eq.p(soln)}{{6}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Emphasizing Neighbors with Amplitude Mixing}{8}}
\newlabel{sect.U}{{4.1}{8}}
\citation{boyer96}
\citation{grover96}
\newlabel{eq.W}{{7}{9}}
\newlabel{eq.U2}{{8}{9}}
\citation{grover96}
\citation{hogg95d}
\citation{hogg97}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Values of $u_d/u_1$ for $n=8$ (solid) and $n=20$ (dotted). The values of $u_1$ for $n$ equal to 8 and 20 are 0.27 and 0.18, respectively.}}{10}}
\newlabel{fig.matrix}{{1}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Phase Choices}{10}}
\newlabel{sect.phases}{{4.2}{10}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.1}A Simple Phase Choice}{10}}
\newlabel{eq.phase}{{9}{11}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.2}Phases Based on Neighborhood Structure}{11}}
\newlabel{eq.phase1}{{10}{12}}
\newlabel{eq.phase1First}{{10a}{12}}
\newlabel{eq.phase1Rest}{{10b}{12}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Quantum Search Behavior}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Small Example}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Maximum Constrained Problems}{14}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Expected search cost for maximum constrained 1-SAT vs. $n$ with the two phase choices: black and gray are Eq.\nobreakspace  {}(9\hbox {}) and Eq.\nobreakspace  {}(10\hbox {}), respectively. The lines are least squares fits to the points.}}{15}}
\newlabel{fig.extreme}{{2}{15}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Evolution of the probability in assignments with different numbers of conflicts for the maximum constrained problem with $n=100$ using Eq.\nobreakspace  {}(10\hbox {}). The probability for a solution reaches about 0.3 after 51 steps, giving a search cost of about 170. }}{15}}
\newlabel{fig.amplitude}{{3}{15}}
\citation{hogg95e}
\citation{crawford95}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Problems with Fewer Constraints}{16}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Probability in each assignment for a 3-SAT instance with $n=12$ after $J=5$ steps. The problem has $m=48$, with 4 solutions and $P_{\rm  soln}=0.013$. The large gray points are the solutions.}}{16}}
\newlabel{fig.largerExample}{{4}{16}}
\citation{hogg97}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Expected search cost for random 3-SAT with at least one solution vs. $n$ with $m/n=4$ on a log plot. For each value of $n$, 1000 problem instances were used. Error bars showing the expected error in the estimate are included but are smaller than the size of the plotted points.}}{17}}
\newlabel{fig.scaling}{{5}{17}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Expected search cost for random 3-SAT for $n=10$ vs. $m/n$. Each point represents 1000 problem instances, except only 100 random soluble instances are shown at $m/n$ equal to 12 and 13. The black line is for random soluble problems while the gray line is for problems with prespecified solution. Error bars showing the expected error in the estimate are included but, in most cases, are smaller than the size of the plotted points.}}{18}}
\newlabel{fig.phase}{{6}{18}}
\@writefile{toc}{\contentsline {section}{\numberline {6} Discussion}{18}}
\citation{grover96}
\citation{landauer94a}
\citation{unruh94}
\citation{haroche96}
\citation{monroe96a}
\citation{barenco95}
\citation{cirac95}
\citation{cory96}
\citation{gershenfeld96}
\citation{sleator95}
\citation{berthiaume94}
\citation{shor95}
\citation{chuang95}
\citation{grover96}
\citation{hogg95d}
\citation{hogg95e}
\@writefile{toc}{\contentsline {section}{\numberline {A}Appendix: Neighborhood Mixing Matrix}{20}}
\newlabel{sect.matrix}{{A}{20}}
\@writefile{toc}{\contentsline {subsection}{\numberline {A.1}Matrix Decomposition}{20}}
\citation{grover96}
\newlabel{eq.generalU}{{11}{21}}
\newlabel{eq.Udecomposition}{{12}{21}}
\newlabel{eq.Wunnormalized}{{13}{21}}
\newlabel{eq.Wdecomposition}{{15}{21}}
\@writefile{toc}{\contentsline {subsection}{\numberline {A.2}Maximum Mapping to Neighbors}{22}}
\citation{grover96}
\citation{hogg97}
\citation{grover96}
\newlabel{eq.Skm}{{23}{23}}
\@writefile{toc}{\contentsline {section}{\numberline {B}Appendix: Classical Simulation}{23}}
\@writefile{toc}{\contentsline {subsection}{\numberline {B.1}General Problems}{23}}
\newlabel{sect.classical}{{B.1}{23}}
\citation{cerf97}
\@writefile{toc}{\contentsline {subsection}{\numberline {B.2}Maximally Constrained Problems}{24}}
\newlabel{sect.maxConstraints}{{B.2}{24}}
\bibcite{barenco95}{1}
\bibcite{benioff82}{2}
\bibcite{bernstein92}{3}
\bibcite{berthiaume94}{4}
\bibcite{boyer96}{5}
\bibcite{cerf97}{6}
\bibcite{chuang95}{7}
\bibcite{cirac95}{8}
\bibcite{cory96}{9}
\bibcite{crawford95}{10}
\bibcite{deutsch85}{11}
\bibcite{deutsch89}{12}
\bibcite{divincenzo95}{13}
\bibcite{feynman86}{14}
\bibcite{feynman85}{15}
\bibcite{garey79}{16}
\bibcite{gershenfeld96}{17}
\bibcite{grover96}{18}
\bibcite{haroche96}{19}
\bibcite{hogg94b}{20}
\bibcite{hogg95d}{21}
\bibcite{hogg97}{22}
\bibcite{hogg95e}{23}
\bibcite{hoyer97}{24}
\bibcite{kirkpatrick83}{25}
\bibcite{kirkpatrick94}{26}
\bibcite{landauer94a}{27}
\bibcite{lloyd93}{28}
\bibcite{luby93}{29}
\bibcite{mackworth92}{30}
\bibcite{mermin85}{31}
\bibcite{minton92}{32}
\bibcite{monasson96}{33}
\bibcite{monroe96a}{34}
\bibcite{nijenhuis78}{35}
\bibcite{selman92}{36}
\bibcite{shor95}{37}
\bibcite{shor94}{38}
\bibcite{sleator95}{39}
\bibcite{unruh94}{40}