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:1710.09053 · Quantum Information Processing

Controlled quantum search

K. de Lacy, Lyle Noakes, Jason Twamley, Jingbo B. Wang

Published Aug 28, 2018• 7 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-2031-6

Related papers

Quantum Search

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•0 citations

Searching for quantum optimal control fields in the presence of singular critical points

Gregory Riviello, Constantin Brif, Ruixing Long +4 more

Quantum optimal control has enjoyed wide success for a variety of theoretical and experimental objectives. These favorable results have been attributed to advantageous properties of the corresponding control landscapes, which are free from local optima 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 full rank, and (3) the control field is not constrained. This paper explores how gradient searches for globally optimal control fields are affected by deviations from assumption (2). In some quantum control problems, so-called singular critical points, at which the Jacobian is rank deficient, may exist on the landscape. Using optimal control simulations, we show that search failure is only observed when a singular critical point is also a second-order trap, which occurs if the control problem meets additional conditions involving the system Hamiltonian and/or the control objective. All known second-order traps occur at constant control fields, and we also show that they only affect searches that originate very close to them. As a result, even when such traps exist on the control landscape, they are unlikely to affect well-designed gradient optimizations under realistic searching conditions.

arXiv:1405.0204•Physical Review A•Jul 7, 2014•34 citations

Quantum Search

Prateek Tandon, Stanley Lam, Ben Shih +3 more

Synthesis lectures on quantum computing•Jan 1, 2017•0 citations

Search complexity and resource scaling for the quantum optimal control of unitary transformations

Katharine W. Moore, Raj Chakrabarti, Gregory Riviello +1 more

The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources required, particularly for systems with large Hilbert spaces. Prior work on unitary transformation control indicates that (i) for controllable systems, local extrema in the search landscape for optimal control of quantum gates have null measure, facilitating the convergence of local search algorithms, but (ii) the required time for convergence to optimal controls can scale exponentially with the Hilbert space dimension. Depending on the control-system Hamiltonian, the landscape structure and scaling may vary. This work introduces methods for quantifying Hamiltonian-dependent and kinematic effects on control optimization dynamics in order to classify quantum systems according to the search effort and control resources required to implement arbitrary unitary transformations.

arXiv:1006.1829•Physical Review A•Jan 31, 2011•54 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•11 citations

Quantum Search Algorithm

Stefano Olivares

Lecture notes in physics•Jan 1, 2025•0 citations
Quantum optimal control has enjoyed wide success for a variety of theoretical and experimental objectives. These favorable results have been attributed to advantageous properties of the corresponding control landscapes, which are free from local optima 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 full rank, and (3) the control field is not constrained. This paper explores how gradient searches for globally optimal control fields are affected by deviations from assumption (2). In some quantum control problems, so-called singular critical points, at which the Jacobian is rank deficient, may exist on the landscape. Using optimal control simulations, we show that search failure is only observed when a singular critical point is also a second-order trap, which occurs if the control problem meets additional conditions involving the system Hamiltonian and/or the control objective. All known second-order traps occur at constant control fields, and we also show that they only affect searches that originate very close to them. As a result, even when such traps exist on the control landscape, they are unlikely to affect well-designed gradient optimizations under realistic searching conditions.
The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources required, particularly for systems with large Hilbert spaces. Prior work on unitary transformation control indicates that (i) for controllable systems, local extrema in the search landscape for optimal control of quantum gates have null measure, facilitating the convergence of local search algorithms, but (ii) the required time for convergence to optimal controls can scale exponentially with the Hilbert space dimension. Depending on the control-system Hamiltonian, the landscape structure and scaling may vary. This work introduces methods for quantifying Hamiltonian-dependent and kinematic effects on control optimization dynamics in order to classify quantum systems according to the search effort and control resources required to implement arbitrary unitary transformations.
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.