اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
94
0
0.0
(
0
)
تأليف
Hayato Goto
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 coherent 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.
قيم البحث
اقرأ أيضاً
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrodinger cat state
, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.
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.
A Kerr-nonlinear parametric oscillator (KPO) can stabilize a quantum superposition of two coherent states with opposite phases, which can be used as a qubit. In a universal gate set for quantum computation with KPOs, an $R_x$ gate, which interchanges
the two coherent states, is relatively hard to perform owing to the stability of the two states. We propose a method for a high-fidelity $R_x$ gate by exciting the KPO outside the qubit space parity-selectively, which can be implemented by only adding a driving field. In this method, utilizing higher effective excited states leads to a faster $R_x$ gate, rather than states near the qubit space. The proposed method can realize a continuous $R_x$ gate, and thus is expected to be useful for, e.g., recently proposed variational quantum algorithms.
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.
We describe and analyze an efficient register-based hybrid quantum computation scheme. Our scheme is based on probabilistic, heralded optical connection among local five-qubit quantum registers. We assume high fidelity local unitary operations within
each register, but the error probability for initialization, measurement, and entanglement generation can be very high (~5%). We demonstrate that with a reasonable time overhead our scheme can achieve deterministic non-local coupling gates between arbitrary two registers with very high fidelity, limited only by the imperfections from the local unitary operation. We estimate the clock cycle and the effective error probability for implementation of quantum registers with ion-traps or nitrogen-vacancy (NV) centers. Our new scheme capitalizes on a new efficient two-level pumping scheme that in principle can create Bell pairs with arbitrarily high fidelity. We introduce a Markov chain model to study the stochastic process of entanglement pumping and map it to a deterministic process. Finally we discuss requirements for achieving fault-tolerant operation with our register-based hybrid scheme, and also present an alternative approach to fault-tolerant preparation of GHZ states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
