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:2512.10290

Gradient projection method and stochastic search for some optimal control models with spin chains. II

Oleg V. Morzhin

quant-phmath.OCSubmitted Dec 11, 2025• Announced Dec 12, 2025
arXivHTMLPDF

Abstract

This article (II) continues the research described in [Morzhin O.V. Gradient projection method and stochastic search for some optimal control models with spin chains. I (submitted)] (Article I), derives the needed finite-dimensional gradients corresponding to the infinite-dimensional gradients obtained in Article I, both for transfer and keeping problems at a certain $N$-dimensional spin chain, and correspondingly adapts a projection-type condition for optimality, gradient projection method (GPM). For the case $N=3$, the given in this article examples together with Example 3 in Article I show that: a) the adapted GPM and genetic algorithm (GA) successfully solved numerically the considered transfer and keeping problems; b) the two- and three-step GPM forms significantly surpass the one-step GPM. Moreover, GA and a special class of controls were successfully used in such the transfer problem that $N=20$ and the final time is not assigned.

Comments
14 pages, 3 figures, 3 tables

Related papers

Gradient projection method and stochastic search for some optimal control models with spin chains. I

Oleg V. Morzhin

This article (I) considers the known optimal control model of a quantum information transfer along a spin chain with controlled external parabolic magnetic field, with an arbitrary length. The article adds certain lower and upper pointwise constraints on controls, adds the problem of keeping the signal at the last spin, considers various classes of controls. For these problems under piecewise continuous controls, the projection-type linearized Pontryagin maximum principle, gradient projection method's constructions in its one- and two- and three-step forms were adapted by analogy with [Morzhin O.V., Pechen A.N. J. Phys. A: Math. Theor., 2025]. Moreover, an example with a genetic algorithm's successful use under a special class of controls is given.

quant-pharXiv:2512.10093•The Bulletin of Irkutsk State University Series Mathematics•Dec 12, 2025•0 citations

Some Optimization Methods for Quantum Systems: Gradient Projection Method on Stiefel Manifolds and Beyond

Alexander Nikolaevich Pechen

Methods of optimization and control of quantum systems are widely used for various applications in quantum technologies including laser control of chemical reactions, nuclear magnetic resonance, gate generation for quantum computing, describing quantum transport in photosynthesis, etc. Among many topics in quantum control, we briefly outline Riemannian optimization and gradient projection method (GPM) on complex Stiefel manifolds and their relation to quantum control, as well as various related optimization tools such as incoherent GRAPE (InGRAPE) modification of the gradient ascent pulse engineering (GRAPE) algorithm, GPM in the dynamic picture for constrained optimization, and demonstrate operation of GRAPE and GPM for an investigation of the optimization efficiency over unconstrained and constrained quantum control landscapes for an example of a three-level $$\Xi $$ -system having a seventh-order trap.1

Russian Microelectronics•Dec 1, 2025•0 citations

Controlled State Transfer in Central Spin Models

Martiros Khurshudyan

In the recent literature, various aspects of the transfer of quantum states by spin chains have been thoroughly investigated. Part of the existing study is devoted to the problem of optimal control, with the goal of achieving a highly reliable information/state transfer for a given time T. In general, achieving this goal is not an easy task in the case of (open) quantum systems. Various approaches have been developed and applied, including Krotov’s method to study the problem. It is a gradient-based method used here to study the problem of state transfer control in central spin models. Our results show that with Krotov’s method, it is possible to find an optimal control form that allows for very-high-fidelity state transfer in the central spin models we have developed. Our results will be of interest for a better understanding of the non-trivial effects of the classical world on the quantum world, which have been discussed in the form of various new effects, including the Epstein effect, in the recent literature.

Symmetry•Apr 17, 2024•4 citations

Diverse efficiency of observable optimization for four-level quantum systems with higher-order traps

Alexander Pechen, Boris Volkov

