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

arXiv:0910.4702 · Physical Review A

Role of controllability in optimizing quantum dynamics

Re-Bing Wu, Michael Hsieh, HERSCHEL A. RABITZ

Published Jun 7, 2011• 28 citations
arXivHTMLPDF

Abstract

This paper reveals an important role that controllability plays in the complexity of optimizing quantum control dynamics. We show that the loss of controllability generally leads to multiple locally suboptimal controls when gate fidelity in a quantum control system is maximized, which does not happen if the system is controllable. Such local suboptimal controls may attract an optimization algorithm into a local trap when a global optimal solution is sought, even if the target gate can be perfectly realized. This conclusion results from an analysis of the critical topology of the corresponding quantum control landscape, which refers to the gate fidelity objective as a functional of the control fields. For uncontrollable systems, due to SU(2) and SU(3) dynamical symmetries, the control landscape corresponding to an implementable target gate is proven to possess multiple locally optimal critical points, and its ruggedness can be further increased if the target gate is not realizable. These results imply that the optimization of quantum dynamics can be seriously impeded when operating with local search algorithms under these conditions, and thus full controllability is demanded.

DOI
10.1103/physreva.83.062306

Related papers

Quantum control landscapes with dynamic symmetry

Re-Bing Wu

This paper analyzes the topology of quantum control landscapes with dynamic symmetry, which is referred to as the optimization objective as a functional of control fields. We find that the ruggedness of the landscape, which determines the search efficiency for global optima, is dependent with the dynamic symmetry. This effect is demonstrated via the gate fidelity control landscape of a system whose controllability is restricted on a SU(2) dynamic symmetry group. We show that multiple local false traps (i.e., non-global suboptima) exist even if the target gate is realizable and that the number of these traps is increased by the loss of controllability, while the controllable systems are always devoid of false traps.

Chinese Control Conference (CCC)•Jul 29, 2010•0 citations

Searching for an optimal control in the presence of saddles on the quantum-mechanical observable landscape

Gregory Riviello, Re-Bing Wu, Qiuyang Sun +1 more

The broad success of theoretical and experimental quantum optimal control is intimately connected to the topology of the underlying control landscape. For several common quantum control goals, including the maximization of an observable expectation value, the landscape has been shown to lack local optima if three assumptions are satisfied: (i) the quantum system is controllable, (ii) the Jacobian of the map from the control field to the evolution operator is full rank, and (iii) the control field is not constrained. In the case of the observable objective, this favorable analysis shows that the associated landscape also contains saddles, i.e., critical points that are not local suboptimal extrema. In this paper, we investigate whether the presence of these saddles affects the trajectories of gradient-based searches for an optimal control. We show through simulations that both the detailed topology of the control landscape and the parameters of the system Hamiltonian influence whether the searches are attracted to a saddle. For some circumstances with a special initial state and target observable, optimizations may approach a saddle very closely, reducing the efficiency of the gradient algorithm. Encounters with such attractive saddles are found to be quite rare. Neither the presence of a large number of saddles on the control landscape nor a large number of system states increases the likelihood that a search will closely approach a saddle. Even for applications that encounter a saddle, well-designed gradient searches with carefully chosen algorithmic parameters will readily locate optimal controls.

arXiv:1612.09192•Physical Review A•Jun 22, 2017•10 citations

Exploring quantum control landscapes: Topology, features, and optimization scaling

Katharine W. Moore, HERSCHEL A. RABITZ

Quantum optimal control experiments and simulations have successfully manipulated the dynamics of systems ranging from atoms to biomolecules. Surprisingly, these collective works indicate that the effort (i.e., the number of algorithmic iterations) required to find an optimal control field appears to be essentially invariant to the complexity of the system. The present work explores this matter in a series of systematic optimizations of the state-to-state transition probability on model quantum systems with the number of states $N$ ranging from 5 through 100. The optimizations occur over a landscape defined by the transition probability as a function of the control field. Previous theoretical studies on the topology of quantum control landscapes established that they should be free of suboptimal traps under reasonable physical conditions. The simulations in this work include nearly 5000 individual optimization test cases, all of which confirm this prediction by fully achieving optimal population transfer of at least 99.9$%$ on careful attention to numerical procedures to ensure that the controls are free of constraints. Collectively, the simulation results additionally show invariance of required search effort to system dimension $N$. This behavior is rationalized in terms of the structural features of the underlying control landscape. The very attractive observed scaling with system complexity may be understood by considering the distance traveled on the control landscape during a search and the magnitude of the control landscape slope. Exceptions to this favorable scaling behavior can arise when the initial control field fluence is too large or when the target final state recedes from the initial state as $N$ increases.

