اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpeeding up adiabatic passage with an optimal modified Roland-Cerf protocol
47
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we propose a novel method to accelerate adiabatic passage in a two-level system with only longitudinal field (detuning) control, while the transverse field is kept constant. The suggested method is a modification of the Roland-Cerf protocol, during which the parameter quantifying local adiabaticity is held constant. Here, we show that with a simple ``on-off modulation of this local adiabaticity parameter, a perfect adiabatic passage can be obtained for every duration larger than the lower bound $pi/Omega$, where $Omega$ is the constant transverse field. For a fixed maximum amplitude of the local adiabaticity parameter, the timings of the ``on-off pulse-sequence which achieves perfect fidelity in minimum time are obtained using optimal control theory. The corresponding detuning control is continuous and monotonic, a significant advantage compared to the detuning variation at the quantum speed limit which includes non-monotonic jumps. The proposed methodology can be applied in several important core tasks in quantum computing, for example to the design of a high fidelity controlled-phase gate, which can be mapped to the adiabatic quantum control of such a qubit. Additionally, it is expected to find applications across all Physics disciplines which exploit the adiabatic control of such a two-level system.
قيم البحث
اقرأ أيضاً
A wide range of modern science and engineering applications are formulated as optimization problems with a system of partial differential equations (PDEs) as constraints. These PDE-constrained optimization problems are typically solved in a standard
discretize-then-optimize approach. In many industry applications that require high-resolution solutions, the discretized constraints can easily have millions or even billions of variables, making it very slow for the standard iterative optimizer to solve the exact gradients. In this work, we propose a general framework to speed up PDE-constrained optimization using online neural synthetic gradients (ONSG) with a novel two-scale optimization scheme. We successfully apply our ONSG framework to computational morphogenesis, a representative and challenging class of PDE-constrained optimization problems. Extensive experiments have demonstrated that our method can significantly speed up computational morphogenesis (also known as topology optimization), and meanwhile maintain the quality of final solution compared to the standard optimizer. On a large-scale 3D optimal design problem with around 1,400,000 design variables, our method achieves up to 7.5x speedup while producing optimized designs with comparable objectives.
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges. On the othe
r hand, random graphs are often locally tree-like, and spreading on trees with leaves might be very slow, because of bottleneck edges with huge passage times. Here we consider the SI model with passage times following a power law distribution $mathbb{P}(xi>t)sim t^{-alpha}$, with infinite mean. For any finite connected graph $G$ with a root $s$, we find the largest number of vertices $kappa(G,s)$ that are infected in finite expected time, and prove that for every $k leq kappa(G,s)$, the expected time to infect $k$ vertices is at most $O(k^{1/alpha})$. Then, we show that adding a single edge from $s$ to a random vertex in a random tree $mathcal{T}$ typically increases $kappa(mathcal{T},s)$ from a bounded variable to a fraction of the size of $mathcal{T}$, thus severely accelerating the process. We examine this acceleration effect on some natural models of random graphs: critical Galton-Watson trees conditioned to be large, uniform spanning trees of the complete graph, and on the largest cluster of near-critical ErdH{o}s-Renyi graphs. In particular, at the upper end of the critical window, the process is already much faster than exactly at criticality.
We show that with adiabatic passage, one can reliably drive two-photon optical transitions between the ground states and interacting Rydberg states in a pair of atoms. For finite Rydberg interaction strengths a new adiabatic pathway towards the doubl
y Rydberg excited state is identified when a constant detuning is applied with respect to an intermediate optically excited level. The Rydberg interaction among the excited atoms provides a phase that may be used to implement quantum gate operations on atomic ground state qubits.
Adiabatic transport of information is a widely invoked resource in connection with quantum information processing and distribution. The study of adiabatic transport via spin-half chains or clusters is standard in the literature, while in practice the
true realisation of a completely isolated two-level quantum system is not achievable. We explore here, theoretically, the extension of spin-half chain models to higher spins. Considering arrangements of three spin-one particles, we show that adiabatic transport, specifically a generalisation of the Dark State Adiabatic Passage procedure, is applicable to spin-one systems. We thus demonstrate a qutrit state transfer protocol. We discuss possible ways to physically implement this protocol, considering quantum dot and nitrogen-vacancy implementations.
This work explores the relationship between optimal control theory and adiabatic passage techniques in quantum systems. The study is based on a geometric analysis of the Hamiltonian dynamics constructed from the Pontryagin Maximum Principle. In a thr
ee-level quantum system, we show that the Stimulated Raman Adiabatic Passage technique can be associated to a peculiar Hamiltonian singularity. One deduces that the adiabatic pulse is solution of the optimal control problem only for a specific cost functional. This analysis is extended to the case of a four-level quantum system.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
