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:2111.02982 · Physical review. D/Physical review. D.

Nuclear two point correlation functions on a quantum computer

Alessandro Baroni, Joseph Carlson, Rajan Gupta, Andy C. Y. Li, Gabriel Perdue, Alessandro Roggero

Published Apr 11, 2022• 31 citations
arXivHTMLPDF

Abstract

The calculation of dynamic response functions is expected to be an early application benefiting from rapidly developing quantum hardware resources. The ability to calculate real-time quantities of strongly correlated quantum systems is one of the most exciting applications that can easily reach beyond the capabilities of traditional classical hardware. Response functions of fermionic systems at moderate momenta and energies corresponding roughly to the Fermi energy of the system are a potential early application because the relevant operators are nearly local, and the energies can be resolved in moderately short real time, reducing the spatial resolution and gate depth required. This is particularly the case in quasielastic electron and neutrino scattering from nuclei, a topic of great interest in the nuclear and particle physics communities and directly related to experiments designed to probe neutrino properties. In this work we use current quantum hardware and error mitigation protocols to calculate response functions for a highly simplified nuclear model through calculations of a 2-point real time correlation function for a modified Fermi-Hubbard model in two dimensions with three distinguishable nucleons on four lattice sites.

DOI
10.1103/physrevd.105.074503

Related papers

Quantum computing for neutrino-nucleus scattering

Alessandro Roggero, Andy C. Y. Li, Joseph Carlson +2 more

Neutrino-nucleus cross section uncertainties are expected to be a dominant systematic in future accelerator neutrino experiments. The cross sections are determined by the linear response of the nucleus to the weak interactions of the neutrino, and are dominated by energy and distance scales of the order of the separation between nucleons in the nucleus. These response functions are potentially an important early physics application of quantum computers. Here we present an analysis of the resources required and their expected scaling for scattering cross section calculations. The current estimates of Trotter steps needed to achieve an energy resolution of 10 MeV and the number of CNOT gates for analyzing $^{40}\mathrm{Ar}$ highlights the need for significant improvements in algorithms. We also examine simple small-scale neutrino-nucleus models on modern quantum hardware. In this paper, we use variational methods to obtain the ground state of a three nucleon system (the triton) and then implement the relevant time evolution. To tame the errors in present-day NISQ devices, we explore the use of different error-mitigation techniques to increase the fidelity of the calculations.

arXiv:1911.06368•Physical review. D/Physical review. D.•Apr 27, 2020•94 citations

Solving reaction dynamics with quantum computing algorithms

R. Weiss, Alessandro Baroni, Joseph Carlson +1 more

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.

arXiv:2404.00202•Physical Review C•May 28, 2025•13 citations

Real-time Kadanoff-Baym approach to nuclear response functions

H S Köhler, N H Kwong

Linear density response functions are calculated for symmetric nuclear matter of normal density by time-evolving two-time Green's functions in real time. Of particular interest is the effect of correlations. The system is therefore initially time-evolved with a collision term calculated in a direct Born approximation until fully correlated. An external time-dependent potential is then applied. The ensuing density fluctuations are recorded to calculate the density response. This method was previously used by Kwong and Bonitz for studying plasma oscillations in a correlated electron gas. The energy-weighted sum-rule for the response function is guaranteed by using conserving self-energy insertions as the method then generates the full vertex-functions. These can alternatively be calculated by solving a Bethe -Salpeter equation as done in works by Bozek et al. The (first order) mean field is derived from a momentum-dependent (non-local) interaction while 2 nd order self-energies are calculated using a particle-hole two-body effective (or residual) interaction given by a gaussian local potential. We show results of calculations of the response function S(ɷ, q 0 ) for q 0 = 0.2, 0.4 and 0.8 fm -1 . Comparison is made with the nucleons being un-correlated i.e. with only the first order mean field included. We discuss the relation of our work with the Landau quasi-particle theory as applied to nuclear systems by Babu and Brown and followers.

arXiv:1311.4616•Journal of Physics Conference Series•Mar 1, 2016•0 citations

Recipe for local simulation of strongly correlated fermionic matter on quantum computers: The two-dimensional Fermi-Hubbard model

Arash Jafarizadeh, Frank Pollmann, Adam Gammon-Smith

