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

This paper presents the first quantum computational formulation of the R-matrix inner-region problem for electron-molecule scattering, demonstrating the feasibility of using variational quantum algorithms to recover the full Hamiltonian spectrum and encode boundary amplitudes for the hydrogen molecule.

The Gist

The Big Picture: A Quantum Computer as a "Scattering Simulator"

Imagine you are trying to predict what happens when a tiny billiard ball (an electron) smashes into a complex, spinning top (a molecule). This isn't just a simple bounce; the electron might get stuck, bounce off, or knock pieces of the top off. Scientists call this electron-molecule scattering.

Doing this math on a normal computer is like trying to solve a giant, 3D jigsaw puzzle where the pieces keep changing shape. As the molecules get bigger, the puzzle becomes so huge that even the world's fastest supercomputers struggle to finish it.

This paper introduces a new way to solve this puzzle using a quantum computer. The authors have created a specific algorithm (a set of instructions) that uses the unique properties of quantum bits (qubits) to simulate these collisions more efficiently than traditional methods.

The Core Problem: The "Inner Room" vs. The "Outside World"

To understand their solution, you have to understand how scientists usually look at these collisions. They split the problem into two zones:

1. The Inner Room (The Inner Region): This is a small, crowded sphere right around the molecule. Here, the electron and the molecule's own electrons are all bumping into each other, swapping places, and getting tangled up. It's chaotic and complex.
2. The Outside World (The Outer Region): Once the electron gets far enough away, it's just flying through empty space. This part is easy to calculate.

The hard part is the Inner Room. In the past, scientists used a method called the R-matrix method to solve this. Think of the R-matrix as a "boundary report card." You don't need to know exactly what the electron is doing inside the room forever; you just need to know exactly how it behaves when it hits the doorway (the boundary) to the outside world.

The problem is that calculating this "doorway behavior" for complex molecules is incredibly expensive for normal computers.

The Solution: A Quantum "Dance Floor"

The authors built a quantum algorithm to solve the "Inner Room" problem. Here is how they did it, using analogies:

1. The "One-Seat" Rule (Number Projection)

In the chaotic Inner Room, there is a strict rule: Only one electron can be in the "continuum" (the doorway area) at a time. If two electrons try to squeeze through the door, the physics breaks.

• The Paper's Trick: They built a special "bouncer" into their quantum circuit. This bouncer (called a number projection operator) checks the quantum state and instantly kicks out any scenario where two electrons are trying to occupy the doorway. It ensures the simulation only ever looks at valid, physical situations.

2. The "Dance Floor" (The Variational Circuit)

To find the answer, the quantum computer needs to try out different ways the electrons can arrange themselves.

