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:2509.20733 · neural information processing systems

PALQO: Physics-informed model for Accelerating Large-scale Quantum Optimization

Yiming Huang, Yajie Hao, Yuxuan Du, Jing Zhou, Xiao Yuan, Xiaoting Wang

Published Jan 1, 2025• 4 citations
arXivHTMLPDF

Abstract

Variational quantum algorithms (VQAs) are leading strategies to reach practical utilities of near-term quantum devices. However, the no-cloning theorem in quantum mechanics precludes standard backpropagation, leading to prohibitive quantum resource costs when applying VQAs to large-scale tasks. To address this challenge, we reformulate the training dynamics of VQAs as a nonlinear partial differential equation and propose a novel protocol that leverages physics-informed neural networks (PINNs) to model this dynamical system efficiently. Given a small amount of training trajectory data collected from quantum devices, our protocol predicts the parameter updates of VQAs over multiple iterations on the classical side, dramatically reducing quantum resource costs. Through systematic numerical experiments, we demonstrate that our method achieves up to a 30x speedup compared to conventional methods and reduces quantum resource costs by as much as 90\% for tasks involving up to 40 qubits, including ground state preparation of different quantum systems, while maintaining competitive accuracy. Our approach complements existing techniques aimed at improving the efficiency of VQAs and further strengthens their potential for practical applications.

DOI
10.52202/085713-1968

Related papers

Efficient Optimization of Variational Quantum Algorithms via Gradient-Free Parameter Prediction

Satwik Kundu, Debarshi Kundu, Swaroop Ghosh

The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.

arXiv:2307.12449•IEEE Access•Jan 1, 2026•2 citations

Parameter-parallel distributed variational quantum algorithm

Yun-Fei Niu, Shuo Zhang, Chen Ding +2 more

Variational quantum algorithms (VQAs) have emerged as a promising near-term technique to explore practical quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, the inefficient parameter training process due to the incompatibility with backpropagation and the cost of a large number of measurements, posing a great challenge to the large-scale development of VQAs. Here, we propose a parameter-parallel distributed variational quantum algorithm (PPD-VQA), to accelerate the training process by parameter-parallel training with multiple quantum processors. To maintain the high performance of PPD-VQA in the realistic noise scenarios, a alternate training strategy is proposed to alleviate the acceleration attenuation caused by noise differences among multiple quantum processors, which is an unavoidable common problem of distributed VQA. Besides, the gradient compression is also employed to overcome the potential communication bottlenecks. The achieved results suggest that the PPD-VQA could provide a practical solution for coordinating multiple quantum processors to handle large-scale real-word applications.

arXiv:2208.00450•SciPost Physics•May 26, 2023•10 citations

Neural-network-encoded variational quantum algorithms

Jiaqi Miao, Chang‐Yu Hsieh, Shi‐Xin Zhang

We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized $XXZ$ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.

arXiv:2308.01068•Physical Review Applied•Jan 26, 2024•30 citations

Accelerating Noisy Variational Quantum Algorithms with Physics-Informed Denoising Networks

Jie Liu, Xin Wang

Variational quantum algorithms are promising for near-term quantum computing, but are severely limited by hardware noise and the substantial circuit overhead required for error mitigation methods such as Zero-Noise Extrapolation (ZNE). We propose a Physics-Informed Denoising Network (PIDN) that reduces the cost of ZNE by learning a surrogate model of its optimization dynamics. By viewing the variational update as a trajectory in the parameter space, PIDN is trained to reproduce ZNE-mitigated expectation values and gradient directions while incorporating a physics-informed loss that preserves the gradient descent dynamics. Once trained, PIDN replaces repeated multi-noise evaluations with denoised expectation and gradient estimation directly from the current noisy observation and the historical trajectory, significantly reducing circuit executions. We benchmark the approach on the quantum approximate optimization algorithm for 3-regular graphs, Sherrington-Kirkpatrick, and transverse-field Ising models, as well as the variational quantum eigensolver for LiH, BeH$_2$ and H$_2$O. Across all tasks, PIDN attains performance comparable to ZNE, while reducing the number of circuit executions by a factor of approximately 4 to 6. Gradient cosine similarity with ZNE remains above 0.95 throughout training. Robustness analysis shows that PIDN fails only when ZNE itself becomes unreliable, and ablation studies confirm the necessity of the physics-informed loss for maintaining directional consistency. We further find that PIDN tracks optimization dynamics most accurately when the effective loss landscape retains strong low-frequency structure. These results establish PIDN as a scalable, resource-efficient strategy for noise-resilient variational optimization in the noisy intermediate-scale quantum regime.

