اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimulation of Grovers quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
411
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We implement Grovers quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity as a function of the Rabi frequency. For the latter, we obtained pronounced maxima at frequencies which fulfil the condition of the (2pi k)-method with respect to the second nearest neighbour interactions.
قيم البحث
اقرأ أيضاً
We consider Grovers search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the exter
nal fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called fidelity. We find either an exponential or a Gaussian decay for the fidelity as a function of the strength of the noise, depending on the type of noise (static or random) and whether error supression is applied (the 2pi k-method) or not.
We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard nearest-neighbor Ising
coupling, we also allow for a second neighbor coupling. It is shown, how to apply the 2pi k method in this more general setting, where the additional coupling eventually allows to save a few pulses. We illustrate our results with two numerical simulations: the Shor prime factorization of the number 4 and the teleportation of a qubit along a chain of 3 qubits. In both cases, the optimal Rabi frequency (to suppress non-resonant effects) depends primarily on the strength of the second neighbor interaction.
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.
By using the method of density-matrix renormalization-group to solve the different spin-spin correlation functions, the nearest-neighbouring entanglement(NNE) and next-nearest-neighbouring entanglement(NNNE) of one-dimensional alternating Heisenberg
XY spin chain is investigated in the presence of alternating nearest neighbour interactions of exchange couplings, external magnetic fields and next-nearest neighbouring interactions. For dimerized ferromagnetic spin chain, NNNE appears only above the critical dimerized interaction, meanwhile, the dimerized interaction effects quantum phase transition point and improves NNNE to a large value. We also study the effect of ferromagnetic or antiferromagnetic next-nearest neighboring (NNN) interactions on the dynamics of NNE and NNNE. The ferromagnetic NNN interaction increases and shrinks NNE below and above critical frustrated interaction respectively, while the antiferromagnetic NNN interaction always decreases NNE. The antiferromagnetic NNN interaction results to a larger value of NNNE in comparison to the case when the NNN interaction is ferromagnetic.
Amplitude Amplification -- a key component of Grovers Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification procedure by pa
rtitioning the states into classes, whose probabilities are increased at different levels before or during amplification. The partitioning process is based on the binomial distribution. If the classes to which the search target states belong are known in advance, the number of iterations in the Amplitude Amplification algorithm can be drastically reduced compared to the standard version. In the more likely case in which the relevant classes are not known in advance, their selection can be configured at run time, or a random approach can be employed, similar to classical algorithms such as binary search. In particular, we apply this method in the context of our previously introduced Quantum Dictionary pattern, where keys and values are encoded in two separate registers, and the value-encoding method is independent of the type of superposition used in the key register. We consider this type of structure to be the natural setup for search. We confirm the validity of our new approach through experimental results obtained on real quantum hardware, the Honeywell System Model H0 trapped-ion quantum computer.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