arXiv:1006.3702•Physical Review A•Jul 12, 2011•54 citations

Quantum Optimally Controlled Transition Landscapes

HERSCHEL A. RABITZ, Michael Hsieh, Carey M. Rosenthal

A large number of experimental studies and simulations show that it is surprisingly easy to find excellent quality control over broad classes of quantum systems. We now prove that for controllable quantum systems with no constraints placed on the controls, the only allowed extrema of the transition probability landscape correspond to perfect control or no control. Under these conditions, no suboptimal local extrema exist as traps that would impede the search for an optimal control. The identified landscape structure is universal for all controllable quantum systems of the same dimension when seeking to maximize the same transition probability, regardless of the detailed nature of the system Hamiltonian. The presence of weak control field noise or environmental decoherence is shown to preserve the general structure of the control landscape, but at lower resolution.

Science•Mar 25, 2004•434 citations

Searching for quantum optimal controls under severe constraints

Gregory Riviello, Katharine Moore Tibbetts, Constantin Brif +4 more

The success of quantum optimal control for both experimental and theoretical objectives is connected to the topology of the corresponding control landscapes, which are free from local traps if three conditions are met: (1) the quantum system is controllable, (2) the Jacobian of the map from the control field to the evolution operator is of full rank, and (3) there are no constraints on the control field. This paper investigates how the violation of assumption (3) affects gradient searches for globally optimal control fields. The satisfaction of assumptions (1) and (2) ensures that the control landscape lacks fundamental traps, but certain control constraints can still introduce artificial traps. Proper management of these constraints is an issue of great practical importance for numerical simulations as well as optimization in the laboratory. Using optimal control simulations, we show that constraints on quantities such as the number of control variables, the control duration, and the field strength are potentially severe enough to prevent successful optimization of the objective. For each such constraint, we show that exceeding quantifiable limits can prevent gradient searches from reaching a globally optimal solution. These results demonstrate that careful choice of relevant control parameters helps to eliminate artificial traps and facilitates successful optimization.

arXiv:1502.00707•Physical Review A•Apr 6, 2015•28 citations

A CLOSER LOOK AT QUANTUM CONTROL LANDSCAPES AND THEIR IMPLICATION FOR CONTROL OPTIMIZATION

Pierre de Fouquieres, S. G. Schirmer

The control landscape for various canonical quantum control problems is considered. For the class of pure-state transfer problems, analysis of the fidelity as a functional over the unitary group reveals no suboptimal attractive critical points (traps). For the actual optimization problem over controls in L2(0, T), however, there are critical points for which the fidelity can assume any value in (0, 1), critical points for which the second order analysis is inconclusive, and traps. For the class of unitary operator optimization problems analysis of the fidelity over the unitary group shows that while there are no traps over U(N), traps already emerge when the domain is restricted to the special unitary group. The traps on the group can be eliminated by modifying the performance index, corresponding to optimization over the projective unitary group. However, again, the set of critical points for the actual optimization problem for controls in L2(0, T) is larger and includes traps, some of which remain traps even when the target time is allowed to vary.

