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:2507.05514 · Physical Review A

Electron-molecule scattering via R -matrix variational algorithms on a quantum computer

Dario Picozzi, Jonathan Tennyson, Vincent Graves, Jimena D. Gorfinkiel

Published Apr 28, 2026• 0 citations
arXivHTMLPDF

Abstract

Electron-molecule collisions play a central role in both natural processes and modern technological applications, particularly in plasma processing. Conventional computational strategies such as the R -matrix method have been widely adopted yet encounter significant scaling challenges in treating more complex systems. In this work we present a quantum computational approach that utilizes the variational quantum eigensolver (VQE) and variations thereof to overcome these limitations. We explore a number of methods, including the use of number projection operators and simultaneous optimization. We demonstrate the feasibility of our method on a model problem of electron scattering from the hydrogen molecule, with numerical results obtained using a noiseless classical simulator. We recover the full spectrum of the Hamiltonian within a chosen symmetry sector. Moreover, the optimal circuit parameters directly encode the R -matrix boundary amplitudes needed for subsequent scattering computations. We formulate the R -matrix inner-region problem for electron-molecule scattering in a variational quantum-computing framework.

DOI
10.1103/q8ry-hlxt

Related papers

Qubits, Symmetry and Geometry: Quantum Algorithms for Molecular Physics

Dario Picozzi

This work describes resource‑efficient quantum algorithms for molecular physics that exploit geometric structure and correspondences between physical and qubit symmetries. It begins with a review of classical approaches to the molecular electronic‑structure problem and of the variational quantum eigensolver in quantum computing. We then discuss the symmetry‑adapted encodings we introduced to reduce qubit requirements by eliminating redundant degrees of freedom arising from point‑group and other Boolean symmetries in the quantum simulation of molecular systems. Building on these encodings, we describe a qubit‑based symmetry‑adapted complete active‑space method that permits the simulation of larger molecular systems in a resource‑efficient manner on near‑term quantum devices. We present the QuantumSymmetry software package and illustrate its application to representative molecular systems. Next, we address electron‑molecule scattering by introducing a quantum computing algorithm to solve the inner‑region problem within the R‑matrix framework. In particular, we propose a novel simultaneous diagonalisation algorithm with subspace optimisation that requires only a limited number of Hamiltonian evaluations and could be generalised to a wide range of problems. The final chapter derives the explicit form of qubit operators for particle‑number projection. Altogether, these developments advance practical quantum simulations of complex molecular phenomena by leveraging symmetry and geometry in quantum‑algorithm design.

•Oct 28, 2025•0 citations

The Variational Quantum Eigensolver: A review of methods and best practices

Jules Tilly, Hongxiang Chen, Shuxiang Cao +8 more

The variational quantum eigensolver (or VQE), first developed by Peruzzo et al. (2014), has received significant attention from the research community in recent years. It uses the variational principle to compute the ground state energy of a Hamiltonian, a problem that is central to quantum chemistry and condensed matter physics. Conventional computing methods are constrained in their accuracy due to the computational limits facing exact modeling of the exponentially growing electronic wavefunction for these many-electron systems. The VQE may be used to model these complex wavefunctions in polynomial time, making it one of the most promising near-term applications for quantum computing. One important advantage is that variational algorithms have been shown to present some degree of resilience to the noise in the quantum hardware. Finding a path to navigate the relevant literature has rapidly become an overwhelming task, with many methods promising to improve different parts of the algorithm, but without clear descriptions of how the diverse parts fit together. The potential practical advantages of the algorithm are also widely discussed in the literature, but with varying conclusions. Despite strong theoretical underpinnings suggesting excellent scaling of individual VQE components, studies have pointed out that their various pre-factors could be too large to reach a quantum computing advantage over conventional methods. This review aims at disentangling the relevant literature to provide a comprehensive overview of the progress that has been made on the different parts of the algorithm, and to discuss future areas of research that are fundamental for the VQE to deliver on its promises. All the different components of the algorithm are reviewed in detail. These include the representation of Hamiltonians and wavefunctions on a quantum computer, the optimization process to find ground state energies, the post processing mitigation of quantum errors, and suggested best practices. We identify four main areas of future research: (1) optimal measurement schemes for reduction of circuit repetitions required; (2) large scale parallelization across many quantum computers; (3) ways to overcome the potential appearance of vanishing gradients in the optimization process for large systems, and how the number of iterations required for the optimization scales with system size; (4) the extent to which VQE suffers for quantum noise, and whether this noise can be mitigated in a tractable manner. The answers to these open research questions will determine the routes for the VQE to achieve quantum advantage as the quantum computing hardware scales up and as the noise levels are reduced.

