Demonstration of a quantum-classical coprocessing protocol for simulating nuclear reactions
Francesco Turro, Trevor Chistolini, Akel Hashim, Young‐Seok Kim, William P. Livingston, John Mark Kreikebaum, Kyle Wendt, Jonathan L. DuBois, Francesco Pederiva, Sofia Quaglioni, David Santiago, Irfan A. Siddiqi
Quantum computers hold great promise for exact simulations of nuclear dynamical processes (e.g., scattering and reactions), which are paramount to the study of nuclear matter at the limit of stability and in the formation of chemical elements in stars. However, quantum simulations of the unitary (real) time dynamics of fermionic many-body systems require a currently prohibitive number of reliable and long-lived qubits. We propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor, while the evolution of the spin degrees of freedom is carried out on quantum hardware. We demonstrate this hybrid scheme with the simulation of two neutrons scattering at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed. After implementing error mitigation strategies to improve the accuracy of the algorithm in addition to a combination of circuit compression techniques and tomography as methods to elucidate the onset of decoherence, our results validate the principle of the proposed co-processing scheme. A generalization of this present scheme will open the way for (real-time) path integral simulations of nuclear scattering.
Quantum computers hold great promise for exact simulations of nuclear dynamical processes (e.g., scattering and reactions), which are paramount to the study of nuclear matter at the limit of stability and in the formation of chemical elements in stars. However, quantum simulations of the unitary (real) time dynamics of fermionic many-body systems require a currently prohibitive number of reliable and long-lived qubits. We propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor, while the evolution of the spin degrees of freedom is carried out on quantum hardware. We demonstrate this hybrid scheme with the simulation of two neutrons scattering at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed. After implementing error mitigation strategies to improve the accuracy of the algorithm in addition to a combination of circuit compression techniques and tomography as methods to elucidate the onset of decoherence, our results validate the principle of the proposed co-processing scheme. A generalization of this present scheme will open the way for (real-time) path integral simulations of nuclear scattering.
The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. On the other hand, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. In this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size, and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.
Accurate simulation of dynamic processes in molecules and reactions is among the most challenging problems in quantum chemistry. Quantum computers promise efficient chemical simulation, but the existing quantum algorithms require many logical qubits and gates, placing practical applications beyond existing technology. Here, we carry out the first quantum simulations of chemical dynamics by employing a more hardware-efficient encoding scheme that uses both qubits and bosonic degrees of freedom. Our trapped-ion device accurately simulates the dynamics of nonadiabatic chemical processes, which are among the most difficult problems in computational chemistry because they involve strong coupling between electronic and nuclear motions. We demonstrate the programmability and versatility of our approach by simulating the dynamics of three different molecules, as well as open-system dynamics in the condensed phase, all with the same quantum resources. Our approach requires orders of magnitude fewer resources than equivalent qubit-only quantum simulations, demonstrating the potential of using hybrid encoding schemes to accelerate quantum simulations of complex chemical processes, which could have applications in fields ranging from energy conversion and storage to biology and drug design.
Neutron-scattering characterization of materials allows for the study of entanglement and microscopic structure but is inefficient to simulate classically for comparison to theoretical models and predictions. However, quantum processors, notably analog quantum simulators, have the potential to offer an unprecedented, efficient method of Hamiltonian simulation by evolving a state in real time to compute phase transitions, dynamical properties, and entanglement witnesses. To elucidate the response of materials to neutron scattering, we present a method for simulating the spin dynamics in the transverse field Ising chain on QuEra's Aquila processor by calculating the dynamic structure factor (DSF) and propose a method for error mitigation. We provide numerical simulations and experimental results for the performance of the procedure on the hardware, up to a chain of length L=25. Additionally, the DSF result is used to compute the quantum Fisher information (QFI) density, where we confirm bipartite entanglement in the system experimentally.
Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials. Quantum simulations of chemistry and materials are challenging due to the complexity of correlated systems. A framework based on reconfigurable qubit architectures and digital–analogue simulations provides a hardware-efficient path forwards.
Simulating quantum many-body systems is essential for understanding complex phenomena in condensed matter, chemistry, and materials science. Quantum computing offers a way to overcome the limitations of classical methods by operating directly in exponentially large Hilbert spaces. In particular, classical methods often fail to capture the dynamics of strongly correlated systems, which makes quantum algorithms a promising alternative for exploring these challenging regimes. This thesis uses quantum dynamics simulations to probe the behaviour of many-body systems. We first introduce a spectroscopy-based protocol to extract excitation spectra from the time evolution of observables and analyse its performance on near-term quantum devices. We show that the protocol requires only short evolution times and is resilient to errors, facilitating its implementation on real hardware. Building on this, we simulate fermionic excitation spectra using current quantum devices, introducing resource optimisations - including an approximate free-fermion initial state, a unitary quench without ancillae, and reduced Trotter steps - that significantly lower circuit depth. These improvements enable simulations at system sizes competitive with the state of the art, yielding results that match classical benchmarks. While most studies focus on unitary dynamics of isolated systems, open quantum dynamics is increasingly relevant for describing non-equilibrium processes across biology, materials science, and quantum control. We extend our scope to systems coupled to an environment and governed by Lindbladian evolution. By studying simulation complexity through physically meaningful quantities - such as correlation length and mixing time - we explore whether open-system dynamics can be as tractable as their unitary counterparts. These findings provide insights into the computational complexity landscape of open-system simulation and highlight regimes where quantum methods offer a clear advantage.
We describe a method for obtaining the scattering matrix for nuclear or chemical reactions on a finite lattice. Aside from the preparation of the initial and final states as wave packets, the only other operation required is unitary time evolution, making this approach ideal for simulations on quantum hardware. The central quantity is a time-dependent overlap between incoming and outgoing wave packets whose Fourier transform corresponds to the scattering matrix at fixed energy, from which one can calculate elastic and inelastic cross sections for reactions involving two interacting clusters. Working in Cartesian coordinates enables an efficient encoding of the problem on quantum hardware via the first quantization mapping, with favorable qubit scaling for describing asymptotic scattering states. Within this framework, we describe a quantum algorithm for probing the scattering amplitude through different angles, including the forward direction, which provides access to the total cross section via the optical theorem. We demonstrate our methods through a series of numerical examples, for both elastic and inelastic processes, comparing against exact calculations. The techniques we describe can more readily be extended to a large number of constituent particles than other existing approaches, once fault-tolerant quantum hardware becomes available.