arXiv:1004.3492•Infinite Dimensional Analysis Quantum Probability and Related Topics•Sep 1, 2013•73 citations
This paper reveals an important role that controllability plays in the complexity of optimizing quantum control dynamics. We show that the loss of controllability generally leads to multiple locally suboptimal controls when gate fidelity in a quantum control system is maximized, which does not happen if the system is controllable. Such local suboptimal controls may attract an optimization algorithm into a local trap when a global optimal solution is sought, even if the target gate can be perfectly realized. This conclusion results from an analysis of the critical topology of the corresponding quantum control landscape, which refers to the gate fidelity objective as a functional of the control fields. For uncontrollable systems, due to SU(2) and SU(3) dynamical symmetries, the control landscape corresponding to an implementable target gate is proven to possess multiple locally optimal critical points, and its ruggedness can be further increased if the target gate is not realizable. These results imply that the optimization of quantum dynamics can be seriously impeded when operating with local search algorithms under these conditions, and thus full controllability is demanded.
This paper analyzes the topology of quantum control landscapes with dynamic symmetry, which is referred to as the optimization objective as a functional of control fields. We find that the ruggedness of the landscape, which determines the search efficiency for global optima, is dependent with the dynamic symmetry. This effect is demonstrated via the gate fidelity control landscape of a system whose controllability is restricted on a SU(2) dynamic symmetry group. We show that multiple local false traps (i.e., non-global suboptima) exist even if the target gate is realizable and that the number of these traps is increased by the loss of controllability, while the controllable systems are always devoid of false traps.
The broad success of theoretical and experimental quantum optimal control is intimately connected to the topology of the underlying control landscape. For several common quantum control goals, including the maximization of an observable expectation value, the landscape has been shown to lack local optima if three assumptions are satisfied: (i) the quantum system is controllable, (ii) the Jacobian of the map from the control field to the evolution operator is full rank, and (iii) the control field is not constrained. In the case of the observable objective, this favorable analysis shows that the associated landscape also contains saddles, i.e., critical points that are not local suboptimal extrema. In this paper, we investigate whether the presence of these saddles affects the trajectories of gradient-based searches for an optimal control. We show through simulations that both the detailed topology of the control landscape and the parameters of the system Hamiltonian influence whether the searches are attracted to a saddle. For some circumstances with a special initial state and target observable, optimizations may approach a saddle very closely, reducing the efficiency of the gradient algorithm. Encounters with such attractive saddles are found to be quite rare. Neither the presence of a large number of saddles on the control landscape nor a large number of system states increases the likelihood that a search will closely approach a saddle. Even for applications that encounter a saddle, well-designed gradient searches with carefully chosen algorithmic parameters will readily locate optimal controls.
Quantum optimal control experiments and simulations have successfully manipulated the dynamics of systems ranging from atoms to biomolecules. Surprisingly, these collective works indicate that the effort (i.e., the number of algorithmic iterations) required to find an optimal control field appears to be essentially invariant to the complexity of the system. The present work explores this matter in a series of systematic optimizations of the state-to-state transition probability on model quantum systems with the number of states NNN ranging from 5 through 100. The optimizations occur over a landscape defined by the transition probability as a function of the control field. Previous theoretical studies on the topology of quantum control landscapes established that they should be free of suboptimal traps under reasonable physical conditions. The simulations in this work include nearly 5000 individual optimization test cases, all of which confirm this prediction by fully achieving optimal population transfer of at least 99.9% on careful attention to numerical procedures to ensure that the controls are free of constraints. Collectively, the simulation results additionally show invariance of required search effort to system dimension NNN. This behavior is rationalized in terms of the structural features of the underlying control landscape. The very attractive observed scaling with system complexity may be understood by considering the distance traveled on the control landscape during a search and the magnitude of the control landscape slope. Exceptions to this favorable scaling behavior can arise when the initial control field fluence is too large or when the target final state recedes from the initial state as NNN increases.
A large number of experimental studies and simulations show that it is surprisingly easy to find excellent quality control over broad classes of quantum systems. We now prove that for controllable quantum systems with no constraints placed on the controls, the only allowed extrema of the transition probability landscape correspond to perfect control or no control. Under these conditions, no suboptimal local extrema exist as traps that would impede the search for an optimal control. The identified landscape structure is universal for all controllable quantum systems of the same dimension when seeking to maximize the same transition probability, regardless of the detailed nature of the system Hamiltonian. The presence of weak control field noise or environmental decoherence is shown to preserve the general structure of the control landscape, but at lower resolution.
The success of quantum optimal control for both experimental and theoretical objectives is connected to the topology of the corresponding control landscapes, which are free from local traps if three conditions are met: (1) the quantum system is controllable, (2) the Jacobian of the map from the control field to the evolution operator is of full rank, and (3) there are no constraints on the control field. This paper investigates how the violation of assumption (3) affects gradient searches for globally optimal control fields. The satisfaction of assumptions (1) and (2) ensures that the control landscape lacks fundamental traps, but certain control constraints can still introduce artificial traps. Proper management of these constraints is an issue of great practical importance for numerical simulations as well as optimization in the laboratory. Using optimal control simulations, we show that constraints on quantities such as the number of control variables, the control duration, and the field strength are potentially severe enough to prevent successful optimization of the objective. For each such constraint, we show that exceeding quantifiable limits can prevent gradient searches from reaching a globally optimal solution. These results demonstrate that careful choice of relevant control parameters helps to eliminate artificial traps and facilitates successful optimization.
The control landscape for various canonical quantum control problems is considered. For the class of pure-state transfer problems, analysis of the fidelity as a functional over the unitary group reveals no suboptimal attractive critical points (traps). For the actual optimization problem over controls in L2(0, T), however, there are critical points for which the fidelity can assume any value in (0, 1), critical points for which the second order analysis is inconclusive, and traps. For the class of unitary operator optimization problems analysis of the fidelity over the unitary group shows that while there are no traps over U(N), traps already emerge when the domain is restricted to the special unitary group. The traps on the group can be eliminated by modifying the performance index, corresponding to optimization over the projective unitary group. However, again, the set of critical points for the actual optimization problem for controls in L2(0, T) is larger and includes traps, some of which remain traps even when the target time is allowed to vary.