Optimal shortcuts of Stimulated Raman Adiabatic Passage in the presence of dissipation

• URL: http://arxiv.org/abs/2212.13231v1
• Date: Mon, 26 Dec 2022 17:35:08 GMT
• Title: Optimal shortcuts of Stimulated Raman Adiabatic Passage in the presence of dissipation
• Authors: Dionisis Stefanatos and Emmanuel Paspalakis
• Abstract summary: We use optimal control theory to obtain shortcuts to adiabaticity in a three-level STIRAP system. We fix the sum of the intensities of the pump and Stokes pulses and use the mixing angle as the sole control variable.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We use optimal control theory to obtain shortcuts to adiabaticity which maximize population transfer in a three-level STIRAP system, for a given finite duration of the process and specified dissipation rate at the intermediate state. We fix the sum of the intensities of the pump and Stokes pulses and use the mixing angle as the sole control variable. We determine the optimal variation of this angle and reveal the role of singular arc in the optimal trajectory, in order to minimize the effect of dissipation.

Related papers

• Optimal STIRAP shortcuts using the spin to spring mapping [0.0]
  We derive shortcuts to adiabaticity maximizing population transfer in a three-level $Lambda$ quantum system. We solve the spring optimal control problem and obtain analytical expressions for the impulses, the durations of the zero control intervals and the singular control.
  arXiv  Detail & Related papers  (2023-12-27T17:11:59Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Optimal robust stimulated Raman exact passage by inverse optimization [0.0]
  Control fields temporal shapes that are optimal with respect to pulse area, energy, and duration are found to form a simple sequence. Alternative optimal solutions featuring lower losses, larger pulse areas, and fully counter-intuitive pulse sequences are derived.
  arXiv  Detail & Related papers  (2022-09-15T22:19:04Z)
• Perfect stimulated Raman adiabatic passage with imperfect finite-time pulses [0.0]
  We present a well-tailored sequence of two Gaussian-pulsed drives that achieves perfect population transfer in STImulated Raman Adiabatic Passage (STIRAP) Subject to optimal truncation of the drives and with reference to the point of fastest transfer, we obtain a new adiabaticity criteria, which is remarkably simple and effective.
  arXiv  Detail & Related papers  (2022-04-11T17:20:11Z)
• Optimal shape of STIRAP pulses for large dissipation at the intermediate level [0.0]
  We study the problem of maximizing population transfer efficiency in the STIRAP system. We find the control fields which maximize the population transfer to the target state for a given duration $T$.
  arXiv  Detail & Related papers  (2021-12-27T11:52:06Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Variational Refinement for Importance Sampling Using the Forward Kullback-Leibler Divergence [77.06203118175335]
  Variational Inference (VI) is a popular alternative to exact sampling in Bayesian inference. Importance sampling (IS) is often used to fine-tune and de-bias the estimates of approximate Bayesian inference procedures. We propose a novel combination of optimization and sampling techniques for approximate Bayesian inference.
  arXiv  Detail & Related papers  (2021-06-30T11:00:24Z)
• Connection between inverse engineering and optimal control in shortcuts to adiabaticity [10.925879590519434]
  We consider fast high-fidelity control by using a shortcut to adiabaticity (STA) technique and optimal control theory ( OCT) Three specific examples, including expansion of cold atoms from the harmonic trap, atomic transport by moving harmonic trap, and spin dynamics in the presence of dissipation, are explicitly detailed.
  arXiv  Detail & Related papers  (2021-01-09T16:20:43Z)
• Accelerating Nonconvex Learning via Replica Exchange Langevin Diffusion [67.66101533752605]
  Langevin diffusion is a powerful method for non- optimization. We propose replica exchange, which swaps Langevin diffusions with different temperatures. By discretizing the replica exchange Langevin diffusion, we obtain a discretetime algorithm.
  arXiv  Detail & Related papers  (2020-07-04T02:52:11Z)
• Hessian-Free High-Resolution Nesterov Acceleration for Sampling [55.498092486970364]
  Nesterov's Accelerated Gradient (NAG) for optimization has better performance than its continuous time limit (noiseless kinetic Langevin) when a finite step-size is employed. This work explores the sampling counterpart of this phenonemon and proposes a diffusion process, whose discretizations can yield accelerated gradient-based MCMC methods.
  arXiv  Detail & Related papers  (2020-06-16T15:07:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.