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

Optimal Control by Variational Quantum Algorithms

Tangyou Huang, J. J. Zhu, Zhongyi Ni

Published May 29, 2025• 1 citation
arXivHTMLPDF

Abstract

Hybrid quantum-classical algorithms hold great promise for solving quantum control problems on near-term quantum computers. In this work, we employ the hybrid framework that integrates digital quantum simulation with classical optimization to achieve optimal engineering of quantum many-body systems. To evaluate the overall performance of this method, we introduce a general metric termed control optimality, which accounts for constraints on both classical and quantum components. As a concrete example, we investigate the time-optimal control for perfect state transfer in a one-dimensional spin model using the variational quantum algorithm, closely approaching the quantum speed limit. Moreover, we discuss the emergent gradient behavior and error robustness, demonstrating the feasibility of applying hybrid quantum algorithms to solve quantum optimal control problems. These results establish a systematic framework for hybrid algorithms to address quantum control problems on near-term quantum platforms.

DOI
10.48550/arxiv.2505.23373

Related papers

Time-optimal control of driven oscillators by variational circuit learning

Tangyou Huang, Yongcheng Ding, Léonce Dupays +4 more

The simulation of quantum dynamics on a digital quantum computer with parametrized circuits has widespread applications in fundamental and applied physics and chemistry. In this context, using the hybrid quantum-classical algorithm, combining classical optimizers and quantum computers, is a competitive strategy for solving specific problems. We put forward its use for optimal quantum control. We simulate the wave-packet expansion of a trapped quantum particle on a quantum device with a finite number of qubits. We then use circuit learning based on gradient descent to work out the intrinsic connection between the control phase transition and the quantum speed limit imposed by unitary dynamics. We further discuss the robustness of our method against errors and demonstrate the absence of barren plateaus in the circuit. The combination of digital quantum simulation and hybrid circuit learning opens up new prospects for quantum optimal control.

arXiv:2211.00405•Physical Review Research•Jun 20, 2023•9 citations

Quantum optimal control with quantum computers: A hybrid algorithm featuring machine learning optimization

Davide Castaldo, Marta Rosa, Stefano Corni

We develop a hybrid quantum-classical algorithm to solve an optimal population transfer problem for a molecule subject to a laser pulse. The evolution of the molecular wave function under the laser pulse is simulated on a quantum computer, while the optimal pulse is iteratively shaped via a machine learning (evolutionary) algorithm. A method to encode on the quantum computer the $n$-electrons wave function is discussed, the circuits accomplishing its quantum simulation are derived and the scalability in terms of number of operations is discussed. Performance on noisy intermediate-scale quantum devices (IBM Q X2) is provided to assess the current technological gap. Furthermore the hybrid algorithm is tested on a quantum emulator to compare performance of the evolutionary algorithm with standard ones. Our results show that such algorithms are able to outperform the optimization with a downhill simplex method and provide performance comparable to more advanced (but quantum-computer unfriendly) algorithms such as Rabitz's or gradient-based optimization.

arXiv:2007.00368•Physical Review A•Feb 24, 2021•32 citations

Hybrid Quantum-Classical Computing: Benchmarking Algorithm Performance on Near-Term Quantum Processors for Optimization Problems

Alvira Nursahira, Reni Safitri, Muhammad Alvin +3 more

This paper presents a qualitative analysis of hybrid quantum-classical computing approaches aimed at solving complex optimization problems using near-term quantum processors. Hybrid algorithms leverage the strengths of quantum and classical computing to tackle computationally intensive tasks often constrained by current quantum hardware limitations. Through an extensive literature review and synthesis of recent empirical studies, we benchmark various hybrid algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), focusing on their performance, scalability, and practical applicability on noisy intermediate-scale quantum (NISQ) devices. The study highlights the advantages, challenges, and future prospects of integrating hybrid quantum-classical computation in optimization domains, providing a comprehensive framework and qualitative insights into benchmarking methodologies and critical performance metrics.

Jurnal Info Sains Informatika dan Sains•Aug 12, 2025•0 citations

Towards Quantum Control with Advanced Quantum Computing: A Perspective

Yongcheng Ding, Yue Ban, Xi Chen

We propose the combination of digital quantum simulation and variational quantum algorithms as an alternative approach to numerical methods for solving quantum control problems. As a hybrid quantum-classical framework, it provides an efficient simulation of quantum dynamics compared to classical algorithms, exploiting the previous achievements in digital quantum simulation. We analyze the trainability and the performance of such algorithms based on our preliminary works. We show that specific quantum control problems, e.g., finding the switching time for bang-bang control or the digital quantum annealing schedule, can already be studied in the noisy intermediate-scale quantum era. We foresee that these algorithms will contribute even more to quantum control of high precision if the hardware for experimental implementation is developed to the next level.

Entropy•Nov 29, 2022•5 citations

