Quantum Algorithms for Simulating Nuclear Effective Field Theories

• URL: http://arxiv.org/abs/2312.05344v1
• Date: Fri, 8 Dec 2023 20:09:28 GMT
• Title: Quantum Algorithms for Simulating Nuclear Effective Field Theories
• Authors: James D. Watson, Jacob Bringewatt, Alexander F. Shaw, Andrew M. Childs, Alexey V. Gorshkov, Zohreh Davoudi
• Abstract summary: We use state-of-the-art Hamiltonian-simulation methods to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds on the simulation algorithm.
• Score: 40.83664249192338
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources, we employ state-of-the-art Hamiltonian-simulation methods, and conduct a thorough algorithmic analysis, to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. In particular, within the framework of nuclear lattice EFT, we obtain simulation costs for the leading-order pionless and pionful EFTs. We consider both static pions represented by a one-pion-exchange potential between the nucleons, and dynamical pions represented by relativistic bosonic fields coupled to non-relativistic nucleons. We examine the resource costs for the tasks of time evolution and energy estimation for physically relevant scales. We account for model errors associated with truncating either long-range interactions in the one-pion-exchange EFT or the pionic Hilbert space in the dynamical-pion EFT, and for algorithmic errors associated with product-formula approximations and quantum phase estimation. Our results show that the pionless EFT is the least costly to simulate and the dynamical-pion theory is the costliest. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds on the simulation algorithm. By retaining the locality of nucleonic interactions when mapped to qubits, we achieve reduced circuit depth and substantial parallelization. We further develop new methods to bound the algorithmic error for classes of fermionic Hamiltonians that preserve the number of fermions, and demonstrate that reasonably tight Trotter error bounds can be achieved by explicitly computing nested commutators of Hamiltonian terms. This work highlights the importance of combining physics insights and algorithmic advancement in reducing quantum-simulation costs.

Related papers

• Analog Quantum Simulation of Coupled Electron-Nuclear Dynamics in Molecules [0.0]
  We present the first analog quantum simulation approach for molecular vibronic dynamics in a pre-BO framework. We show that our approach has exponential savings in resource and computational costs compared to the equivalent classical algorithms.
  arXiv  Detail & Related papers  (2024-09-06T17:42:34Z)
• Orbital-free density functional theory with first-quantized quantum subroutines [0.0]
  We propose a quantum-classical hybrid scheme for performing orbital-free density functional theory (OFDFT) using probabilistic imaginary-time evolution (PITE) PITE is applied to the part of OFDFT that searches the ground state of the Hamiltonian in each self-consistent field (SCF) iteration. It is shown that obtaining the ground state energy of Hamiltonian requires a circuit depth of $O(log N_mathrmg)$.
  arXiv  Detail & Related papers  (2024-07-23T05:34:11Z)
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing [0.0]
  We propose introducing an extended Hubbard Hamiltonian derived via the ab initio downfolding method. The ab initio extended Hubbard Hamiltonian may hold significant potential for quantum chemical calculations using quantum computers.
  arXiv  Detail & Related papers  (2024-04-02T04:13:09Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Hamiltonian truncation tensor networks for quantum field theories [42.2225785045544]
  We introduce a tensor network method for the classical simulation of continuous quantum field theories. The method is built on Hamiltonian truncation and tensor network techniques. One of the key developments is the exact construction of matrix product state representations of global projectors.
  arXiv  Detail & Related papers  (2023-12-19T19:00:02Z)
• 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)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Simulating collider physics on quantum computers using effective field theories [1.76179873429447]
  Field theories (EFTs) provide an efficient mechanism to separate the high energy dynamics from the dynamics at low energy. We show how quantum algorithms can be used to simulate the dynamics of the low energy EFT from first principles. Calculations are performed using simulations of a quantum computer as well as measurements using the IBMQ Manhattan machine.
  arXiv  Detail & Related papers  (2021-02-09T19:00:00Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

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.