The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of quantum computing technologies are built around qubits and discrete gate-based operations, the translation of the physical problem into this framework is a crucial step. This translation will often be device specific, and a suboptimal implementation will be punished by the exponential compounding of errors on real devices. The importance of an efficient mapping is already revealed for models of spinful fermions in two or three dimensions, which naturally arise when the relevant physics relates to electrons. Using the most direct and well-known mapping, the Jordan-Wigner transformation, leads to a nonlocal representation of local degrees of freedom, and necessities efficient decompositions of nonlocal unitary gates into a sequence of hardware accessible local gates. In this paper, we provide a step-by-step recipe for simulating the paradigmatic two-dimensional Fermi-Hubbard model on a quantum computer using only local operations. To provide the ingredients for such a recipe, we briefly review the plethora of different approaches that have emerged recently but focus on the Derby-Klassen compact fermion mapping to make our discussion concrete. We provide a detailed recipe for an end-to-end simulation including embedding on a physical device, preparing initial states such as ground states, simulation of unitary time evolution, and measurement of observables and spectral functions. We explicitly compute the resource requirements for simulating a global quantum quench and conclude by discussing the challenges and future directions for simulating strongly correlated fermionic matter on quantum computers.

arXiv:2408.14543•Physical Review Research•Oct 7, 2025•2 citations

Lipkin model on a quantum computer

Michael J. Cervia, A. B. Balantekin, S. N. Coppersmith +5 more

Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. We present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.

arXiv:2011.04097•Physical Review C•Aug 3, 2021•62 citations

Full Quantum Computing on Binding Energy of Light Nuclei

PENG Baining1,  CUI Ying1,  YAN Yuliang1,  GAO Zaochun1,  WEI Shijie2 ,  ZHANG Yingxun1, 3, 4

Accurate calculations of nuclear binding energies in theory is a long-standing problem in nuclear physics, as it provides critical insights the effective interactions and structures of atomic nuclei. Currently, there are severe limitations in theory due to the exponential growth of the Hilbert space with increasing nucleon number, i.e., curse of the dimension. There are some effort to mitigate this problem by using the state-of-art methods, such as the machine learning and quantum computing. Recent advances in quantum computing have opened new avenues for addressing these challenges, enabling the direct simulation of nuclear many-body systems on quantum hardware. In this work, a detailed study on the calculation of nuclear binding energies using the full quantum eigensolver (FQE) algorithm, implemented on a real quantum processor, i.e. Quafu, was presented. Two nuclear systems (2H and 6He) were investigated. The deuteron, as the simplest bound nucleus with just one proton and one neutron, serves as an ideal benchmark for testing quantum algorithms, FQE. 6He, a light, two-valence neutron nucleus, was used for estimating the ability of the Quafu quantum cloud platform and its “Baihua” quantum chip. Our results demonstrate that for the deuteron, the FQE algorithm on the “Baihua” quantum processor achieves a higher level of accuracy compared to previously reported results obtained using the variational quantum eigensolver (VQE) on the IBM_QX5 and IBM_19Q platforms, as discussed in Dumitrescu’s article. For 6He, the FQE-calculated binding energy shows accuracy comparable to recent VQE-based calculations reported in Yoshida’s article. These findings highlight the feasibility of performing precise nuclear structure calculations on near-term quantum devices and underscore the potential of the FQE approach for future applications in nuclear physics. Overall, this study extends the scope of quantum computing in nuclear physics by demonstrating that the FQE algorithm can serve as a practical and accurate tool for computing binding energies on real quantum hardware. The results provide a benchmark for future developments in quantum simulations of nuclei and suggest promising directions for scaling these methods to larger nuclear systems, ultimately contributing to a deeper understanding of nuclear structure and dynamics.

