اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFeedback-controlled adiabatic quantum computation
139
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control the computation speed to maximize the success probability. We show that this scheme can provide a polynomial speed-up in performance and that it is possible to choose a suitable set of feedback-control parameters for an arbitrary problem Hamiltonian.
قيم البحث
اقرأ أيضاً
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the minimal en
ergy gap. However, at finite temperatures, it might need to be fast enough to avoid thermal excitations. The question is, how fast does it need to be? The structure of evolution Hamiltonians for AQC is generally too complicated for answering this question. Here we model an adiabatic quantum computer as a (parametrically driven) harmonic oscillator. The advantages of this model are (1) it offers high flexibility for quantitative analysis on the thermal effect, (2) the results qualitatively agree with previous numerical calculation, and (3) it could be experimentally verified with quantum electronic circuits.
Adiabatic quantum computation (AQC), which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, instead of ground states. However, the excited-state AQC is prone to errors due to dissipation. Here we p
ropose the excited-state AQC started with the most stable state, i.e., the vacuum state. This counterintuitive approach becomes possible by using a driven quantum system, or more precisely, a network of Kerr-nonlinear parametric oscillators (KPOs). By numerical simulations, we show that some hard instances, where standard ground-state AQC with KPOs fails to find their optimal solutions, can be solved by the present approach, where nonadiabatic transitions are rather utilized. We also show that the use of the vacuum state as an initial state leads to robustness against errors due to dissipation, as expected, compared to the use of a really excited (nonvacuum) state as an initial state. Thus, the present work offers new possibilities for quantum computation and driven quantum systems.
We introduce a scheme to perform universal quantum computation in quantum cellular automata (QCA) fashion in arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension $N$-element array, requiring onl
y mirror symmetric logical encoding and global pulses. A mechanism using ancillary degrees of freedom for subsystem specific measurement is also presented.
Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proven to be safe against quantum attacks. Among the most promising i
s lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyse the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems.
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