arXiv:2111.05176•Physics Reports•Sep 23, 2022•1,312 citations

Ground-state energy of He atom using a four-qubit photonic processor with the variational quantum eigensolver

Badie Ghavami, Фороузан Мирмасоуди

Abstract To understand the properties and interactions of materials, and determining the ground state energies is one of the important challenges in quantum chemistry, materials science, and quantum mechanics, where quantum computing can play an important role for studying the properties of materials. In this study, we have explored the quantum processor application to compute the He molecule ground state energy which utilizes the Variational Quantum Eigensolver (VQE) algorithm. In here, we have implemented VQE on a state-of-the-art quantum processor, optimizing a parameterized quantum circuit to minimize the energy expectation value of the He molecule's Hamiltonian on the four qubits processor. The obtained results of this work show a significant improvement in accuracy compared to classical computational methods, such as Hartree-Fock and density functional theory, which demonstrate the compute potential of quantum algorithms in quantum many-body problems. Thus, these results demonstrate the advantages of quantum computing in achieving high accuracy in simulations of molecular and material properties, and pave the way for future applications in more complex systems. This work highlights the potential of quantum processors in the fields of quantum chemistry, computational physics, and data science.

arXiv:2504.07568•Quantum Information Processing•Oct 13, 2025•3 citations

Study of simple quantum systems using quantum computing algorithms

Juan Gómez Mazorra

In this work, the underlying theory of variational quantum algorithms applied to the study of simple quantum systems has been reviewed. Using the Qiskit library, the VQE (Variational Quantum Eigensolver) algorithm has been implemented to obtain the ground state energy of three simple quantum systems: the hydrogen molecule, an electron in a Yukawa potential, and two electrons in an infinite potential well with contact interaction. The algorithm parameters that yielded the best results were the UCCSD ansatz, the COBYLA optimizer, and a high number of shots. Although the results of simulations using quantum algorithms did not achieve the same precision as classical algorithms, especially under noise models, the implementation of the VQE algorithm has been successful in exploring the current capabilities and limitations of quantum computing. These results demonstrate the ability of quantum algorithms to solve simple quantum systems, despite current challenges. Furthermore, they underscore their potential to surpass classical algorithms in solving complex quantum systems.

•Jul 1, 2024•0 citations

Use VQE to calculate the ground energy of hydrogen molecules on IBM Quantum

Maomin Qing, Wei Xie

Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. We provide a theoretical framework of quantum mechanics, qubits, quantum gates, and the VQE algorithm. Our implementation process is described, and we simulate the results. Additionally, experiments are conducted on the IBM Quantum platform, and the results are analyzed. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy. However, limitations and challenges in scaling the algorithm for larger molecules are also identifi ed. This work contributes to the growing body of research on quantum computing and highlights the potential applications of VQE for real-world problem-solving.

arXiv:2305.06538•May 11, 2023•10 citations

VQE method: a short survey and recent developments

Dmitry A. Fedorov, Bo Peng, Niranjan Govind +1 more

