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:2303.11266 · The Journal of Chemical Physics

Machine learning aided dimensionality reduction toward a resource efficient projective quantum eigensolver: Formal development and pilot applications

Sonaldeep Halder, Chayan Patra, Dibyendu Mondal, Rahul Maitra

Published Jun 22, 2023• 10 citations
arXivHTMLPDF

Abstract

In recent times, a variety of hybrid quantum-classical algorithms have been developed that aim to calculate the ground state energies of molecular systems on Noisy Intermediate-Scale Quantum (NISQ) devices. Albeit the utilization of shallow depth circuits in these algorithms, the optimization of ansatz parameters necessitates a substantial number of quantum measurements, leading to prolonged runtimes on the scantly available quantum hardware. Through our work, we lay the general foundation for an interdisciplinary approach that can be used to drastically reduce the dependency of these algorithms on quantum infrastructure. We showcase these pertinent concepts within the framework of the recently developed Projective Quantum Eigensolver (PQE) that involves iterative optimization of the nonlinearly coupled parameters through repeated residue measurements on quantum hardware. We demonstrate that one may perceive such a nonlinear optimization problem as a collective dynamic interplay of fast and slow relaxing modes. As such, the synergy among the parameters is exploited using an on-the-fly supervised machine learning protocol that dynamically casts the PQE optimization into a smaller subspace by reducing the effective degrees of freedom. We demonstrate analytically and numerically that our proposed methodology ensures a drastic reduction in the number of quantum measurements necessary for the parameter updates without compromising the characteristic accuracy. Furthermore, the machine learning model may be tuned to capture the noisy data of NISQ devices, and thus the predicted energy is shown to be resilient under a given noise model.

DOI
10.1063/5.0155009

Related papers

Projective quantum eigensolver via adiabatically decoupled subsystem evolution: A resource efficient approach to molecular energetics in noisy quantum computers

Chayan Patra, Sonaldeep Halder, Rahul Maitra

Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many-body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their applicability to large chemical systems. This work encompasses the development of a projective formalism that aims to compute ground-state energies of molecular systems accurately using noisy intermediate scale quantum (NISQ) hardware in a resource-efficient manner. Our approach is reliant upon the formulation of a bipartitely decoupled parameterized ansatz within the disentangled unitary coupled cluster framework based on the principles of nonlinear dynamics and synergetics. Such decoupling emulates total parameter optimization in a lower dimensional manifold, while a mutual synergistic relationship among the parameters is exploited to ensure characteristic accuracy via a non-iterative energy correction. Without any pre-circuit measurements, our method leads to a highly compact fixed-depth ansatz with shallower circuits and fewer expectation value evaluations. Through analytical and numerical demonstrations, we establish the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems. This approach enables rapid exploration of emerging chemical spaces by the efficient utilization of near-term quantum hardware resources.

arXiv:2403.08519•The Journal of Chemical Physics•Jun 5, 2024•8 citations

Development of zero-noise extrapolated projective quantum algorithm for accurate evaluation of molecular energetics in noisy quantum devices

Sonaldeep Halder, Chinmay Shrikhande, Rahul Maitra

The recently developed Projective Quantum Eigensolver (PQE) offers an elegant procedure to evaluate the ground state energies of molecular systems in quantum computers. However, the noise in available quantum hardware can result in significant errors in computed outcomes, limiting the realization of quantum advantage. Although PQE comes equipped with some degree of inherent noise resilience, any practical implementation with apposite accuracy would require additional routines to eliminate or mitigate the errors further. In this work, we propose a way to enhance the efficiency of PQE by developing an optimal framework for introducing Zero Noise Extrapolation (ZNE) in the nonlinear iterative procedure that outlines the PQE, leading to the formulation of ZNE-PQE. Moreover, we perform a detailed analysis of how various components involved in it affect the accuracy and efficiency of the reciprocated energy convergence trajectory. Additionally, we investigate the underlying mechanism that leads to the improvements observed in ZNE-PQE over conventional PQE by performing a comparative analysis of their residue norm landscape. This approach is expected to facilitate practical applications of quantum computing in fields related to molecular sciences, where it is essential to determine molecular energies accurately.

arXiv:2306.14560•The Journal of Chemical Physics•Sep 19, 2023•13 citations