In this work, we perform an analytical and numerical analysis of quantum landscapes for controlling special four-level quantum systems for which we prove that the null control is a five-order trap: a $V-V$ system and an anharmonic system. As a control goal, an observable optimization is considered. The rigorous theoretical analysis is followed by the numerical experiments based on the GRadient Ascent Pulse Engineering (GRAPE) algorithm and Gradient Projection Method (GPM), performed to investigate the behavior of the efficiency of optimization for unconstrained (using GRAPE) and constrained (using GPM) controls. As the main result, we observe an interesting phenomenon with a diverse behavior of the optimization efficiency depending on the system Hamiltonian -- sharp increase of the optimization efficiency up to 100% at certain distance from the null control for a V-V system, while much slower and less significant increase (and even small decrease) for a system with the chain interaction. This sharp difference might be related with the fine structure of the subspace of controls where second derivative of the objective functional is zero.

quant-pharXiv:2607.01217•Physica Scripta•Jul 2, 2026•0 citations

Gradient projection method for constrained quantum control

Oleg Vasilevich Morzhin, Alexander Nikolaevich Pechen

Abstract In this work, we adopt the gradient projection method (GPM) to problems of quantum control. For general N-level closed and open quantum systems, we derive the corresponding adjoint systems and gradients of the objective functionals and provide the projection versions of the Pontryagin maximum principle and the GPM, all directly in terms of quantum objects such as evolution operator, Hamiltonians, density matrices, etc. Various forms of the GPM, including one- and two-step, are provided and compared. We formulate the GPM both for closed and open quantum systems, latter for the general case with simultaneous coherent and incoherent controls. The GPM is designed to perform local gradient based optimization in the case when bounds are imposed on the controls. The main advantage of the method is that it allows to exactly satisfy the bounds, in difference to other approaches such as adding constraints as weight to an objective. We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states for models of superconducting qubits under the constraint when controls are zero at the initial and final times, steering an open quantum system to a target density matrix for simulating action of the Werner–Holevo channel, etc.

arXiv:2411.19644•Journal of Physics A Mathematical and Theoretical•Mar 27, 2025•7 citations

On the Analysis of Quantum Control Landscapes Using Gradient Projection Method and Pontryagin Maximum Principle

Alexander Nikolaevich Pechen

In this work, we consider the problem of the analysis of quantum control landscapes in both situations when the controls during optimization are unconstrained and when they should satisfy a given constraint, for example their amplitude should be bounded by some constant value. For the analysis of unconstrained quantum control landscapes, a special approach was developed in [Pechen and Tannor, Israel J. of Chemistry 52 (5), 467–472 (2012)] based on a fixed step gradient ascent pulse engineering (GRAPE) algorithm. Here we also adopt a GRAPE approach based on the Pontryagin maximum principle (PMP). For the analysis of the constrained quantum control landscapes, we adopt the gradient projection method which was developed for quantum systems in [A. Oza et al., J. Phys. A: Math. Theor. 42, 205305 (2009)] (GPM; for our purpose the most suitable is a one-step GPM with a fixed step), both for closed and open quantum systems. As an explicit example, we apply these approaches to study quantum control landscape for optimization of an observable mean value for a three-level degenerate $$\Xi$$ -system system having a seventh-order trap.