Numerical methods for variational quantum and quantum-inspired computing.

Jorge Abraham Gidi Chomalí

Quantum computation is a promising approach to solving problems in physics, optimization, and numerical simulation. Quantum algorithms leverage superposition and entanglement in an exponentially large Hilbert space to encode and solve problems that are intractable for classical computers. However, these algorithms require error-corrected quantum hardware, which is not yet available. This thesis explores two alternative quantum-based approaches that promise to achieve better scalability than traditional algorithms in the near-term: Hybrid variational quantum algorithms (VQAs) and fully classical, quantum-inspired algorithms. In the first part, we review and benchmark optimization methods well suited for VQAs, specifically the Simultaneous Perturbation Stochastic Approximation (SPSA). We introduce complex-variable extensions and improvements to the second-order and quantum natural implementations. Finally, we assess their performance across quantum control, quantum tomography, and the variational quantum eigensolver, providing practical guidelines for common VQA scenarios. In the second part, we apply Matrix Product States (MPS) to solve time-dependent partial differential equations (PDEs). By integrating Hermite Distributed Approximating Functionals (HDAF) into the MPS framework, we develop a novel encoding to efficiently approximate differential operators with exponential precision. We benchmark this approach against traditional schemes for simulating the expansion of a levitated nanoparticle. The quantum-inspired numerical integration schemes deliver large memory savings and adequate runtimes even in presence of moderate chirping.

•Jun 5, 2025•0 citations

Designing Algorithms for Quantum Computers of the Near Future

Abhinav Anand

Variational quantum algorithms (VQAs) have emerged as the leading strategy for using these noisy devices to achieve an advantage over their classical counterparts.VQAs use a hybrid quantum-classical framework, in which one employs the quantum computer to prepare a parameterized quantum state and outsource the optimization to a classical subroutine. VQAs have been proposed for applications in various fields, including physics, quantum chemistry, machine learning, and optimization. Nevertheless, many challenges must be addressed before we can use them for practical tasks. In this dissertation, we propose strategies to overcome some challenges in implementing VQAs. We first look at the issue of trainability for VQAs and propose three methods for optimizing them.The first method is based on natural evolutionary strategies (NES) and can alleviate the issue of vanishing gradients for randomly initialized parameterized quantum circuits (PQCs). The second method is based on the notion of information flow in PQCs and uses a mutual information-based distance metric to define paths for stochastic optimization of VQAs. Finally, we develop gradient evaluation procedures for optimizing objectives with the unitary coupled-cluster ansatz. Next, we study the issue of expressibility of PQCs used in variational algorithms.First, using the theory of quantum optimal control we define a notion of reachability of general ans\"atze used in VQAs. Next, using a variational autoencoder (VAE) coupled with a regression model, we try to gain a better understanding of the parameterization of PQCs. Finally, we attempt to remedy the inefficient usage of quantum resources for storing quantum data using evolutionary strategies to design quantum circuits for compressing quantum data. We present numerical evidence that the work presented here can increase trainability, efficiency, and understanding of VQAs.We believe our work is of interest to the quantum computing community as we continue to push the limits of NISQ devices for solving practical problems.

