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

The Journal of Chemical Physics

A propagation toolkit to design quantum controls

Frank L. Yip, David A. Mazziotti, HERSCHEL A. RABITZ

Published Apr 23, 2003• 34 citations
Publisher

Abstract

A toolkit of time-propagation operators, to be stored and recalled as needed, is incorporated into the algorithms for the optimal control of quantum systems. Typically, the control field ε(t) revisits the same values many times during the full time evolution. This repetition may be utilized to enhance efficiency through a convenient toolkit of propagators where the propagators are computed and stored only at a small number of discrete electric-field values in the dynamic range εmin⩽ε(t)⩽εmax. At each time step of the controlled evolution a specific member of the pre-calculated toolkit is selected as dictated by the local control field value. The toolkit can reduce the cost of control field design by a factor scaling as ∼N for quantum systems described in a basis set of N states. Optimal control with the toolkit is demonstrated for systems up to dimension N=30.

DOI
10.1063/1.1564815

Related papers

Concatenated toolkit for quantum optimal control wave-function propagation

Michael Hsieh, HERSCHEL A. RABITZ

Numerical propagation of the Schrödinger equation is the bottleneck in many quantum optimal control computations. For a quantum system of N states with an electric-field-dipole interaction, the use of a propagation toolkit introduced in a prior work yields an O(N) reduction in floating-point operations per wave function propagation. A concatenation scheme for the toolkit method is introduced, and a scaling analysis shows a significant additional reduction in computational cost. The method exploits the fact that the same sequences of discretized control field values are often repeated many times in a control simulation. The concatenated toolkit is benchmarked against the standard toolkit in a numerical simulation.

Physical Review E•Mar 17, 2008•7 citations

Quantum control implemented as combinatorial optimization

Traci Strohecker, HERSCHEL A. RABITZ

Optimal control theory provides a general means for designing controls to manipulate quantum phenomena. Traditional implementation requires solving coupled nonlinear equations to obtain the optimal control solution, whereas this work introduces a combinatorial quantum control (CQC) algorithm to avoid this complexity. The CQC technique uses a predetermined toolkit of small time step propagators in conjunction with combinatorial optimization to identify a proper sequence for the toolkit members. Results indicate that the CQC technique exhibits invariance of search effort to the number of system states and very favorable scaling upon comparison to a standard gradient algorithm, taking into consideration that CQC is easily parallelizable.

Journal of Computational Chemistry•May 6, 2009•3 citations

Quantum Control without Quantum States

Modesto Orozco-Ruiz, Nguyen H. Le, Florian Mintert

We show that combining ideas from the fields of quantum invariants and optimal control can be used to design optimal quantum control solutions without explicit reference to quantum states. The states are specified only implicitly in terms of operators to which they are eigenstates. The scaling in numerical effort of the resultant approach is not given by the typically exponentially growing effort required for the specification of a time-evolved quantum state, but it is given by the effort required for the specification of a time-evolved operator. For certain Hamiltonians, this effort can be polynomial in the system size. We describe how control problems for state preparation and the realization of propagators can be formulated in this approach, and we provide explicit control solutions for a spin chain with an extended Ising Hamiltonian. The states considered for state-preparation protocols include eigenstates of Hamiltonians with more than pairwise interactions and these Hamiltonians are also used for the definition of target propagators. The cost of describing suitable time-evolving operators grows only quadratically with the system size, allowing us to construct explicit control solutions for up to 50 spins. While subexponential scaling is obtained only in special cases, we provide several examples that demonstrate favorable scaling beyond the extended Ising model. Published by the American Physical Society 2024

arXiv:2405.15609•PRX Quantum•Dec 20, 2024•5 citations

Improved quantum computing with higher-order Trotter decomposition

Xiaodong Yang, Xinfang Nie, Yunlan Ji +3 more

In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ans\"atze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.

arXiv:2205.02520•Physical Review A•Oct 3, 2022•17 citations

A Local-Time Algorithm for Achieving Quantum Control

Frank L. Yip, David A. Mazziotti, HERSCHEL A. RABITZ

A local-time algorithm (LTA) is developed for designing electric fields to guide a quantum system toward a desired observable. The LTA is a noniterative forward marching procedure based on making a choice for the control field over the next immediate small time increment t i +1 − t i = Δ solely on the ability of the local field value ε i in that increment to take the system closer to the target goal. Each locally optimal field value ε i, i = 1, 2,... is chosen from a fixed toolkit of discretized members {ε j } that sample the dynamic range ε min ≤ ε ≤ ε max of the control. Despite the strictly local myopic design process, the LTA is shown to be capable of achieving good quality control results in model systems. The LTA has no fixed time to reach the target, and the time it takes to produce good quality control primarily depends on the “distance” between the initial and target states, as measured by the number of intermediate state linkages connecting them and their strength. A comparison is made between the behavior of optimal control theory (OCT) and the LTA; each has different characteristics, and it is shown that the LTA can be computationally very efficient. LTA and traditional OCT methods can be viewed as extreme cases of a larger class of time-windowed approaches to control.