quant-pharXiv:2605.02066•Physical Review Research•May 5, 2026•0 citations

Application and Performance Analysis of Physics-Informed Neural Networks in Solving Complex Physical Systems

Xuyang Chen

This study introduces a quantum-accelerated framework that integrates quantum optimization with physics-informed neural networks (PINNs) to solve PDEs more efficiently. By leveraging the Quantum Approximate Optimization Algorithm (QAOA), the proposed framework enhances the initialization and boundary parameter optimization of PINNs, addressing key challenges such as slow convergence and high computational cost. The hybrid approach combines the data efficiency and physical constraint embedding capabilities of PINNs with the computational advantages of quantum optimization, enabling faster and more accurate solutions for complex PDEs. The framework was validated using the Shuhao Cao PDE dataset, demonstrating significant improvements in training efficiency and accuracy compared to traditional numerical solvers and classical PINNs. Experimental results highlight that quantum optimization effectively accelerates convergence by optimizing initial conditions and boundary constraints, reducing the computational overhead associated with classical training processes. Despite its reliance on emerging quantum hardware and the sensitivity of PINNs to hyperparameter selection, this approach offers a scalable and robust solution for solving high-dimensional PDEs. The findings underscore the potential of hybrid quantum-classical methods in advancing scientific computing, providing a foundation for future research in stochastic PDEs, multi-physics problems, and other real-world applications.

IEEE International Conference on Electrical, Automation and Computer Engineering (ICEACE)•Dec 29, 2024•3 citations

Adaptive Quantum Physics-Informed Neural Networks for Differential Equations with Applications to Fluid Dynamics

Fabio Pereira dos Santos, Renato Portugal, Julio de Castro Vargas Fernandes +1 more

Physics-informed neural networks (PINNs) have emerged as a versatile approach for solving nonlinear partial differential equations (PDEs), yet achieving high accuracy efficiently using these techniques remains challenging for high-dimensional or multiscale systems. Here, we present a hybrid quantum-classical framework that enhances Quantum PINNs (QPINNs) through adaptive collocation point sampling and loss-aware attention mechanisms. By dynamically prioritizing points in regions with large PDE residuals or steep solution gradients, our method mitigates the spectral bias inherent in conventional PINNs. Current Quantum Physics-Informed Neural Networks are commonly assumed to be limited by the expressive power of quantum circuits. In our work, we observed that, across diverse differential equations, optimization - not only expressivity - can be an important bottleneck. Furthermore, a trainable loss-weighting scheme balances contributions from physics residuals, boundary conditions, and data fidelity during training. Integrating these strategies with quantum computing techniques (including variational quantum circuits and quantum gradient estimation) can yield at least a 60% improvement in solution accuracy under specific regimes for benchmark fluid flows and reaction-diffusion systems. Finally, we argue that merely increasing model expressivity is insufficient for resolving complex PDEs via QPINNs, as they remain constrained by the structural optimization limitations of classical PINNs. This framework provides a scalable pathway for quantum-enhanced scientific machine learning, bridging physics-based modeling with emerging quantum computational capabilities.