•May 1, 2026•0 citations
The calculation of dynamic response functions is expected to be an early application benefiting from rapidly developing quantum hardware resources. The ability to calculate real-time quantities of strongly correlated quantum systems is one of the most exciting applications that can easily reach beyond the capabilities of traditional classical hardware. Response functions of fermionic systems at moderate momenta and energies corresponding roughly to the Fermi energy of the system are a potential early application because the relevant operators are nearly local, and the energies can be resolved in moderately short real time, reducing the spatial resolution and gate depth required. This is particularly the case in quasielastic electron and neutrino scattering from nuclei, a topic of great interest in the nuclear and particle physics communities and directly related to experiments designed to probe neutrino properties. In this work we use current quantum hardware and error mitigation protocols to calculate response functions for a highly simplified nuclear model through calculations of a 2-point real time correlation function for a modified Fermi-Hubbard model in two dimensions with three distinguishable nucleons on four lattice sites.
Neutrino-nucleus cross section uncertainties are expected to be a dominant systematic in future accelerator neutrino experiments. The cross sections are determined by the linear response of the nucleus to the weak interactions of the neutrino, and are dominated by energy and distance scales of the order of the separation between nucleons in the nucleus. These response functions are potentially an important early physics application of quantum computers. Here we present an analysis of the resources required and their expected scaling for scattering cross section calculations. The current estimates of Trotter steps needed to achieve an energy resolution of 10 MeV and the number of CNOT gates for analyzing 40Ar^{40}\mathrm{Ar}40Ar highlights the need for significant improvements in algorithms. We also examine simple small-scale neutrino-nucleus models on modern quantum hardware. In this paper, we use variational methods to obtain the ground state of a three nucleon system (the triton) and then implement the relevant time evolution. To tame the errors in present-day NISQ devices, we explore the use of different error-mitigation techniques to increase the fidelity of the calculations.
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.
Linear density response functions are calculated for symmetric nuclear matter of normal density by time-evolving two-time Green's functions in real time. Of particular interest is the effect of correlations. The system is therefore initially time-evolved with a collision term calculated in a direct Born approximation until fully correlated. An external time-dependent potential is then applied. The ensuing density fluctuations are recorded to calculate the density response. This method was previously used by Kwong and Bonitz for studying plasma oscillations in a correlated electron gas. The energy-weighted sum-rule for the response function is guaranteed by using conserving self-energy insertions as the method then generates the full vertex-functions. These can alternatively be calculated by solving a Bethe -Salpeter equation as done in works by Bozek et al. The (first order) mean field is derived from a momentum-dependent (non-local) interaction while 2 nd order self-energies are calculated using a particle-hole two-body effective (or residual) interaction given by a gaussian local potential. We show results of calculations of the response function S(ɷ, q 0 ) for q 0 = 0.2, 0.4 and 0.8 fm -1 . Comparison is made with the nucleons being un-correlated i.e. with only the first order mean field included. We discuss the relation of our work with the Landau quasi-particle theory as applied to nuclear systems by Babu and Brown and followers.
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of quantum computing technologies are built around qubits and discrete gate-based operations, the translation of the physical problem into this framework is a crucial step. This translation will often be device specific, and a suboptimal implementation will be punished by the exponential compounding of errors on real devices. The importance of an efficient mapping is already revealed for models of spinful fermions in two or three dimensions, which naturally arise when the relevant physics relates to electrons. Using the most direct and well-known mapping, the Jordan-Wigner transformation, leads to a nonlocal representation of local degrees of freedom, and necessities efficient decompositions of nonlocal unitary gates into a sequence of hardware accessible local gates. In this paper, we provide a step-by-step recipe for simulating the paradigmatic two-dimensional Fermi-Hubbard model on a quantum computer using only local operations. To provide the ingredients for such a recipe, we briefly review the plethora of different approaches that have emerged recently but focus on the Derby-Klassen compact fermion mapping to make our discussion concrete. We provide a detailed recipe for an end-to-end simulation including embedding on a physical device, preparing initial states such as ground states, simulation of unitary time evolution, and measurement of observables and spectral functions. We explicitly compute the resource requirements for simulating a global quantum quench and conclude by discussing the challenges and future directions for simulating strongly correlated fermionic matter on quantum computers.
Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. We present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.
Accurate calculations of nuclear binding energies in theory is a long-standing problem in nuclear physics, as it provides critical insights the effective interactions and structures of atomic nuclei. Currently, there are severe limitations in theory due to the exponential growth of the Hilbert space with increasing nucleon number, i.e., curse of the dimension. There are some effort to mitigate this problem by using the state-of-art methods, such as the machine learning and quantum computing. Recent advances in quantum computing have opened new avenues for addressing these challenges, enabling the direct simulation of nuclear many-body systems on quantum hardware. In this work, a detailed study on the calculation of nuclear binding energies using the full quantum eigensolver (FQE) algorithm, implemented on a real quantum processor, i.e. Quafu, was presented. Two nuclear systems (2H and 6He) were investigated. The deuteron, as the simplest bound nucleus with just one proton and one neutron, serves as an ideal benchmark for testing quantum algorithms, FQE. 6He, a light, two-valence neutron nucleus, was used for estimating the ability of the Quafu quantum cloud platform and its “Baihua” quantum chip. Our results demonstrate that for the deuteron, the FQE algorithm on the “Baihua” quantum processor achieves a higher level of accuracy compared to previously reported results obtained using the variational quantum eigensolver (VQE) on the IBM_QX5 and IBM_19Q platforms, as discussed in Dumitrescu’s article. For 6He, the FQE-calculated binding energy shows accuracy comparable to recent VQE-based calculations reported in Yoshida’s article. These findings highlight the feasibility of performing precise nuclear structure calculations on near-term quantum devices and underscore the potential of the FQE approach for future applications in nuclear physics. Overall, this study extends the scope of quantum computing in nuclear physics by demonstrating that the FQE algorithm can serve as a practical and accurate tool for computing binding energies on real quantum hardware. The results provide a benchmark for future developments in quantum simulations of nuclei and suggest promising directions for scaling these methods to larger nuclear systems, ultimately contributing to a deeper understanding of nuclear structure and dynamics.