Fast and noise-aware machine learning variational quantum eigensolver optimiser

Akib Karim, Shaobo Zhang, Muhammad Usman

Abstract The variational quantum eigensolver (VQE) is a hybrid quantum–classical algorithm for preparing ground states in the current era of noisy devices. The classical component of the algorithm requires a large number of measurements on intermediate parameter values that are typically discarded. However, intermediate steps across many calculations can contain valuable information about the relationship between the quantum circuit parameters, resultant measurements, and noise specific to the device. This information would be useful when analysing families of Hamiltonians such as for potential energy landscapes for molecular interaction with catalytic surfaces or confinement in metal–organic-frameworks. In this work, we use supervised machine learning on the intermediate parameter and measurement data to amortise prediction of optimal final parameters across families of Hamiltonians. Our technique optimises parameters leading to chemically accurate ground state energies much faster than conventional techniques. It requires significantly fewer iterations and simultaneously shows the ability to find noise-aware angles if trained on noisy devices even with noise drift. We demonstrate this technique on IBM quantum devices by predicting ground state energies of H 2 for one and two qubits; H 3 for three qubits; and HeH + for four qubits where it finds optimal angles using only modelled data for training. Our technique amortises classical optimisation across multiple VQE runs, resulting in significantly faster overall classical optimisation without additional quantum overhead compared to running VQE.

arXiv:2503.20210•Nano Futures•Aug 27, 2026•2 citations

Projective Quantum Eigensolver with Generalized Operators

Mondal, Dibyendu, Chayan Patra, Dipanjali Halder +1 more

Determination of molecular energetics and properties is one of the core challenges in the near-term quantum computing. To this end, hybrid quantum-classical algorithms are preferred for Noisy Intermediate Scale Quantum (NISQ) architectures. The Projective Quantum Eigensolver (PQE) is one such algorithms that optimizes the parameters of the chemistry-inspired unitary coupled cluster (UCC) ansatz using a conventional coupled cluster-like residual minimization. Such a strategy involves the projection of the Schrodinger equation on to linearly independent basis towards the parameter optimization, restricting the ansatz is solely defined in terms of the excitation operators. This warrants the inclusion of high-rank operators for strongly correlated systems, leading to increased utilization of quantum resources. In this manuscript, we develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework that can be efficiently implemented in a quantum computer with manageable quantum resources. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them on to an internally contracted lower dimensional manifold. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples (SDT) ansatz, while utilizing an order of magnitude fewer quantum gates. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.

arXiv:2410.16111•Oct 21, 2024•1 citation

Machine-Learning-Enhanced Optimization of Noise-Resilient Variational Quantum Eigensolvers

Luca Johannes Wagner, Kim A. Nicoli, Lena Funcke

Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications, including lattice field theory. However, the inherent noise of Noisy Intermediate-Scale Quantum (NISQ) devices poses a significant challenge for running VQEs as these algorithms are particularly susceptible to noise, e.g., measurement shot noise and hardware noise. In a recent work, it was proposed to enhance the classical optimization of VQEs with Gaussian Processes (GPs) and Bayesian Optimization, as these machine-learning techniques are well-suited for handling noisy data. In these proceedings, we provide additional insights into this new algorithm and present further numerical experiments. In particular, we examine the impact of hardware noise and error mitigation on the algorithm's performance. We validate the algorithm using classical simulations of quantum hardware, including hardware noise benchmarks, which have not been considered in previous works. Our numerical experiments demonstrate that GP-enhanced algorithms can outperform state-of-the-art baselines, laying the foundation for future research on deploying these techniques to real quantum hardware and lattice field theory setups.

arXiv:2501.17689•International Symposium on Lattice Field Theory (LATTICE)•Feb 21, 2025•4 citations

Quantum-Enhanced Optimization: A Hybrid Quantum–Classical Framework for Machine Learning

Ayush Kumar Gupta