The Journal of Physical Chemistry A•Aug 15, 2003•21 citations

Fast, high precision dynamics in quantum optimal control theory

Mogens Dalgaard, Felix Motzoi

Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.

arXiv:2110.06187•Journal of Physics B Atomic Molecular and Optical Physics•Apr 2, 2022•15 citations
A toolkit of time-propagation operators, to be stored and recalled as needed, is incorporated into the algorithms for the optimal control of quantum systems. Typically, the control field ε(t) revisits the same values many times during the full time evolution. This repetition may be utilized to enhance efficiency through a convenient toolkit of propagators where the propagators are computed and stored only at a small number of discrete electric-field values in the dynamic range εmin⩽ε(t)⩽εmax. At each time step of the controlled evolution a specific member of the pre-calculated toolkit is selected as dictated by the local control field value. The toolkit can reduce the cost of control field design by a factor scaling as ∼N for quantum systems described in a basis set of N states. Optimal control with the toolkit is demonstrated for systems up to dimension N=30.
Numerical propagation of the Schrödinger equation is the bottleneck in many quantum optimal control computations. For a quantum system of N states with an electric-field-dipole interaction, the use of a propagation toolkit introduced in a prior work yields an O(N) reduction in floating-point operations per wave function propagation. A concatenation scheme for the toolkit method is introduced, and a scaling analysis shows a significant additional reduction in computational cost. The method exploits the fact that the same sequences of discretized control field values are often repeated many times in a control simulation. The concatenated toolkit is benchmarked against the standard toolkit in a numerical simulation.
Optimal control theory provides a general means for designing controls to manipulate quantum phenomena. Traditional implementation requires solving coupled nonlinear equations to obtain the optimal control solution, whereas this work introduces a combinatorial quantum control (CQC) algorithm to avoid this complexity. The CQC technique uses a predetermined toolkit of small time step propagators in conjunction with combinatorial optimization to identify a proper sequence for the toolkit members. Results indicate that the CQC technique exhibits invariance of search effort to the number of system states and very favorable scaling upon comparison to a standard gradient algorithm, taking into consideration that CQC is easily parallelizable.
We show that combining ideas from the fields of quantum invariants and optimal control can be used to design optimal quantum control solutions without explicit reference to quantum states. The states are specified only implicitly in terms of operators to which they are eigenstates. The scaling in numerical effort of the resultant approach is not given by the typically exponentially growing effort required for the specification of a time-evolved quantum state, but it is given by the effort required for the specification of a time-evolved operator. For certain Hamiltonians, this effort can be polynomial in the system size. We describe how control problems for state preparation and the realization of propagators can be formulated in this approach, and we provide explicit control solutions for a spin chain with an extended Ising Hamiltonian. The states considered for state-preparation protocols include eigenstates of Hamiltonians with more than pairwise interactions and these Hamiltonians are also used for the definition of target propagators. The cost of describing suitable time-evolving operators grows only quadratically with the system size, allowing us to construct explicit control solutions for up to 50 spins. While subexponential scaling is obtained only in special cases, we provide several examples that demonstrate favorable scaling beyond the extended Ising model. Published by the American Physical Society 2024
In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ans\"atze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.
A local-time algorithm (LTA) is developed for designing electric fields to guide a quantum system toward a desired observable. The LTA is a noniterative forward marching procedure based on making a choice for the control field over the next immediate small time increment t i +1 − t i = Δ solely on the ability of the local field value ε i in that increment to take the system closer to the target goal. Each locally optimal field value ε i, i = 1, 2,... is chosen from a fixed toolkit of discretized members {ε j } that sample the dynamic range ε min ≤ ε ≤ ε max of the control. Despite the strictly local myopic design process, the LTA is shown to be capable of achieving good quality control results in model systems. The LTA has no fixed time to reach the target, and the time it takes to produce good quality control primarily depends on the “distance” between the initial and target states, as measured by the number of intermediate state linkages connecting them and their strength. A comparison is made between the behavior of optimal control theory (OCT) and the LTA; each has different characteristics, and it is shown that the LTA can be computationally very efficient. LTA and traditional OCT methods can be viewed as extreme cases of a larger class of time-windowed approaches to control.
Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.