اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThermal Noise on Adiabatic Quantum Computation
128
0
0.0
(
0
)
تأليف
Man-Hong Yung
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 energy 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.
قيم البحث
اقرأ أيضاً
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 comput
ation 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.
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of c
oherent states, such as Schrodinger cat states. Therefore, these quantum computers are referred to as quantum bifurcation machines (QbMs). QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising for physical implementation of KPOs. Thus, KPOs and QbMs offer not only a new path toward the realization of quantum bits (qubits) and quantum computers, but also a new application of JPOs. Here we theoretically explain the physics of KPOs and QbMs, comparing them with their dissipative counterparts. Their physical implementations with superconducting circuits are also presented.
Blind quantum computation (BQC) is a new type of quantum computation model. BQC allows a client (Alice) who does not have enough sophisticated technology and knowledge to perform universal quantum computation and resorts a remote quantum computation
server (Bob) to delegate universal quantum computation. During the computation, Bob cannot know Alices inputs, algorithm and outputs. In single-server BQC protocol, it requires Alice to prepare and distribute single-photon states to Bob. Unfortunately, the distributed single photons will suffer from noise, which not only makes the single-photon state decoherence, but also makes it loss. In this protocol, we describe an anti-noise BQC protocol, which combined the ideas of faithful distribution of single-photon state in collective noise, the feasible quantum nondemolition measurement and Broadbent-Fitzsimons-Kashefi (BFK) protocol. This protocol has several advantages. First, Alice does not require any auxiliary resources, which reduces the clients economic cost. Second, this protocol not only can protect the state from the collective noise, but also can distill the single photon from photon loss. Third, the noise setup in Bob is based on the linear optics, and it is also feasible in experiment. This anti-noise BQC may show that it is possible to perform the BQC protocol in a noisy environment.
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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
