Quantum simulation of actinide chemistry: towards scalable algorithms on trapped ion quantum computers
- URL: http://arxiv.org/abs/2510.25675v1
- Date: Wed, 29 Oct 2025 16:42:24 GMT
- Title: Quantum simulation of actinide chemistry: towards scalable algorithms on trapped ion quantum computers
- Authors: Kesha Sorathia, Cono Di Paola, Gabriel Greene-Diniz, Carlo A. Gaggioli, David Zsolt Manrique, Joe Gibbs, Sean Harding, Thomas M. Soini, Neil Gaspar, Robert Harker, Mark Storr, David Munoz Ramo,
- Abstract summary: This paper compares the method of quantum computed moments (QCM) with a single-ancilla version of quantum phase estimation (QPE)<n>We derive electronic structure descriptions from a series of representative chemical models and compute the energetics from quantum experiments on Quantinuum's H-series ion trap devices using up to 19 qubits.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Due to the wide range of technical applications of actinide elements, a thorough understanding of their electronic structure could complement technological improvements in many different areas. Quantum computing could greatly aid in this understanding, as it can potentially provide exponential speedups over classical approaches, thereby offering insights into the complex electronic structure of actinide compounds. As a first foray into quantum computational chemistry of actinides, this paper compares the method of quantum computed moments (QCM) as a noisy intermediate-scale quantum algorithm with a single-ancilla version of quantum phase estimation (QPE), a quantum algorithm expected to run on fault-tolerant quantum computers. We employ these algorithms to study the reaction energetics of plutonium oxides and hydrides. In order to enable quantum hardware experiments, we use several techniques to reduce resource requirements: screening individual Hamiltonian Pauli terms to reduce the measurement requirements of QCM and variational compilation to reduce the depth of QPE circuits. Finally, we derive electronic structure descriptions from a series of representative chemical models and compute the energetics from quantum experiments on Quantinuum's H-series ion trap devices using up to 19 qubits. We find our experiments to be in excellent agreement with results from classical electronic structure calculations and state vector simulations.
Related papers
- Exploring polymer classification with a hybrid single-photon quantum approach [45.88028371034407]
We present a hybrid classical-quantum formalism that couples a classical deep neural network for polymer featurization with a single-photon-based quantum classifier.<n>This pipeline successfully classifies polymer species by their optical gap, with performance in line with CPU-based noisy simulations and a proof-of-principle run on Quandela's Ascella quantum processor.
arXiv Detail & Related papers (2025-12-19T23:06:38Z) - Sequential Quantum Computing [41.94295877935867]
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple or heterogeneous quantum processors.<n>SQC overcomes the limitations of each type of quantum computer by combining their complementary strengths.<n>These results highlight SQC as a powerful and versatile approach for addressing complex quantum optimization problems.
arXiv Detail & Related papers (2025-06-25T17:51:29Z) - Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - Simulation of a Diels-Alder Reaction on a Quantum Computer [0.0]
This study explores the potential applications of quantum algorithms and hardware in investigating chemical reactions.
Our goal is to calculate the activation barrier of a reaction between ethylene and cyclopentadiene forming a transition state.
We conduct simulations on IBM quantum hardware using up to 8 qubits, and compute accurate activation barriers.
arXiv Detail & Related papers (2024-03-12T22:29:07Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Quantum computing enhanced computational catalysis [2.285928372124628]
We present an analysis of accurate energy measurements on a quantum computer for computational magnitude.
New quantum algorithms for double-factorized representations of the four-indexs can significantly reduce the computational cost.
We discuss the challenges of increasing active space sizes to accurately deal with dynamical correlations.
arXiv Detail & Related papers (2020-07-28T20:07:43Z) - Quantum computation of silicon electronic band structure [0.0]
We show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids.
In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time.
arXiv Detail & Related papers (2020-06-06T07:45:06Z) - Simulating quantum chemistry in the seniority-zero space on qubit-based
quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers.
We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.