اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGrovers Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
62
0
0.0
(
0
)
تأليف
Eli Biham
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Grovers algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grovers algorithm is robust against modest noise in the amplitude initialization procedure.
قيم البحث
اقرأ أيضاً
Grovers algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N-r unmarked s
tates. These equations are solved exactly. An expression for the optimal measurement time T sim O(sqrt{N/r}) is derived which is shown to depend only on the initial average amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial amplitude distributions of the marked or unmarked states.
Grovers quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grovers
algorithm. We study the algorithms intrinsic robustness when no quantum correction codes are used, and evaluate how much noise the algorithm can bear with, in terms of the size of the phone book and a desired probability of finding the correct result. The algorithm loses efficiency when noise is added, but does not slow down. We also study the maximal noise under which the iterated quantum algorithm is just as slow as the classical algorithm. In all cases, the width of the allowed noise scales with the size of the phone book as N^-2/3.
We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.
We question whether the measurement based quantum computing algorithm is in fact Grovers algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4 element searc
h, which is the largest size photonic search algorithm that has been experimentally implemented to date. This has led some to refer to both substantiations as Grovers algorithm. We compare multiple features of the two algorithms including the behavior of the oracle tags and the entanglement dynamics, both qualitatively and quantitatively. We find significant and fundamental differences in the operation of the two algorithms, particularly in cases involving searches on more than four elements.
We investigate the performance of Grovers quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly on the corre
spondingly shrinking register, we show that the algorithm converges to mixed states with 50% overlap with the target state in the bit positions still present. As an alternative to error correction, we present a procedure that combines the outcome of different trials of the algorithm to determine the solution to the full search problem. The procedure may be relevant for experiments where the algorithm is adapted as the loss of particles is registered, and for experiments with Rydberg blockade interactions among neutral atoms, where monitoring of the atom losses is not even necessary.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
