Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Lasers and Electro-Optics

Mechanistic Comparison of Different Solutions Found in Closed-Loop Quantum Control Simulations

James White, David Cardoza, P. H. Bucksbaum

Published May 1, 2007• 0 citations
Publisher

Abstract

We investigate how variable number affects mechanistic complexity in solutions found using closed-loop learning control. We find that we can facilitate our mechanistic understanding by initially using fewer variables for the optimization.
DOI
10.1109/cleo.2007.4453332

Related papers

Mechanistic comparison of different solutions found in closed-loop quantum control simulations

James White, David Cardoza, P. H. Bucksbaum

We investigate how variable number affects mechanistic complexity in solutions found using closed-loop learning control. We find that we can facilitate our mechanistic understanding by initially using fewer variables for the optimization.

Quantum Electronics and Laser Science Conference•May 1, 2007•0 citations

Tying the loop tighter around quantum systems

HERSCHEL A. RABITZ

In recent years, great strides have been made in controlling quantum phenomena through the use of tailored laser pulses. This paper discusses several issues that lie ahead, drawing on the ability to perform massive numbers of closed-loop laser control experiments. Particular attention is given to the robustness of these experiments, the capability of deducing control mechanisms and the introduction of special closed-loop control techniques to reveal Hamiltonian information. All these prospects point towards an increasing ability to control and understand quantum systems through close-loop laboratory techniques.

Journal of Modern Optics•Jan 1, 2003•2 citations

Role of bases in quantum optimal control

Alice Pagano, Matthias M. Müller, Tommaso Calarco +2 more

Quantum optimal control (QOC) supports the advance of quantum technologies by tackling its problems at the pulse level: numerical approaches iteratively work toward a given target by parametrizing the applied time-dependent fields with a finite set of variables. The effectiveness of the resulting optimization depends on the complexity of the problem and the number of variables. We consider different parametrizations in terms of basis functions, asking whether the choice of the applied basis affects the quality of the optimization. Furthermore, we consider strategies to choose the most suitable basis. For comparison, we test three different randomizable bases---introducing the sinc and sigmoid bases as alternatives to the Fourier basis---on QOC problems of varying complexity. For each problem, the basis-specific convergence rates result in a unique ranking. Especially for expensive evaluations, e.g., in closed loop, a potential speedup by a factor of up to 10 may be crucial for the optimization's feasibility. We conclude that a problem-dependent basis choice is an influential factor for QOC efficiency and provide advice for its approach.

arXiv:2405.20889•Physical Review A•Dec 13, 2024•7 citations

Low-Depth Mechanisms for Quantum Optimization

Jarrod R. McClean, Matthew P. Harrigan, Masoud Mohseni +6 more

By gaining intuition about the mechanisms by which quantum optimization algorithms solve problems, approaches are identified that substantially improve the performance of quantum algorithms for this task.

arXiv:2008.08615•PRX Quantum•Jul 21, 2021•44 citations

Algorithms For Closed Loop Ultrafast Control of Quantum Dynamics

HERSCHEL A. RABITZ

Various learning algorithms have been proposed to guide the laser control of quantum dynamics in the laboratory. This presentation will discuss these proposals, as well as some new algorithmic perspectives.

International Conference on Ultrafast Phenomena•Jan 1, 2000•0 citations

On the relationship between quantum control landscape structure and optimization complexity

Katharine W. Moore, Michael Hsieh, HERSCHEL A. RABITZ

It has been widely observed in optimal control simulations and experiments that state preparation is surprisingly easy to achieve, regardless of the dimension N of the system Hilbert space. In contrast, simulations for the generation of targeted unitary transformations indicate that the effort increases exponentially with N. In order to understand such behavior, the concept of quantum control landscapes was recently introduced, where the landscape is defined as the physical objective, as a function of the control variables. The present work explores how the local structure of the control landscape influences the effectiveness and efficiency of quantum optimal control search efforts. Optimizations of state and unitary transformation preparation using kinematic control variables (i.e., the elements of the action matrix) are performed with gradient, genetic, and simplex algorithms. The results indicate that the search effort scales weakly, or possibly independently, with N for state preparation, while the search effort for the unitary transformation objective increases exponentially with N. Analysis of the mean path length traversed during a search trajectory through the space of action matrices and the local structure along this trajectory provides a basis to explain the difference in the scaling of the search effort with N for these control objectives. Much more favorable scaling for unitary transformation preparation arises upon specifying an initial action matrix based on state preparation results. The consequences of choosing a reduced number of control variables for state preparation is also investigated, showing a significant reduction in performance for using fewer than 2N-2 variables, which is consistent with the topological analysis of the associated landscape.

The Journal of Chemical Physics•Apr 18, 2008•48 citations
In recent years, great strides have been made in controlling quantum phenomena through the use of tailored laser pulses. This paper discusses several issues that lie ahead, drawing on the ability to perform massive numbers of closed-loop laser control experiments. Particular attention is given to the robustness of these experiments, the capability of deducing control mechanisms and the introduction of special closed-loop control techniques to reveal Hamiltonian information. All these prospects point towards an increasing ability to control and understand quantum systems through close-loop laboratory techniques.
Quantum optimal control (QOC) supports the advance of quantum technologies by tackling its problems at the pulse level: numerical approaches iteratively work toward a given target by parametrizing the applied time-dependent fields with a finite set of variables. The effectiveness of the resulting optimization depends on the complexity of the problem and the number of variables. We consider different parametrizations in terms of basis functions, asking whether the choice of the applied basis affects the quality of the optimization. Furthermore, we consider strategies to choose the most suitable basis. For comparison, we test three different randomizable bases---introducing the sinc and sigmoid bases as alternatives to the Fourier basis---on QOC problems of varying complexity. For each problem, the basis-specific convergence rates result in a unique ranking. Especially for expensive evaluations, e.g., in closed loop, a potential speedup by a factor of up to 10 may be crucial for the optimization's feasibility. We conclude that a problem-dependent basis choice is an influential factor for QOC efficiency and provide advice for its approach.
It has been widely observed in optimal control simulations and experiments that state preparation is surprisingly easy to achieve, regardless of the dimension N of the system Hilbert space. In contrast, simulations for the generation of targeted unitary transformations indicate that the effort increases exponentially with N. In order to understand such behavior, the concept of quantum control landscapes was recently introduced, where the landscape is defined as the physical objective, as a function of the control variables. The present work explores how the local structure of the control landscape influences the effectiveness and efficiency of quantum optimal control search efforts. Optimizations of state and unitary transformation preparation using kinematic control variables (i.e., the elements of the action matrix) are performed with gradient, genetic, and simplex algorithms. The results indicate that the search effort scales weakly, or possibly independently, with N for state preparation, while the search effort for the unitary transformation objective increases exponentially with N. Analysis of the mean path length traversed during a search trajectory through the space of action matrices and the local structure along this trajectory provides a basis to explain the difference in the scaling of the search effort with N for these control objectives. Much more favorable scaling for unitary transformation preparation arises upon specifying an initial action matrix based on state preparation results. The consequences of choosing a reduced number of control variables for state preparation is also investigated, showing a significant reduction in performance for using fewer than 2N-2 variables, which is consistent with the topological analysis of the associated landscape.