نتایج جستجو برای: quantum search algorithm
تعداد نتایج: 1255857 فیلتر نتایج به سال:
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover’s quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of ...
Grover’s quantum search algorithm finds one of t solutions in N candidates by using (π/4) √ N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover’s algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover’s algorithm, which runs, on average, in O( √ N/t) basic steps (more precisely, (9/4) √ N/t steps) wi...
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architectu...
We present a new algorithm for directed quantum search, which is superior to the Phase-π/3 search algorithm [5] in several aspects. In particular, our algorithm does not require complex phases and achieves the optimal reduction in error probability, from ǫ to ǫ2q+1, for all positive integer values q of oracle queries. (The Phase-π/3 algorithm, requires q = (3n − 1)/2, with n a positive integer....
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 web page...
in this work, by using the particle swarm optimization the electron raman scattering for square double quantum wells is optimized. for this purpose, by combining the particle swarm algorithm together with the numerical solution procedures for equations, and also the perturbation theory we find the optimal structure that maximizes the electron raman scattering. application of this algorithm to t...
Quantum searching requires precise knowledge of problem parameters (such as the fraction of target states) for efficient operation. Recently an algorithm has been discovered, referred to as the Phase-π/3 search algorithm, which gets around this limitation. This algorithm can search a database with the fraction of target states equal to 1 − ǫ so that in q queries it produces a probability of err...
today, with rapid growth of the world wide web and creation of internet sites and online text resources, text summarization issue is highly attended by various researchers. extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. when, we are facing into large data volume documents, the extr...
this paper presents a strategy for using harmony search algorithm in facility layout optimization problems. in this paper an adapted harmony search algorithm is developed for solving facility layout optimization problems. this method finds an optimal facility arrangement in an existing layout. two real-world case studies are employed to demonstrate the efficiency of this model. a comparison is ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید