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.10458

Shot and Architecture Adaptive Subspace Variational Quantum Eigensolver for Microwave Simulation

Zhixiu Han, Fanxu Meng, Weidong Li, Xutao Yu, Zaichen Zhang

quant-phSubmitted Dec 11, 2025• Announced Dec 12, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum computing offers a promising paradigm for electromagnetic eigenmode analysis, enabling compact representations of complex field interactions and potential exponential speedup over classical numerical solvers. Recent efforts have applied variational quantum eigensolver (VQE) based methods to compute waveguide modes, demonstrating the feasibility of simulating TE and TM field distributions on noisy intermediate-scale quantum (NISQ) hardware. However, these studies typically employ manually designed, fixed-depth parameterized quantum circuits and uniform measurement-shot strategies, resulting in excessive quantum resource consumption, limited circuit expressivity, and reduced robustness under realistic noise conditions. To address these limitations, we propose an architecture and shot adaptive subspace variational quantum eigensolver for efficient microwave waveguide eigenmode simulation on NISQ devices. The proposed framework integrates a reinforcement learning (RL) based circuit design strategy and an adaptive shot allocation mechanism to jointly reduce quantum resource overhead. Specifically, the RL agent autonomously explores the quantum circuit space to generate hardware-efficient parameterized quantum circuits, while the adaptive measurement scheme allocates sampling resources according to Hamiltonian term weights. Numerical experiments on three- and five-qubit systems demonstrate that the proposed framework achieves accurate estimation of TE and TM mode eigenvalues, with a minimum absolute error down to $10^{-8}$ and reconstructed field distributions under noiseless conditions in excellent agreement with classical electromagnetic solutions.

Related papers

Variational Quantum Shot-Based Simulations for Waveguide Modes

Emanuel Colella, Spencer Beloin, Luca Bastianelli +3 more

Current quantum computers (QCs) belong to the noisy intermediate-scale quantum (NISQ) class, characterized by noisy qubits, limited qubit capabilities, and limited circuit depth. These limitations have led to the development of hybrid quantum-classical algorithms that split the computational cost between classical and quantum hardware. Among the hybrid algorithms, the variational quantum eigensolver (VQE) is mentioned. The VQE is a variational quantum algorithm designed to estimate the eigenvalues and eigenvectors of a system on universal-gate quantum architectures. A canonical problem in electromagnetics is the computation of eigenmodes within waveguides. Following the finite difference method, the wave equation can be recast as an eigenvalue problem. This work exploits the quantum superposition and entanglement in quantum computing to solve the square waveguide mode problem. This algorithm is expected to demonstrate exponentially efficiency over classical computational techniques as the qubit count increases. The simulations were performed on IBM’s three-qubit quantum simulator, Qasm IBM Simulator. A shot-based simulation was performed considering computationally based measurements of the quantum hardware. The results of the probabilistic read-out, reported in terms of 2-D eigenmode field distributions, are close to ideal values with a few number of qubits, confirming the possibility to exploit the quantum advantage to formulate innovative eigensolvers.

IEEE Transactions on Microwave Theory and Techniques•Dec 19, 2023•15 citations

Estimation of Waveguide Eigenmodes Based on Subspace-Search Variational Quantum Algorithm

Zhuo‐Wei Miao, Fanxu Meng

The variational quantum eigensolver (VQE), a variational algorithm to approximate the ground state of the given Hamiltonian, is the leading candidate for receiving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. The eigenmode analysis within waveguides, a canonical problem in electromagnetics, can be reformulated as an eigenvalue problem adopting the finite difference method. Therefore, in this work, a subspace-search-based VQE is applied for the computation of the eigenmodes. The proposed algorithm has the promise to show exponential efficiency outperforming over the classical algorithms. Compared with the existing counterparts, our work makes the additional orthogonality constrain unnecessary in the cost function, meantime, avoids the costly inner product evaluation in the cost function, where a few number of ancillary qubits and deeper quantum circuits are indispensable. Comprehensive experimental results show that the proposed framework significantly provides more accurate eigenmode estimation with fewer iterations and shows more favorable resource efficiency.

IEEE Microwave and Wireless Technology Letters•Aug 27, 2024•1 citation

Artificial-intelligence-driven shot reduction in quantum measurement