Lobachevskii Journal of Mathematics•Jun 1, 2025•7 citations
This article (II) continues the research described in [Morzhin O.V. Gradient projection method and stochastic search for some optimal control models with spin chains. I (submitted)] (Article I), derives the needed finite-dimensional gradients corresponding to the infinite-dimensional gradients obtained in Article I, both for transfer and keeping problems at a certain NNN-dimensional spin chain, and correspondingly adapts a projection-type condition for optimality, gradient projection method (GPM). For the case N=3N=3N=3, the given in this article examples together with Example 3 in Article I show that: a) the adapted GPM and genetic algorithm (GA) successfully solved numerically the considered transfer and keeping problems; b) the two- and three-step GPM forms significantly surpass the one-step GPM. Moreover, GA and a special class of controls were successfully used in such the transfer problem that N=20N=20N=20 and the final time is not assigned.
This article (I) considers the known optimal control model of a quantum information transfer along a spin chain with controlled external parabolic magnetic field, with an arbitrary length. The article adds certain lower and upper pointwise constraints on controls, adds the problem of keeping the signal at the last spin, considers various classes of controls. For these problems under piecewise continuous controls, the projection-type linearized Pontryagin maximum principle, gradient projection method's constructions in its one- and two- and three-step forms were adapted by analogy with [Morzhin O.V., Pechen A.N. J. Phys. A: Math. Theor., 2025]. Moreover, an example with a genetic algorithm's successful use under a special class of controls is given.
Methods of optimization and control of quantum systems are widely used for various applications in quantum technologies including laser control of chemical reactions, nuclear magnetic resonance, gate generation for quantum computing, describing quantum transport in photosynthesis, etc. Among many topics in quantum control, we briefly outline Riemannian optimization and gradient projection method (GPM) on complex Stiefel manifolds and their relation to quantum control, as well as various related optimization tools such as incoherent GRAPE (InGRAPE) modification of the gradient ascent pulse engineering (GRAPE) algorithm, GPM in the dynamic picture for constrained optimization, and demonstrate operation of GRAPE and GPM for an investigation of the optimization efficiency over unconstrained and constrained quantum control landscapes for an example of a three-level Ξ\Xi Ξ -system having a seventh-order trap.1
In the recent literature, various aspects of the transfer of quantum states by spin chains have been thoroughly investigated. Part of the existing study is devoted to the problem of optimal control, with the goal of achieving a highly reliable information/state transfer for a given time T. In general, achieving this goal is not an easy task in the case of (open) quantum systems. Various approaches have been developed and applied, including Krotov’s method to study the problem. It is a gradient-based method used here to study the problem of state transfer control in central spin models. Our results show that with Krotov’s method, it is possible to find an optimal control form that allows for very-high-fidelity state transfer in the central spin models we have developed. Our results will be of interest for a better understanding of the non-trivial effects of the classical world on the quantum world, which have been discussed in the form of various new effects, including the Epstein effect, in the recent literature.
In this work, we perform an analytical and numerical analysis of quantum landscapes for controlling special four-level quantum systems for which we prove that the null control is a five-order trap: a V−VV-VV−V system and an anharmonic system. As a control goal, an observable optimization is considered. The rigorous theoretical analysis is followed by the numerical experiments based on the GRadient Ascent Pulse Engineering (GRAPE) algorithm and Gradient Projection Method (GPM), performed to investigate the behavior of the efficiency of optimization for unconstrained (using GRAPE) and constrained (using GPM) controls. As the main result, we observe an interesting phenomenon with a diverse behavior of the optimization efficiency depending on the system Hamiltonian -- sharp increase of the optimization efficiency up to 100% at certain distance from the null control for a V-V system, while much slower and less significant increase (and even small decrease) for a system with the chain interaction. This sharp difference might be related with the fine structure of the subspace of controls where second derivative of the objective functional is zero.
Abstract In this work, we adopt the gradient projection method (GPM) to problems of quantum control. For general N-level closed and open quantum systems, we derive the corresponding adjoint systems and gradients of the objective functionals and provide the projection versions of the Pontryagin maximum principle and the GPM, all directly in terms of quantum objects such as evolution operator, Hamiltonians, density matrices, etc. Various forms of the GPM, including one- and two-step, are provided and compared. We formulate the GPM both for closed and open quantum systems, latter for the general case with simultaneous coherent and incoherent controls. The GPM is designed to perform local gradient based optimization in the case when bounds are imposed on the controls. The main advantage of the method is that it allows to exactly satisfy the bounds, in difference to other approaches such as adding constraints as weight to an objective. We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states for models of superconducting qubits under the constraint when controls are zero at the initial and final times, steering an open quantum system to a target density matrix for simulating action of the Werner–Holevo channel, etc.
In this work, we consider the problem of the analysis of quantum control landscapes in both situations when the controls during optimization are unconstrained and when they should satisfy a given constraint, for example their amplitude should be bounded by some constant value. For the analysis of unconstrained quantum control landscapes, a special approach was developed in [Pechen and Tannor, Israel J. of Chemistry 52 (5), 467–472 (2012)] based on a fixed step gradient ascent pulse engineering (GRAPE) algorithm. Here we also adopt a GRAPE approach based on the Pontryagin maximum principle (PMP). For the analysis of the constrained quantum control landscapes, we adopt the gradient projection method which was developed for quantum systems in [A. Oza et al., J. Phys. A: Math. Theor. 42, 205305 (2009)] (GPM; for our purpose the most suitable is a one-step GPM with a fixed step), both for closed and open quantum systems. As an explicit example, we apply these approaches to study quantum control landscape for optimization of an observable mean value for a three-level degenerate Ξ\XiΞ -system system having a seventh-order trap.