Quantum computing has emerged as one of the most influential paradigms capable of transforming computational processes that struggle under classical limitations. In recent years, hybrid quantum–classical algorithms have gained significant attention for their ability to leverage the strengths of both architectures, especially within the Noisy Intermediate-Scale Quantum (NISQ) era. This research paper explores a quantum-enhanced optimization framework designed to improve machine learning model performance through parameterized quantum circuits (PQCs). The goal of this study is to provide a practical, scalable approach that can be integrated into existing machine learning workflows without requiring fully developed fault-tolerant quantum hardware. The proposed framework uses classical preprocessing to encode data into quantum states, followed by quantum transformations that explore richer feature spaces due to quantum superposition and entanglement. A classical optimizer then updates the quantum circuit parameters based on measurement results, forming an end-to-end feedback loop. This hybrid model aims to demonstrate improved optimization efficiency, reduction in loss-function plateaus, and better generalization for specific ML tasks involving small to medium-sized datasets. This paper provides a comprehensive investigation of methodology, literature background, and experimental reasoning with statistical analysis, along with conceptual diagrams illustrating system architecture and circuit layouts. The outcomes further strengthen the viability of hybrid quantum–classical computation as a promising direction for advanced machine learning systems.

International Journal Of Scientific Research In Engineering & Technology•Nov 22, 2025•0 citations
In recent times, a variety of hybrid quantum-classical algorithms have been developed that aim to calculate the ground state energies of molecular systems on Noisy Intermediate-Scale Quantum (NISQ) devices. Albeit the utilization of shallow depth circuits in these algorithms, the optimization of ansatz parameters necessitates a substantial number of quantum measurements, leading to prolonged runtimes on the scantly available quantum hardware. Through our work, we lay the general foundation for an interdisciplinary approach that can be used to drastically reduce the dependency of these algorithms on quantum infrastructure. We showcase these pertinent concepts within the framework of the recently developed Projective Quantum Eigensolver (PQE) that involves iterative optimization of the nonlinearly coupled parameters through repeated residue measurements on quantum hardware. We demonstrate that one may perceive such a nonlinear optimization problem as a collective dynamic interplay of fast and slow relaxing modes. As such, the synergy among the parameters is exploited using an on-the-fly supervised machine learning protocol that dynamically casts the PQE optimization into a smaller subspace by reducing the effective degrees of freedom. We demonstrate analytically and numerically that our proposed methodology ensures a drastic reduction in the number of quantum measurements necessary for the parameter updates without compromising the characteristic accuracy. Furthermore, the machine learning model may be tuned to capture the noisy data of NISQ devices, and thus the predicted energy is shown to be resilient under a given noise model.
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many-body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their applicability to large chemical systems. This work encompasses the development of a projective formalism that aims to compute ground-state energies of molecular systems accurately using noisy intermediate scale quantum (NISQ) hardware in a resource-efficient manner. Our approach is reliant upon the formulation of a bipartitely decoupled parameterized ansatz within the disentangled unitary coupled cluster framework based on the principles of nonlinear dynamics and synergetics. Such decoupling emulates total parameter optimization in a lower dimensional manifold, while a mutual synergistic relationship among the parameters is exploited to ensure characteristic accuracy via a non-iterative energy correction. Without any pre-circuit measurements, our method leads to a highly compact fixed-depth ansatz with shallower circuits and fewer expectation value evaluations. Through analytical and numerical demonstrations, we establish the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems. This approach enables rapid exploration of emerging chemical spaces by the efficient utilization of near-term quantum hardware resources.
The recently developed Projective Quantum Eigensolver (PQE) offers an elegant procedure to evaluate the ground state energies of molecular systems in quantum computers. However, the noise in available quantum hardware can result in significant errors in computed outcomes, limiting the realization of quantum advantage. Although PQE comes equipped with some degree of inherent noise resilience, any practical implementation with apposite accuracy would require additional routines to eliminate or mitigate the errors further. In this work, we propose a way to enhance the efficiency of PQE by developing an optimal framework for introducing Zero Noise Extrapolation (ZNE) in the nonlinear iterative procedure that outlines the PQE, leading to the formulation of ZNE-PQE. Moreover, we perform a detailed analysis of how various components involved in it affect the accuracy and efficiency of the reciprocated energy convergence trajectory. Additionally, we investigate the underlying mechanism that leads to the improvements observed in ZNE-PQE over conventional PQE by performing a comparative analysis of their residue norm landscape. This approach is expected to facilitate practical applications of quantum computing in fields related to molecular sciences, where it is essential to determine molecular energies accurately.
Abstract The variational quantum eigensolver (VQE) is a hybrid quantum–classical algorithm for preparing ground states in the current era of noisy devices. The classical component of the algorithm requires a large number of measurements on intermediate parameter values that are typically discarded. However, intermediate steps across many calculations can contain valuable information about the relationship between the quantum circuit parameters, resultant measurements, and noise specific to the device. This information would be useful when analysing families of Hamiltonians such as for potential energy landscapes for molecular interaction with catalytic surfaces or confinement in metal–organic-frameworks. In this work, we use supervised machine learning on the intermediate parameter and measurement data to amortise prediction of optimal final parameters across families of Hamiltonians. Our technique optimises parameters leading to chemically accurate ground state energies much faster than conventional techniques. It requires significantly fewer iterations and simultaneously shows the ability to find noise-aware angles if trained on noisy devices even with noise drift. We demonstrate this technique on IBM quantum devices by predicting ground state energies of H 2 for one and two qubits; H 3 for three qubits; and HeH + for four qubits where it finds optimal angles using only modelled data for training. Our technique amortises classical optimisation across multiple VQE runs, resulting in significantly faster overall classical optimisation without additional quantum overhead compared to running VQE.
Determination of molecular energetics and properties is one of the core challenges in the near-term quantum computing. To this end, hybrid quantum-classical algorithms are preferred for Noisy Intermediate Scale Quantum (NISQ) architectures. The Projective Quantum Eigensolver (PQE) is one such algorithms that optimizes the parameters of the chemistry-inspired unitary coupled cluster (UCC) ansatz using a conventional coupled cluster-like residual minimization. Such a strategy involves the projection of the Schrodinger equation on to linearly independent basis towards the parameter optimization, restricting the ansatz is solely defined in terms of the excitation operators. This warrants the inclusion of high-rank operators for strongly correlated systems, leading to increased utilization of quantum resources. In this manuscript, we develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework that can be efficiently implemented in a quantum computer with manageable quantum resources. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them on to an internally contracted lower dimensional manifold. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples (SDT) ansatz, while utilizing an order of magnitude fewer quantum gates. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.
Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications, including lattice field theory. However, the inherent noise of Noisy Intermediate-Scale Quantum (NISQ) devices poses a significant challenge for running VQEs as these algorithms are particularly susceptible to noise, e.g., measurement shot noise and hardware noise. In a recent work, it was proposed to enhance the classical optimization of VQEs with Gaussian Processes (GPs) and Bayesian Optimization, as these machine-learning techniques are well-suited for handling noisy data. In these proceedings, we provide additional insights into this new algorithm and present further numerical experiments. In particular, we examine the impact of hardware noise and error mitigation on the algorithm's performance. We validate the algorithm using classical simulations of quantum hardware, including hardware noise benchmarks, which have not been considered in previous works. Our numerical experiments demonstrate that GP-enhanced algorithms can outperform state-of-the-art baselines, laying the foundation for future research on deploying these techniques to real quantum hardware and lattice field theory setups.
Quantum computing has emerged as one of the most influential paradigms capable of transforming computational processes that struggle under classical limitations. In recent years, hybrid quantum–classical algorithms have gained significant attention for their ability to leverage the strengths of both architectures, especially within the Noisy Intermediate-Scale Quantum (NISQ) era. This research paper explores a quantum-enhanced optimization framework designed to improve machine learning model performance through parameterized quantum circuits (PQCs). The goal of this study is to provide a practical, scalable approach that can be integrated into existing machine learning workflows without requiring fully developed fault-tolerant quantum hardware. The proposed framework uses classical preprocessing to encode data into quantum states, followed by quantum transformations that explore richer feature spaces due to quantum superposition and entanglement. A classical optimizer then updates the quantum circuit parameters based on measurement results, forming an end-to-end feedback loop. This hybrid model aims to demonstrate improved optimization efficiency, reduction in loss-function plateaus, and better generalization for specific ML tasks involving small to medium-sized datasets. This paper provides a comprehensive investigation of methodology, literature background, and experimental reasoning with statistical analysis, along with conceptual diagrams illustrating system architecture and circuit layouts. The outcomes further strengthen the viability of hybrid quantum–classical computation as a promising direction for advanced machine learning systems.