Senwei Liang, Linghua Zhu, Xiaolin Liu +2 more

Variational Quantum Eigensolver (VQE) provides a powerful solution for approximating molecular ground state energies by combining quantum circuits and classical computers. However, estimating probabilistic outcomes on quantum hardware requires repeated measurements (shots), incurring significant costs as accuracy increases. Optimizing shot allocation is thus critical for improving the efficiency of VQE. Current strategies rely heavily on hand-crafted heuristics requiring extensive expert knowledge. This paper proposes a reinforcement learning (RL)-based approach that automatically learns shot assignment policies to minimize total measurement shots while achieving convergence to the minimum of the energy expectation in VQE. The RL agent assigns measurement shots across VQE optimization iterations based on the progress of the optimization. This approach reduces VQE's dependence on static heuristics and human expertise. When the RL-enabled VQE is applied to a small molecule, a shot reduction policy is learned. The policy demonstrates transferability across systems and compatibility with other wavefunction Ansätze. In addition to these specific findings, this work highlights the potential of RL for automatically discovering efficient and scalable quantum optimization strategies.

arXiv:2405.02493•Chemical Physics Reviews•Oct 29, 2024•10 citations

Quantum Circuit Architecture Optimization for Variational Quantum Eigensolver via Monto Carlo Tree Search

Fan‐Xu Meng, Ze‐Tong Li, Xutao Yu +1 more

The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•24 citations

Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver

Daisuke Tsukayama, Jun‐ichi Shirakashi, Tetsuo Shibuya +1 more

Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.

AIP Advances•Jan 1, 2025•8 citations

Adaptive V16: Cost-Aware Reinforcement Learning Control for Robust NISQ Variational Optimization

Kondamudi Sivaparvathi, Cheppali Prabhavathi

Variational quantum algorithms (VQAs) are promising for near-term noisy intermediate-scale quantum (NISQ) devices, but their performance is often limited by device noise, finite-shot uncertainty, and nonstationary behavior that destabilize optimization. This paper proposes a cost-aware closed-loop hybrid framework (Adaptive V16) that augments a standard VQA loop with an online decision policy to adapt measurement effort and mitigation actions during execution. At each iteration, the controller uses runtime signals such as objective progress and uncertainty to select an action comprising the shot budget, mitigation mode, and step-scaling factor, explicitly trading solution improvement against resource overhead under a fixed budget. Experimental evaluation on a representative molecular Hamiltonian optimization task shows that Adaptive V16 achieves a lower final energy than a static VQE baseline and reduces the absolute error from 0.1391 to 0.0657. The controller’s decision module also demonstrates strong predictive performance with 0.9700 accuracy, 0.9595 F1-score, and 0.9951 ROC–AUC, indicating reliable adaptive behavior across thresholds. These results suggest that policy-driven adaptation can improve robustness and budget efficiency for hybrid quantum–classical optimization in realistic NISQ settings.

