اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimizing the Number of Gates in Quantum Search
203
0
0.0
(
0
)
تأليف
Srinivasan Arunachalam
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
$ $In its usual form, Grovers quantum search algorithm uses $O(sqrt{N})$ queries and $O(sqrt{N} log N)$ other elementary gates to find a solution in an $N$-bit database. Grover in 2002 showed how to reduce the number of other gates to $O(sqrt{N}loglog N)$ for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to $O(sqrt{N}log^{(r)} N)$ gates for any constant $r$, and sufficiently large $N$. This means that, on average, the gates between two queries barely touch more than a constant number of the $log N$ qubits on which the algorithm acts. For a very large $N$ that is a power of 2, we can choose $r$ such that the algorithm uses essentially the minimal number $frac{pi}{4}sqrt{N}$ of queries, and only $O(sqrt{N}log(log^{star} N))$ other gates.
قيم البحث
اقرأ أيضاً
Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations to derive a
n optimization algorithm that determines the best entangling two-qubit gate for a given physical setting. We demonstrate the power of this approach for trapped polar molecules and neutral atoms.
We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum
nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.
We develop new protocols for high-fidelity single qubit gates that exploit and extend theoretical ideas for accelerated adiabatic evolution. Our protocols are compatible with qubit architectures with highly isolated logical states, where traditional
approaches are problematic; a prime example are superconducting fluxonium qubits. By using an accelerated adiabatic protocol we can enforce the desired adiabatic evolution while having gate times that are comparable to the inverse adiabatic energy gap (a scale that is ultimately set by the amount of power used in the control pulses). By modelling the effects of decoherence, we explore the tradeoff between speed and robustness that is inherent to shortcuts-to-adiabaticity approaches.
The main results on quantum walk search are scattered over different, incomparable frameworks, most notably the hitting time framework, originally by Szegedy, the electric network framework by Belovs, and the MNRS framework by Magniez, Nayak, Roland
and Santha. As a result, a number of pieces are currently missing. For instance, the electric network framework allows quantum walks to start from an arbitrary initial state, but it only detects marked elements. In recent work by Ambainis et al., this problem was resolved for the more restricted hitting time framework, in which quantum walks must start from the stationary distribution. We present a new quantum walk search framework that unifies and strengthens these frameworks. This leads to a number of new results. For instance, the new framework not only detects, but finds marked elements in the electric network setting. The new framework also allows one to interpolate between the hitting time framework, which minimizes the number of walk steps, and the MNRS framework, which minimizes the number of times elements are checked for being marked. This allows for a more natural tradeoff between resources. Whereas the original frameworks only rely on quantum walks and phase estimation, our new algorithm makes use of a technique called quantum fast-forwarding, similar to the recent results by Ambainis et al. As a final result we show how in certain cases we can simplify this more involved algorithm to merely applying the quantum walk operator some number of times. This answers an open question of Ambainis et al.
Grovers Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in quantum states. I
n this paper, we introduce an optimization of the inversion-by-the-mean step of the algorithm. This optimization serves two purposes: from a practical perspective, it can lead to a performance improvement; from a theoretical one, it leads to a novel interpretation of the actual nature of this step. This step is a reflection, which is realized by (a) cancelling the superposition of a general state to revert to the original all-zeros state, (b) flipping the sign of the amplitude of the all-zeros state, and finally (c) reverting back to the superposition state. Rather than canceling the superposition, our approach allows for going forward to another state that makes the reflection easier. We validate our approach on set and array search, and confirm our results experimentally on real quantum hardware.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