• The Analogy: Imagine a dance floor where dancers (electrons) can swap partners. The quantum computer uses a series of "rotations" (like a choreographer telling dancers to switch spots) to find the perfect dance formation that represents the lowest energy state.
• The Innovation: Instead of just finding the one best dance (the ground state), they needed to find many different dance formations (excited states) because scattering involves many possibilities.
• The "Sequential" Strategy: They used a clever technique called Sequential Subspace Optimisation (SSO). Imagine you are organizing a line of dancers by height. Instead of measuring everyone at once and getting confused, you fix the shortest dancer in place, then find the next shortest, and so on. This prevents the computer from getting lost in a "barren plateau" (a situation where the computer gets stuck and can't improve). This method finds all the necessary energy states one by one without needing complex extra math.

3. The "Magic Door" (Clebsch-Gordan Symmetry)

Electrons have a property called "spin" (like a tiny internal compass). When they collide, their spins must match up in specific ways.

• The Paper's Trick: They built a fixed "gear" into their circuit (a Clebsch-Gordan block) that automatically forces the electrons to spin correctly together. This is like a pre-set dance move that ensures the dancers never step on each other's toes. It saves a massive amount of computing power because the computer doesn't have to guess the spin rules; it just follows the gear.

The Results: What Did They Achieve?

The team tested their method on a simple molecule: Hydrogen (H₂).

• The Test: They ran the simulation on a "noiseless" classical simulator (a perfect computer that mimics a quantum machine without real-world errors).
• The Outcome: They successfully found all the energy states needed to describe the collision.
• The Bonus: The most important part is that the final settings of their quantum "dance floor" (the angles of the rotations) directly told them the "doorway report card" (the R-matrix boundary amplitudes).
  • Why this matters: Usually, you have to do extra work to get the final answer. Here, the answer is baked right into the solution. Once the quantum computer finishes dancing, you just read the angles, and you have the data needed to predict how the electron will scatter in the real world.

Summary

This paper is the first time anyone has successfully mapped the "Inner Room" of an electron-molecule collision onto a quantum computer.

They didn't just simulate the collision; they built a specialized quantum tool that:

1. Enforces the rule that only one electron can be in the "doorway."
2. Finds multiple energy states at once without getting stuck.
3. Automatically handles the complex "spin" rules of electrons.
4. Directly outputs the specific data scientists need to predict real-world collisions.

It's a proof-of-concept showing that quantum computers could one day solve the "impossible" math problems of plasma processing and chemical reactions that are too hard for today's supercomputers.

Technical Summary

Technical Summary: Electron–Molecule Scattering via R-matrix Variational Algorithms on a Quantum Computer

Problem Statement
Electron–molecule collisions are fundamental to natural processes and technologies such as plasma processing. While the R-matrix method is a standard computational strategy for these problems, it faces significant scaling challenges when applied to complex systems. The inner-region problem, which involves solving the many-electron Hamiltonian within a confined volume to capture electron correlation and exchange, scales poorly with the number of electrons and the size of the basis set. Conventional approaches often rely on approximate methods or become computationally prohibitive for high-accuracy solutions. Furthermore, standard quantum chemistry variational algorithms typically target the ground state, whereas R-matrix scattering requires the simultaneous determination of multiple eigenstates (including excited pseudostates and continuum-type states) within a specific symmetry sector to define the scattering boundary conditions.

Methodology
The authors propose a quantum computational framework that maps the R-matrix inner-region problem onto a qubit Hamiltonian using the Variational Quantum Eigensolver (VQE) and its variations. The approach involves several key components:

1. Hamiltonian Mapping and Constraints: The $(N+1)$-electron Hamiltonian for the inner region is mapped to qubits via the Jordan–Wigner transformation. A critical physical constraint is enforced: at most one electron may occupy any continuum orbital. This is achieved structurally within the variational ansatz using a number-projection operator formulation, ensuring the prepared state $|\psi(\theta)\rangle$ satisfies $P|\psi(\theta)\rangle = |\psi(\theta)\rangle$, where $P$ projects onto valid occupancy configurations.
2. Circuit Architecture: The algorithm utilizes a three-register system: a target register ($t$), a continuum register ($c$), and a selector register ($a$). The circuit prepares trial states that span a truncated basis of antisymmetrized channel functions and bound ($L^2$) configurations.
   • Spin Symmetry: The ansatz enforces total spin symmetry ($S, M$) using fixed Clebsch–Gordan (CG) rotations (implemented as two-qubit Givens rotations) to couple the target spin with the incoming electron spin.
   • Sequential Subspace Optimisation (SSO): To recover the full spectrum of eigenstates without the overhead of subspace diagonalization or penalty terms, the authors employ an SSO protocol. This involves decomposing an $SO(k)$ rotation into a cascade of two-qubit Givens rotations. The optimization proceeds sequentially: the lowest eigenstate is optimized first, and its parameters are fixed. Subsequent rounds optimize the next eigenstate within the orthogonal complement, effectively block-diagonalizing the Hamiltonian one state at a time. This allows the use of a simple Hamiltonian expectation value $\langle H \rangle$ as the cost function, avoiding the need for squared Hamiltonian terms ($H^2$) or overlap measurements.
3. Readout and Boundary Amplitudes: A coherent summation protocol is introduced to estimate expectation values on the system register by post-selecting the selector register, reducing the number of distinct expectation values required. Crucially, the optimal circuit parameters directly encode the expansion coefficients ($a_{ijk}$) of the wavefunction. These coefficients are used to calculate the R-matrix boundary amplitudes ($w_{ik}(a)$), which serve as the matching conditions for the outer region scattering calculation.

Key Contributions

• First Quantum Formulation of R-matrix Inner Region: To the authors' knowledge, this is the first application of quantum algorithms to electron–molecule scattering and the first formulation of the R-matrix inner-region problem on a quantum computer.
• Symmetry-Enforcing Circuit: The work introduces the first use of a Clebsch–Gordan symmetry-enforcing circuit within a variational scattering ansatz, utilizing fixed Givens blocks to maintain spin symmetry.
• Efficient Multi-State Optimization: The proposed SSO protocol differs from existing methods like SSVQE and MCVQE by enforcing orthogonality through circuit structure rather than penalty terms or overlap measurements. This eliminates the need for measuring off-diagonal Hamiltonian elements or performing classical subspace diagonalization, reducing the cost function to simple $\langle H \rangle$ evaluations.
• Direct Extraction of Scattering Data: The method demonstrates that optimal variational parameters directly yield the R-matrix boundary amplitudes, bypassing the need for additional post-processing to extract scattering observables.

Results
The algorithm was demonstrated on a model problem of electron scattering from the hydrogen molecule ($H_2$) using a noiseless classical simulator.

• System Setup: The simulation used a minimal basis (STO-3G) with $N=2$ target electrons, resulting in a trial space of dimension $k=5$ (four open-channel branches and one bound configuration) within the $S=1/2, M=-1/2, B_{1u}$ symmetry sector.
• Performance: The SSO approach successfully recovered the full spectrum of five eigenstates with energy errors within $10^{-7}$ Hartree.
• Resource Efficiency: The SSO method required only 573 cost function evaluations involving 92 Pauli terms. In contrast, a simultaneous optimization minimizing the sum of variances required 13,345 evaluations of 1,080 Pauli terms, and a single-state folded-Hamiltonian approach required 1,397 evaluations.
• Circuit Depth: The unoptimized circuit for this minimal example utilized 7 qubits, 217 CNOT gates, and a depth of 314.

Significance and Claims
The paper claims to provide a concrete route for applying quantum hardware to electron–molecule scattering, specifically addressing the inner-region bottleneck of the R-matrix method. The authors emphasize that their approach:

1. Avoids the storage of large Hamiltonian matrices by representing trial states on qubits.
2. Reduces measurement overhead by avoiding squared-Hamiltonian observables and utilizing sequential optimization.
3. Provides a "problem-native" output where circuit parameters map directly to physical scattering quantities (boundary amplitudes).

The authors modestly note that while they do not claim a proven asymptotic quantum advantage over the best classical iterative methods at present, the method offers a viable hybrid quantum-classical paradigm. They highlight that the approach is particularly promising as the trial-space dimension increases, where classical diagonalization scales as $O(k^3)$, while the quantum approach scales the parameter count and depth as $O(k^2)$. The work lays the groundwork for future extensions to larger targets and more sophisticated continuum representations, potentially integrating quantum processors into established scattering codes like UKRmol+.