International Conference on Knowledge Engineering and Communication Systems (ICKECS)•Apr 24, 2026•0 citations
Quantum computing offers a promising paradigm for electromagnetic eigenmode analysis, enabling compact representations of complex field interactions and potential exponential speedup over classical numerical solvers. Recent efforts have applied variational quantum eigensolver (VQE) based methods to compute waveguide modes, demonstrating the feasibility of simulating TE and TM field distributions on noisy intermediate-scale quantum (NISQ) hardware. However, these studies typically employ manually designed, fixed-depth parameterized quantum circuits and uniform measurement-shot strategies, resulting in excessive quantum resource consumption, limited circuit expressivity, and reduced robustness under realistic noise conditions. To address these limitations, we propose an architecture and shot adaptive subspace variational quantum eigensolver for efficient microwave waveguide eigenmode simulation on NISQ devices. The proposed framework integrates a reinforcement learning (RL) based circuit design strategy and an adaptive shot allocation mechanism to jointly reduce quantum resource overhead. Specifically, the RL agent autonomously explores the quantum circuit space to generate hardware-efficient parameterized quantum circuits, while the adaptive measurement scheme allocates sampling resources according to Hamiltonian term weights. Numerical experiments on three- and five-qubit systems demonstrate that the proposed framework achieves accurate estimation of TE and TM mode eigenvalues, with a minimum absolute error down to 10−810^{-8}10−8 and reconstructed field distributions under noiseless conditions in excellent agreement with classical electromagnetic solutions.
Current quantum computers (QCs) belong to the noisy intermediate-scale quantum (NISQ) class, characterized by noisy qubits, limited qubit capabilities, and limited circuit depth. These limitations have led to the development of hybrid quantum-classical algorithms that split the computational cost between classical and quantum hardware. Among the hybrid algorithms, the variational quantum eigensolver (VQE) is mentioned. The VQE is a variational quantum algorithm designed to estimate the eigenvalues and eigenvectors of a system on universal-gate quantum architectures. A canonical problem in electromagnetics is the computation of eigenmodes within waveguides. Following the finite difference method, the wave equation can be recast as an eigenvalue problem. This work exploits the quantum superposition and entanglement in quantum computing to solve the square waveguide mode problem. This algorithm is expected to demonstrate exponentially efficiency over classical computational techniques as the qubit count increases. The simulations were performed on IBM’s three-qubit quantum simulator, Qasm IBM Simulator. A shot-based simulation was performed considering computationally based measurements of the quantum hardware. The results of the probabilistic read-out, reported in terms of 2-D eigenmode field distributions, are close to ideal values with a few number of qubits, confirming the possibility to exploit the quantum advantage to formulate innovative eigensolvers.
The variational quantum eigensolver (VQE), a variational algorithm to approximate the ground state of the given Hamiltonian, is the leading candidate for receiving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. The eigenmode analysis within waveguides, a canonical problem in electromagnetics, can be reformulated as an eigenvalue problem adopting the finite difference method. Therefore, in this work, a subspace-search-based VQE is applied for the computation of the eigenmodes. The proposed algorithm has the promise to show exponential efficiency outperforming over the classical algorithms. Compared with the existing counterparts, our work makes the additional orthogonality constrain unnecessary in the cost function, meantime, avoids the costly inner product evaluation in the cost function, where a few number of ancillary qubits and deeper quantum circuits are indispensable. Comprehensive experimental results show that the proposed framework significantly provides more accurate eigenmode estimation with fewer iterations and shows more favorable resource efficiency.
Variational Quantum Eigensolver (VQE) provides a powerful solution for approximating molecular ground state energies by combining quantum circuits and classical computers. However, estimating probabilistic outcomes on quantum hardware requires repeated measurements (shots), incurring significant costs as accuracy increases. Optimizing shot allocation is thus critical for improving the efficiency of VQE. Current strategies rely heavily on hand-crafted heuristics requiring extensive expert knowledge. This paper proposes a reinforcement learning (RL)-based approach that automatically learns shot assignment policies to minimize total measurement shots while achieving convergence to the minimum of the energy expectation in VQE. The RL agent assigns measurement shots across VQE optimization iterations based on the progress of the optimization. This approach reduces VQE's dependence on static heuristics and human expertise. When the RL-enabled VQE is applied to a small molecule, a shot reduction policy is learned. The policy demonstrates transferability across systems and compatibility with other wavefunction Ansätze. In addition to these specific findings, this work highlights the potential of RL for automatically discovering efficient and scalable quantum optimization strategies.
The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.
Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.
Variational quantum algorithms (VQAs) are promising for near-term noisy intermediate-scale quantum (NISQ) devices, but their performance is often limited by device noise, finite-shot uncertainty, and nonstationary behavior that destabilize optimization. This paper proposes a cost-aware closed-loop hybrid framework (Adaptive V16) that augments a standard VQA loop with an online decision policy to adapt measurement effort and mitigation actions during execution. At each iteration, the controller uses runtime signals such as objective progress and uncertainty to select an action comprising the shot budget, mitigation mode, and step-scaling factor, explicitly trading solution improvement against resource overhead under a fixed budget. Experimental evaluation on a representative molecular Hamiltonian optimization task shows that Adaptive V16 achieves a lower final energy than a static VQE baseline and reduces the absolute error from 0.1391 to 0.0657. The controller’s decision module also demonstrates strong predictive performance with 0.9700 accuracy, 0.9595 F1-score, and 0.9951 ROC–AUC, indicating reliable adaptive behavior across thresholds. These results suggest that policy-driven adaptation can improve robustness and budget efficiency for hybrid quantum–classical optimization in realistic NISQ settings.