A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer

• URL: http://arxiv.org/abs/2504.06348v1
• Date: Tue, 08 Apr 2025 18:00:11 GMT
• Title: A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer
• Authors: Felipe H. da Jornada, Matteo Lostaglio, Sam Pallister, Burak Şahinoğlu, Karthik I. Seetharam,
• Abstract summary: We present an end-to-end framework for simulating the real-time dynamics of chemical systems on a quantum computer.<n>A first-quantized plane-wave algorithm making use of pseudoions consolidates chemically inactive electrons and the nucleus into a single ionic entity.<n>We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between $\mathrm{NH_3}$ and $\mathrm{BF_3}$ (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately $10^{11}$ Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.

Related papers

• Toward end-to-end quantum simulation for protein dynamics [5.65693337062667]
  We systematically investigate end-to-end quantum algorithms for various protein dynamics with effects, such as mechanical forces or noises. For the read-in setting, we design (i) efficient quantum algorithms for initial state preparation, utilizing counter-based random number generator and rejection sampling. For the read-out setting, our algorithms estimate various classical observables, such as energy, low vibration modes, density of states, correlation of displacement, and optimal control of molecular dynamics.
  arXiv  Detail & Related papers  (2024-11-06T15:10:15Z)
• Quantum Embedding of Non-local Quantum Many-body Interactions in Prototypal Anti-tumor Vaccine Metalloprotein on Near Term Quantum Computing Hardware [4.8962578963959675]
  We present for the first time a quantum computer model simulation of a complex hemocyanin molecule. Hemocyanin is an important respiratory protein involved in various physiological processes. We conclude that the magnetic structure of hemocyanin is largely influenced by the many-body correction.
  arXiv  Detail & Related papers  (2024-10-16T16:49:42Z)
• Experimental Quantum Simulation of Chemical Dynamics [0.0]
  Existing digital quantum algorithms for chemical simulation require many logical qubits and gates. Here, we use an analog approach to carry out the first quantum simulations of chemical reactions.
  arXiv  Detail & Related papers  (2024-09-06T06:28:05Z)
• 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)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>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.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Pushing the Limits of Quantum Computing for Simulating PFAS Chemistry [0.3655818759482589]
  Solving the electronic Schrodinger equation is the core problem of computational chemistry. We propose an end-to-end quantum chemistry pipeline based on the variational quantum eigensolver (VQE) algorithm. Our platform orchestrates hundreds of simulation jobs on compute resources to efficiently complete ab initio chemistry experiments.
  arXiv  Detail & Related papers  (2023-11-02T13:58:02Z)
• 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)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Holographic dynamics simulations with a trapped ion quantum computer [0.0]
  We demonstrate and benchmark a new scalable quantum simulation paradigm. Using a Honeywell trapped ion quantum processor, we simulate the non-integrable dynamics of the self-dual kicked Ising model. Results suggest that quantum tensor network methods, together with state-of-the-art quantum processor capabilities, enable a viable path to practical quantum advantage in the near term.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Optimizing Electronic Structure Simulations on a Trapped-ion Quantum Computer using Problem Decomposition [41.760443413408915]
  We experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms without freezing any electrons. Our experimental results are an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware.
  arXiv  Detail & Related papers  (2021-02-14T01:47:52Z)
• 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)
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices [69.50862982117127]
  We benchmark the working conditions of the numerically analog simulator and find less demanding experimental setups. We also provide a deeper understanding of the errors of the simulation appearing due to discretization and finite size effects.
  arXiv  Detail & Related papers  (2020-11-28T11:23:06Z)
• Quantum HF/DFT-Embedding Algorithms for Electronic Structure Calculations: Scaling up to Complex Molecular Systems [0.0]
  We propose the embedding of quantum electronic structure calculation into a classically computed environment. We achieve this by constructing an effective Hamiltonian that incorporates a mean field describing the action of the inactive electrons on a selected Active Space.
  arXiv  Detail & Related papers  (2020-09-03T18:35:50Z)
• 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)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.