•Nov 1, 2022•0 citations
Hybrid quantum-classical algorithms hold great promise for solving quantum control problems on near-term quantum computers. In this work, we employ the hybrid framework that integrates digital quantum simulation with classical optimization to achieve optimal engineering of quantum many-body systems. To evaluate the overall performance of this method, we introduce a general metric termed control optimality, which accounts for constraints on both classical and quantum components. As a concrete example, we investigate the time-optimal control for perfect state transfer in a one-dimensional spin model using the variational quantum algorithm, closely approaching the quantum speed limit. Moreover, we discuss the emergent gradient behavior and error robustness, demonstrating the feasibility of applying hybrid quantum algorithms to solve quantum optimal control problems. These results establish a systematic framework for hybrid algorithms to address quantum control problems on near-term quantum platforms.
The simulation of quantum dynamics on a digital quantum computer with parametrized circuits has widespread applications in fundamental and applied physics and chemistry. In this context, using the hybrid quantum-classical algorithm, combining classical optimizers and quantum computers, is a competitive strategy for solving specific problems. We put forward its use for optimal quantum control. We simulate the wave-packet expansion of a trapped quantum particle on a quantum device with a finite number of qubits. We then use circuit learning based on gradient descent to work out the intrinsic connection between the control phase transition and the quantum speed limit imposed by unitary dynamics. We further discuss the robustness of our method against errors and demonstrate the absence of barren plateaus in the circuit. The combination of digital quantum simulation and hybrid circuit learning opens up new prospects for quantum optimal control.
We develop a hybrid quantum-classical algorithm to solve an optimal population transfer problem for a molecule subject to a laser pulse. The evolution of the molecular wave function under the laser pulse is simulated on a quantum computer, while the optimal pulse is iteratively shaped via a machine learning (evolutionary) algorithm. A method to encode on the quantum computer the nnn-electrons wave function is discussed, the circuits accomplishing its quantum simulation are derived and the scalability in terms of number of operations is discussed. Performance on noisy intermediate-scale quantum devices (IBM Q X2) is provided to assess the current technological gap. Furthermore the hybrid algorithm is tested on a quantum emulator to compare performance of the evolutionary algorithm with standard ones. Our results show that such algorithms are able to outperform the optimization with a downhill simplex method and provide performance comparable to more advanced (but quantum-computer unfriendly) algorithms such as Rabitz's or gradient-based optimization.
This paper presents a qualitative analysis of hybrid quantum-classical computing approaches aimed at solving complex optimization problems using near-term quantum processors. Hybrid algorithms leverage the strengths of quantum and classical computing to tackle computationally intensive tasks often constrained by current quantum hardware limitations. Through an extensive literature review and synthesis of recent empirical studies, we benchmark various hybrid algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), focusing on their performance, scalability, and practical applicability on noisy intermediate-scale quantum (NISQ) devices. The study highlights the advantages, challenges, and future prospects of integrating hybrid quantum-classical computation in optimization domains, providing a comprehensive framework and qualitative insights into benchmarking methodologies and critical performance metrics.
We propose the combination of digital quantum simulation and variational quantum algorithms as an alternative approach to numerical methods for solving quantum control problems. As a hybrid quantum-classical framework, it provides an efficient simulation of quantum dynamics compared to classical algorithms, exploiting the previous achievements in digital quantum simulation. We analyze the trainability and the performance of such algorithms based on our preliminary works. We show that specific quantum control problems, e.g., finding the switching time for bang-bang control or the digital quantum annealing schedule, can already be studied in the noisy intermediate-scale quantum era. We foresee that these algorithms will contribute even more to quantum control of high precision if the hardware for experimental implementation is developed to the next level.
Quantum computation is a promising approach to solving problems in physics, optimization, and numerical simulation. Quantum algorithms leverage superposition and entanglement in an exponentially large Hilbert space to encode and solve problems that are intractable for classical computers. However, these algorithms require error-corrected quantum hardware, which is not yet available. This thesis explores two alternative quantum-based approaches that promise to achieve better scalability than traditional algorithms in the near-term: Hybrid variational quantum algorithms (VQAs) and fully classical, quantum-inspired algorithms. In the first part, we review and benchmark optimization methods well suited for VQAs, specifically the Simultaneous Perturbation Stochastic Approximation (SPSA). We introduce complex-variable extensions and improvements to the second-order and quantum natural implementations. Finally, we assess their performance across quantum control, quantum tomography, and the variational quantum eigensolver, providing practical guidelines for common VQA scenarios. In the second part, we apply Matrix Product States (MPS) to solve time-dependent partial differential equations (PDEs). By integrating Hermite Distributed Approximating Functionals (HDAF) into the MPS framework, we develop a novel encoding to efficiently approximate differential operators with exponential precision. We benchmark this approach against traditional schemes for simulating the expansion of a levitated nanoparticle. The quantum-inspired numerical integration schemes deliver large memory savings and adequate runtimes even in presence of moderate chirping.
Variational quantum algorithms (VQAs) have emerged as the leading strategy for using these noisy devices to achieve an advantage over their classical counterparts.VQAs use a hybrid quantum-classical framework, in which one employs the quantum computer to prepare a parameterized quantum state and outsource the optimization to a classical subroutine. VQAs have been proposed for applications in various fields, including physics, quantum chemistry, machine learning, and optimization. Nevertheless, many challenges must be addressed before we can use them for practical tasks. In this dissertation, we propose strategies to overcome some challenges in implementing VQAs. We first look at the issue of trainability for VQAs and propose three methods for optimizing them.The first method is based on natural evolutionary strategies (NES) and can alleviate the issue of vanishing gradients for randomly initialized parameterized quantum circuits (PQCs). The second method is based on the notion of information flow in PQCs and uses a mutual information-based distance metric to define paths for stochastic optimization of VQAs. Finally, we develop gradient evaluation procedures for optimizing objectives with the unitary coupled-cluster ansatz. Next, we study the issue of expressibility of PQCs used in variational algorithms.First, using the theory of quantum optimal control we define a notion of reachability of general ans\"atze used in VQAs. Next, using a variational autoencoder (VAE) coupled with a regression model, we try to gain a better understanding of the parameterization of PQCs. Finally, we attempt to remedy the inefficient usage of quantum resources for storing quantum data using evolutionary strategies to design quantum circuits for compressing quantum data. We present numerical evidence that the work presented here can increase trainability, efficiency, and understanding of VQAs.We believe our work is of interest to the quantum computing community as we continue to push the limits of NISQ devices for solving practical problems.