اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExcited-State Adiabatic Quantum Computation Started with Vacuum States
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 propose 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.
قيم البحث
اقرأ أيضاً
The calculation of excited state energies of electronic structure Hamiltonians has many important applications, such as the calculation of optical spectra and reaction rates. While low-depth quantum algorithms, such as the variational quantum eigenva
lue solver (VQE), have been used to determine ground state energies, methods for calculating excited states currently involve the implementation of high-depth controlled-unitaries or a large number of additional samples. Here we show how overlap estimation can be used to deflate eigenstates once they are found, enabling the calculation of excited state energies and their degeneracies. We propose an implementation that requires the same number of qubits as VQE and at most twice the circuit depth. Our method is robust to control errors, is compatible with error-mitigation strategies and can be implemented on near-term quantum computers.
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.
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.
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quan
tum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