arXiv:2608.00850•Aug 1, 2026•1 citation
Variational quantum algorithms (VQAs) are leading strategies to reach practical utilities of near-term quantum devices. However, the no-cloning theorem in quantum mechanics precludes standard backpropagation, leading to prohibitive quantum resource costs when applying VQAs to large-scale tasks. To address this challenge, we reformulate the training dynamics of VQAs as a nonlinear partial differential equation and propose a novel protocol that leverages physics-informed neural networks (PINNs) to model this dynamical system efficiently. Given a small amount of training trajectory data collected from quantum devices, our protocol predicts the parameter updates of VQAs over multiple iterations on the classical side, dramatically reducing quantum resource costs. Through systematic numerical experiments, we demonstrate that our method achieves up to a 30x speedup compared to conventional methods and reduces quantum resource costs by as much as 90% for tasks involving up to 40 qubits, including ground state preparation of different quantum systems, while maintaining competitive accuracy. Our approach complements existing techniques aimed at improving the efficiency of VQAs and further strengthens their potential for practical applications.
The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.
Variational quantum algorithms (VQAs) have emerged as a promising near-term technique to explore practical quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, the inefficient parameter training process due to the incompatibility with backpropagation and the cost of a large number of measurements, posing a great challenge to the large-scale development of VQAs. Here, we propose a parameter-parallel distributed variational quantum algorithm (PPD-VQA), to accelerate the training process by parameter-parallel training with multiple quantum processors. To maintain the high performance of PPD-VQA in the realistic noise scenarios, a alternate training strategy is proposed to alleviate the acceleration attenuation caused by noise differences among multiple quantum processors, which is an unavoidable common problem of distributed VQA. Besides, the gradient compression is also employed to overcome the potential communication bottlenecks. The achieved results suggest that the PPD-VQA could provide a practical solution for coordinating multiple quantum processors to handle large-scale real-word applications.
We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized XXZXXZXXZ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.
Variational quantum algorithms are promising for near-term quantum computing, but are severely limited by hardware noise and the substantial circuit overhead required for error mitigation methods such as Zero-Noise Extrapolation (ZNE). We propose a Physics-Informed Denoising Network (PIDN) that reduces the cost of ZNE by learning a surrogate model of its optimization dynamics. By viewing the variational update as a trajectory in the parameter space, PIDN is trained to reproduce ZNE-mitigated expectation values and gradient directions while incorporating a physics-informed loss that preserves the gradient descent dynamics. Once trained, PIDN replaces repeated multi-noise evaluations with denoised expectation and gradient estimation directly from the current noisy observation and the historical trajectory, significantly reducing circuit executions. We benchmark the approach on the quantum approximate optimization algorithm for 3-regular graphs, Sherrington-Kirkpatrick, and transverse-field Ising models, as well as the variational quantum eigensolver for LiH, BeH2_22​ and H2_22​O. Across all tasks, PIDN attains performance comparable to ZNE, while reducing the number of circuit executions by a factor of approximately 4 to 6. Gradient cosine similarity with ZNE remains above 0.95 throughout training. Robustness analysis shows that PIDN fails only when ZNE itself becomes unreliable, and ablation studies confirm the necessity of the physics-informed loss for maintaining directional consistency. We further find that PIDN tracks optimization dynamics most accurately when the effective loss landscape retains strong low-frequency structure. These results establish PIDN as a scalable, resource-efficient strategy for noise-resilient variational optimization in the noisy intermediate-scale quantum regime.
This study introduces a quantum-accelerated framework that integrates quantum optimization with physics-informed neural networks (PINNs) to solve PDEs more efficiently. By leveraging the Quantum Approximate Optimization Algorithm (QAOA), the proposed framework enhances the initialization and boundary parameter optimization of PINNs, addressing key challenges such as slow convergence and high computational cost. The hybrid approach combines the data efficiency and physical constraint embedding capabilities of PINNs with the computational advantages of quantum optimization, enabling faster and more accurate solutions for complex PDEs. The framework was validated using the Shuhao Cao PDE dataset, demonstrating significant improvements in training efficiency and accuracy compared to traditional numerical solvers and classical PINNs. Experimental results highlight that quantum optimization effectively accelerates convergence by optimizing initial conditions and boundary constraints, reducing the computational overhead associated with classical training processes. Despite its reliance on emerging quantum hardware and the sensitivity of PINNs to hyperparameter selection, this approach offers a scalable and robust solution for solving high-dimensional PDEs. The findings underscore the potential of hybrid quantum-classical methods in advancing scientific computing, providing a foundation for future research in stochastic PDEs, multi-physics problems, and other real-world applications.
Physics-informed neural networks (PINNs) have emerged as a versatile approach for solving nonlinear partial differential equations (PDEs), yet achieving high accuracy efficiently using these techniques remains challenging for high-dimensional or multiscale systems. Here, we present a hybrid quantum-classical framework that enhances Quantum PINNs (QPINNs) through adaptive collocation point sampling and loss-aware attention mechanisms. By dynamically prioritizing points in regions with large PDE residuals or steep solution gradients, our method mitigates the spectral bias inherent in conventional PINNs. Current Quantum Physics-Informed Neural Networks are commonly assumed to be limited by the expressive power of quantum circuits. In our work, we observed that, across diverse differential equations, optimization - not only expressivity - can be an important bottleneck. Furthermore, a trainable loss-weighting scheme balances contributions from physics residuals, boundary conditions, and data fidelity during training. Integrating these strategies with quantum computing techniques (including variational quantum circuits and quantum gradient estimation) can yield at least a 60% improvement in solution accuracy under specific regimes for benchmark fluid flows and reaction-diffusion systems. Finally, we argue that merely increasing model expressivity is insufficient for resolving complex PDEs via QPINNs, as they remain constrained by the structural optimization limitations of classical PINNs. This framework provides a scalable pathway for quantum-enhanced scientific machine learning, bridging physics-based modeling with emerging quantum computational capabilities.