Abstract The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such as quantum phase estimation (QPE) because fully quantum algorithms require quantum hardware that will not be accessible in the near future. VQE has been successfully applied to solve the electronic Schrödinger equation for a variety of small molecules. However, the scalability of this method is limited by two factors: the complexity of the quantum circuits and the complexity of the classical optimization problem. Both of these factors are affected by the choice of the variational ansatz used to represent the trial wave function. Hence, the construction of an efficient ansatz is an active area of research. Put another way, modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatzes for problems that map onto more than several qubits. In this review, we present recent developments in the field of designing efficient ansatzes that fall into two categories—chemistry–inspired and hardware–efficient—that produce quantum circuits that are easier to run on modern hardware. We discuss the shortfalls of ansatzes originally formulated for VQE simulations, how they are addressed in more sophisticated methods, and the potential ways for further improvements.

arXiv:2103.08505•Materials Theory•Jan 6, 2022•259 citations
Electron-molecule collisions play a central role in both natural processes and modern technological applications, particularly in plasma processing. Conventional computational strategies such as the R -matrix method have been widely adopted yet encounter significant scaling challenges in treating more complex systems. In this work we present a quantum computational approach that utilizes the variational quantum eigensolver (VQE) and variations thereof to overcome these limitations. We explore a number of methods, including the use of number projection operators and simultaneous optimization. We demonstrate the feasibility of our method on a model problem of electron scattering from the hydrogen molecule, with numerical results obtained using a noiseless classical simulator. We recover the full spectrum of the Hamiltonian within a chosen symmetry sector. Moreover, the optimal circuit parameters directly encode the R -matrix boundary amplitudes needed for subsequent scattering computations. We formulate the R -matrix inner-region problem for electron-molecule scattering in a variational quantum-computing framework.
This work describes resource‑efficient quantum algorithms for molecular physics that exploit geometric structure and correspondences between physical and qubit symmetries. It begins with a review of classical approaches to the molecular electronic‑structure problem and of the variational quantum eigensolver in quantum computing. We then discuss the symmetry‑adapted encodings we introduced to reduce qubit requirements by eliminating redundant degrees of freedom arising from point‑group and other Boolean symmetries in the quantum simulation of molecular systems. Building on these encodings, we describe a qubit‑based symmetry‑adapted complete active‑space method that permits the simulation of larger molecular systems in a resource‑efficient manner on near‑term quantum devices. We present the QuantumSymmetry software package and illustrate its application to representative molecular systems. Next, we address electron‑molecule scattering by introducing a quantum computing algorithm to solve the inner‑region problem within the R‑matrix framework. In particular, we propose a novel simultaneous diagonalisation algorithm with subspace optimisation that requires only a limited number of Hamiltonian evaluations and could be generalised to a wide range of problems. The final chapter derives the explicit form of qubit operators for particle‑number projection. Altogether, these developments advance practical quantum simulations of complex molecular phenomena by leveraging symmetry and geometry in quantum‑algorithm design.
The variational quantum eigensolver (or VQE), first developed by Peruzzo et al. (2014), has received significant attention from the research community in recent years. It uses the variational principle to compute the ground state energy of a Hamiltonian, a problem that is central to quantum chemistry and condensed matter physics. Conventional computing methods are constrained in their accuracy due to the computational limits facing exact modeling of the exponentially growing electronic wavefunction for these many-electron systems. The VQE may be used to model these complex wavefunctions in polynomial time, making it one of the most promising near-term applications for quantum computing. One important advantage is that variational algorithms have been shown to present some degree of resilience to the noise in the quantum hardware. Finding a path to navigate the relevant literature has rapidly become an overwhelming task, with many methods promising to improve different parts of the algorithm, but without clear descriptions of how the diverse parts fit together. The potential practical advantages of the algorithm are also widely discussed in the literature, but with varying conclusions. Despite strong theoretical underpinnings suggesting excellent scaling of individual VQE components, studies have pointed out that their various pre-factors could be too large to reach a quantum computing advantage over conventional methods. This review aims at disentangling the relevant literature to provide a comprehensive overview of the progress that has been made on the different parts of the algorithm, and to discuss future areas of research that are fundamental for the VQE to deliver on its promises. All the different components of the algorithm are reviewed in detail. These include the representation of Hamiltonians and wavefunctions on a quantum computer, the optimization process to find ground state energies, the post processing mitigation of quantum errors, and suggested best practices. We identify four main areas of future research: (1) optimal measurement schemes for reduction of circuit repetitions required; (2) large scale parallelization across many quantum computers; (3) ways to overcome the potential appearance of vanishing gradients in the optimization process for large systems, and how the number of iterations required for the optimization scales with system size; (4) the extent to which VQE suffers for quantum noise, and whether this noise can be mitigated in a tractable manner. The answers to these open research questions will determine the routes for the VQE to achieve quantum advantage as the quantum computing hardware scales up and as the noise levels are reduced.
Abstract To understand the properties and interactions of materials, and determining the ground state energies is one of the important challenges in quantum chemistry, materials science, and quantum mechanics, where quantum computing can play an important role for studying the properties of materials. In this study, we have explored the quantum processor application to compute the He molecule ground state energy which utilizes the Variational Quantum Eigensolver (VQE) algorithm. In here, we have implemented VQE on a state-of-the-art quantum processor, optimizing a parameterized quantum circuit to minimize the energy expectation value of the He molecule's Hamiltonian on the four qubits processor. The obtained results of this work show a significant improvement in accuracy compared to classical computational methods, such as Hartree-Fock and density functional theory, which demonstrate the compute potential of quantum algorithms in quantum many-body problems. Thus, these results demonstrate the advantages of quantum computing in achieving high accuracy in simulations of molecular and material properties, and pave the way for future applications in more complex systems. This work highlights the potential of quantum processors in the fields of quantum chemistry, computational physics, and data science.
In this work, the underlying theory of variational quantum algorithms applied to the study of simple quantum systems has been reviewed. Using the Qiskit library, the VQE (Variational Quantum Eigensolver) algorithm has been implemented to obtain the ground state energy of three simple quantum systems: the hydrogen molecule, an electron in a Yukawa potential, and two electrons in an infinite potential well with contact interaction. The algorithm parameters that yielded the best results were the UCCSD ansatz, the COBYLA optimizer, and a high number of shots. Although the results of simulations using quantum algorithms did not achieve the same precision as classical algorithms, especially under noise models, the implementation of the VQE algorithm has been successful in exploring the current capabilities and limitations of quantum computing. These results demonstrate the ability of quantum algorithms to solve simple quantum systems, despite current challenges. Furthermore, they underscore their potential to surpass classical algorithms in solving complex quantum systems.
Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. We provide a theoretical framework of quantum mechanics, qubits, quantum gates, and the VQE algorithm. Our implementation process is described, and we simulate the results. Additionally, experiments are conducted on the IBM Quantum platform, and the results are analyzed. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy. However, limitations and challenges in scaling the algorithm for larger molecules are also identifi ed. This work contributes to the growing body of research on quantum computing and highlights the potential applications of VQE for real-world problem-solving.
Abstract The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such as quantum phase estimation (QPE) because fully quantum algorithms require quantum hardware that will not be accessible in the near future. VQE has been successfully applied to solve the electronic Schrödinger equation for a variety of small molecules. However, the scalability of this method is limited by two factors: the complexity of the quantum circuits and the complexity of the classical optimization problem. Both of these factors are affected by the choice of the variational ansatz used to represent the trial wave function. Hence, the construction of an efficient ansatz is an active area of research. Put another way, modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatzes for problems that map onto more than several qubits. In this review, we present recent developments in the field of designing efficient ansatzes that fall into two categories—chemistry–inspired and hardware–efficient—that produce quantum circuits that are easier to run on modern hardware. We discuss the shortfalls of ansatzes originally formulated for VQE simulations, how they are addressed in more sophisticated methods, and the potential ways for further improvements.