Daria Ahrensmeier, Saurya Das, Randy Kobes, Gabor Kunstatter, Haitham Zaraket
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n qubits. As expected, we find that as additional structure is included, the Hamiltonians become more local and the computation times decrease.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest …
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speed-up over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is po…
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it temporarily} to a maximum of $\propto \sqrt{N}$, it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the $\sqrt{N}$ bound of conventional quantum searches. The result suggests that the action associated w…
We show that by a suitable choice of time-dependent Hamiltonian, the search for a marked item in an unstructured database can be achieved in unit time, using Adiabatic Quantum Computation. This is a considerable improvement over the O(sqrt(N)) time required in previous algorithms. The trade-off is that in the intermediate stages of the computation process, the ground state energy of the computer increases to a maximum of O(sqrt(N)), before returning to zero at the end of the process.
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401 (2017)]. Here we tailor this condition for estimating run times of quantum adiabatic algorithms. As an illustration, the condition is applied to the adiabatic algorithm for searching in an unstructured database (adiabatic Grover search algorithm). We find that thus obtained lower bound …
We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.
The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as the Hamiltonian dynamics is present. In the special case of pure decoherence where the environment monitors the search Hamiltonian, it is shown that the local adiabatic quantum search performs as the classical search.
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
We propose a strategy to achieve the Grover search algorithm by adiabatic passage in a very efficient way. An adiabatic process can be characterized by the instantaneous eigenvalues of the pertaining Hamiltonian, some of which form a gap. The key to the efficiency is based on the use of parallel eigenvalues. This allows us to obtain non-adiabatic losses which are exponentially small, independently of the number of items in the database in which the search is performed.
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for short running time to inverse-square decay for long running time. The size dependence of the critical running time is expressed in terms of Lambert $W$ function. The transitionless driving Hamiltonian is obtained to make a quantum state follow the adiabatic path. We demonstrate that a constant Ha…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm, and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: the error decreases exponentially for short times, then decreases polynomially for longer tim…
A physical implementation of the adiabatic Grover search is theoretically investigated in a system of N identical three-level atoms trapped in a single mode cavity. Some of the atoms are marked through the presence of an energy gap between their two ground states. The search is controlled by two partially delayed lasers which allow a deterministic adiabatic transfer from an initially entangled state to the marked states. Pulse schemes are proposed to satisfy the Grover speedup either exactly or approximately, and the success rate of the search is calculated.
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the time complexity, which is $O(\sqrt{N/M})$, of the local adiabatic search algorithm\cite{Roland2002}, to $O(\sqrt{N}/M)$.
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, …
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local diabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov bspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic …
In Phys. Rev. A {\bf 71}, 060312(R) (2005) the robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian was examined. We expand this analysis to include the case of the global adiabatic quantum search. As in the case of the local search the asymptotic time complexity for the global search is the same as for the ideal closed case, as long as the Hamiltonian dynamics is present. In the case of pure decoherence, where the environment monitors the search Hamiltonian, we find that the time complexity of the global quantum adiabatic se…
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size $N$ can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
The partial adiabatic search algorithm was introduced in [A. Tulsi, Phys. Rev. A 80, 052328 (2009)] as a modification of the usual adiabatic algorithm for quantum search with the idea that most of the interesting computation only happens over a very short range of the adiabatic path. By focussing on that restricted range, one can potentially gain advantage by reducing the control requirements on the system, enabling a uniform rate of evolution. In this comment, we point out an oversight in the original work [1] that invalidates its proof. However, the argument can be corrected, and the calcula…
Quantum Walk Inspired Dynamic Adiabatic Local Search
针对CTQW搜索算法迁移至AQC框架时的能隙不一致问题，本文用Z oracle算子修改催化Hamilton量，证明运行时间最优，并研究自适应调度以改进局部搜索。
In classical computing, analog approaches have sometimes appeared to be more powerful than they really are. This occurs when resources, particularly precision, are not appropriately taken into account. While the same should also hold for analog quantum computing, precision issues are often neglected from the analysis. In this work we present a classical analog algorithm for unstructured search that can be viewed as analogous to the quantum adiabatic unstructured search algorithm devised by Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. We show that similarly to its quantum counterpart, the …
In their Letter, Garnerone et al. claim that an adiabatic quantum algorithm can extract information about a PageRank vector with either a polynomial or exponential reduction in time resources over the classical algorithm with comparable space resources. Here we argue that the quantum algorithm offers no obvious advantage over the classical algorithm and fails to preserve the fundamental stability property of the classical PageRank algorithm.
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that complement recent results, we show how to efficiently prepare three types of states: Kitaev's toric code state, the cluster state of the measurement-based computation model and the history state used in the adiabatic simulation of quantum circuit. We also show that the method, when adapted for quantum search, provides quadratic speedup as other optimal metho…
Structured beam controlled super-resolution in quantum dots via rapid adiabatic passage
本文研究了基于快速绝热传递的超分辨率显微镜在双能级量子点系统中的应用，通过结构化光束的时空包络形成超分辨图像，抑制低强度环状结构，探讨了温度对成像方案的影响。
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a mechanism to carry out a quantum adiabatic variant of Grover's search algorithm using a single bosonic particle placed in an optical lattice. By studying the scaling of the gap and relevant matrix element in various spatial dimensions, we show that a quantum speedup can already be gained in three dimensions. We argue that the suggested scheme is realizable with p…
We consider an adiabatic quantum algorithm (Grover's search routine) weakly coupled to a rather general environment, i.e., without using the Markov approximation. Markovian errors generally require high-energy excitations (of the reservoir) and tend to destroy the scalability of the adiabatic quantum algorithm. We find that, under appropriate conditions (such as low temperatures), the low-energy (i.e., non-Markovian) modes of the bath are most important. Hence the scalability of the adiabatic quantum algorithm depends on the infra-red behavior of the environment: a reasonably small coupling to…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al., quant-ph/0001106]. We apply this time-dependent Hamiltonian approach to the Grover's problem, i. e., searching a marked item in an unstructured database. We find that, by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N}$, where $N$ is the number…
In various applications one is interested in quantum dynamics at intermediate evolution times, for which the adiabatic approximation is inadequate. Here we develop a quasi-adiabatic approximation based on the WKB method, designed to work for such intermediate evolution times. We apply it to the problem of a single qubit in a time-varying magnetic field, and to the Hamiltonian Grover search problem, and show that already at first order, the quasi-adiabatic WKB captures subtle features of the dynamics that are missed by the adiabatic approximation. However, we also find that the method is sensit…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the entanglement throughout the calculation. On the other hand however, the adiabatic formalism makes it impossible to study the roles of entanglement and fidelity separately, which means that results have to be interpreted carefully. We study two algorithms: the search algorithm and the Deutsch-Jozsa algorithm. We find some evidence that entanglement can be con…
We study the process of Stimulated Raman Adiabatic Passage (STIRAP) under the influence of a non-trivial solid-state environment, particularly the effect of two-level fluctuators (TLFs) as they are frequently present in solid-state devices. When the amplitudes of the driving-pulses used in STIRAP are in resonance with the level spacing of the fluctuators the quality of the protocol, i.e., the transferred population decreases sharply. In general the effect can not be reduced by speeding up the STIRAP process. We also discuss the effect of a structured noise environment on the process of Coheren…
Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property --- the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang gave an optimal gate-model search algorithm with the fixed-point property. Meanwhile, it is known that an adiabatic quantum algorithm, operating by continuously varying a …
We propose an implementation of the quantum search algorithm of a marked item in an unsorted list of N items by adiabatic passage in a cavity-laser-atom system. We use an ensemble of N identical three-level atoms trapped in a single-mode cavity and driven by two lasers. In each atom, the same level represents a database entry. One of the atoms is marked by having an energy gap between its two ground states. Appropriate time delays between the two laser pulses allow one to populate the marked state starting from an initial entangled state within a decoherence-free adiabatic subspace. The time t…
We discuss some aspects related to the so-called Hilbert space Average Method, as an alternative to describe the dynamics of open quantum systems. First we present a derivation of the method which does not make use of the algebra satisfied by the operators involved in the dynamics, and extend the method to systems subject to a Hamiltonian that changes with time. Next we examine the performance of the adiabatic quantum search algorithm with a particular model for the environment. We relate our results to the criteria discussed in the literature for the validity of the above-mentioned method for…
The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the resilience of such algorithms against errors, understanding the impact of imperfections on their performance is of both scientific and practical significance. We study the robustness of the algorithm against various types of imperfections: limited control over the interpolating schedule, Hamiltonian misspecification, and interactions with a thermal environment. …
Open-System Adiabatic Quantum Search under Dephasing
本文研究开放系统中绝热量子搜索的最优调度，推导出闭合表达式并确定退相干阈值，定义了物理可行的边界条件。
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solvi…
Adiabatic quantum unstructured search in parallel
该研究优化了Roland和Cerf的绝热量子无结构搜索调度，在保留二次加速的同时提升端点演化速度，通过并行化增强性能，数值模拟验证其概率优势，还提出保证标记态概率的协议，为有限相干时间场景下的量子优势实现提供可能。
We numerically simulate the effects of noise-induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP-Complete problem N-bit Exact Cover 3. The noise-averaged median runtime is determined as the noise-power and number of bits N are varied, and power-law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise-power values. We discuss whether this shift might be connected to arguments in the liter…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search …
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum annealing, computation by continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian.…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size, their robustness in open systems remains unresolved. We study the dynamics in the proximity of such an avoided level crossing associated with the adiabatic quantum search algorithm in a quantum system that is coupled to a generic environment. At zero temperature, we find that the algorithm remains scalable provided the noise spectral density of the environmen…
We consider the effect of two different environments on the performance of the quantum adiabatic search algorithm, a thermal bath at finite temperature, and a structured environment similar to the one encountered in systems coupled to the electromagnetic field that exists within a photonic crystal. While for all the parameter regimes explored here, the algorithm performance is worsened by the contact with a thermal environment, the picture appears to be different when considering a structured environment. In this case we show that, by tuning the environment parameters to certain regimes, the a…
Quantum annealing (QA) is one of the ways to search the ground state of the problem Hamiltonian. Here, we propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the trivial Hamiltonian is initially prepared and is adiabatically changed into an $n$-th excited state of the target Hamiltonian. Although our scheme is general such that we can search any excited states, we especially discuss the first excited state search in this paper. As a comparison, we consider a non-adiabatic scheme to find the first excited state with non-…
Results are presented of a large-scale simulation of the quantum adiabatic search (QuAdS) algorithm in the presence of noise. The algorithm is applied to the NP-Complete problem Exact Cover 3 (EC3). The noise is assumed to Zeeman-couple to the qubits and its effects on the algorithm's performance is studied for various levels of noise power, and for 4 different types of noise polarization. We examine the scaling relation between the number of bits N (EC3 problem size) and the algorithm's noise-averaged median run-time <T(N)>. Clear evidence is found of the algorithm's sensitivity to noise. Two…
An important method for search engine result ranking works by finding the principal eigenvector of the "Google matrix." Recently, a quantum algorithm for preparing this eigenvector and evidence of an exponential speedup for some scale-free networks were presented. Here, we show that the run-time depends on features of the graphs other than the degree distribution, and can be altered sufficiently to rule out a general exponential speedup. For a sample of graphs with degree distributions that more closely resemble the Web than in previous work, the proposed algorithm for eigenvector preparation …
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the energy gap between the ground and excited states depends on the relaxation parameters, and is not exponentially small. This allows a significant reduction of the searching time. We discuss the relations between the probabilities of finding the ground state and the survival of a quantum computer in a dissipative environment.
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables, the adiabatic method gives solution probabilities close to 1 for problem sizes feasible to evaluate via simulation on current computers. However, for these sizes the minimum energy gaps of most instances are fairly large, so the good performance scaling seen for small problems may not reflect asymptotic behavior where costs are dominated by tiny gaps. Moreover…
Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce a new approach to adiabatic control that uses the superadiabatic quality or $Q$-factor as a performance metric to design robust, high fidelity pulses. This approach permits the systematic design of quantum control schemes to maximize the adiabaticity of a unitary operation in a particular time interval given the available control resources. The interplay between adiabaticity, fidelity and robustness of the resulting pulses is examined for the case of single-qubit inversion, and superadiabatic pul…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 0423…
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of webpages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top ranked $\log(n)$ entries of the quantum PageRank state can the…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and evolution time in the adiabatic approximation that go beyond typical scaling relations. Using the Adiabatic Perturbation Theory, we obtain leading-order expressions valid for long evolution time $T$, while explicitly determining the shortest time $T$ and the largest error $\varepsilon$ for which they are valid. In this validity regime, we can make clear and precise…
Grover Search Inspired Alternating Operator Ansatz of Quantum Approximate Optimization Algorithm for Search Problems
该研究利用绝热量子搜索与绝热量子计算的框架映射，通过对绝热量子搜索的含调度哈密顿量做Trotter化得到QAOA的变分参数，无需迭代机器学习即可将Grover搜索的最优性能迁移至QAOA框架。
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces, and is analytically simpler than previous structured search methods. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It…
An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially with problem size. Each oracle call is followed by a measurement, implying that it is necessary to maintain quantum coherence for only one oracle call at a time.
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) $P$ on a graph with a set of unknown marked vertices, one can define a related absorbing walk $P'$ where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian $H(s)$ from the interpolated Markov chain $P(s)=(1-s)P+sP'$ and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that fo…
The highly structured search algorithm proposed by Hogg[Phys.Rev.Lett. 80,2473(1998)] is implemented experimentally for the 1-SAT problem in a single search step by using nuclear magnetic resonance technique with two-qubit sample. It is the first demonstration of the Hogg's algorithm, and can be readily extended to solving 1-SAT problem for more qubits in one step if the appropriate samples possessing more qubits are experimentally feasible.
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。