Quantum Walks for Chemical Reaction Networks

• URL: http://arxiv.org/abs/2509.07890v1
• Date: Tue, 09 Sep 2025 16:14:16 GMT
• Title: Quantum Walks for Chemical Reaction Networks
• Authors: Seenivasan Hariharan, Sebastian Zur, Sachin Kinge, Lucas Visscher, Kareljan Schoutens, Stacey Jeffery,
• Abstract summary: We lay the foundation for a quantum algorithmic framework to analyse fixed-structure chemical reaction networks.<n>We develop quantum algorithms that decide reachability of target species after perturbation.<n>Our approach offers new tools for analysing the structure and energetics of complex CRNs.
• Score: 0.061573828205377185
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We lay the foundation for a quantum algorithmic framework to analyse fixed-structure chemical reaction networks (CRNs) using quantum random walks (QRWs) via electrical circuit theory. We model perturbations to CRNs, such as, species injections that shift steady-state concentrations, while keeping the underlying species-reaction graph fixed. Under physically meaningful mass-action constraints, we develop quantum algorithms that (i) decide reachability of target species after perturbation, (ii) sample representative reachable species, (iii) approximate steady-state fluxes through reactions, and (iv) estimate total Gibbs free-energy consumption. Our approach offers new tools for analysing the structure and energetics of complex CRNs, and opens up the prospect of scalable quantum algorithms for chemical and biochemical reaction networks.

Related papers

• Adapting Quantum Machine Learning for Energy Dissociation of Bonds [6.247064060111601]
  We present a benchmark comparing quantum and classical machine learning models for bond energies prediction.<n>Top-performing quantum models (QCNN, QRF) match the predictive accuracy and robustness of classical ensembles and deep networks.
  arXiv  Detail & Related papers  (2025-10-08T01:32:26Z)
• Neural Network Assisted Fermionic Compression Encoding: A Lossy-QSCI Framework for Scalable Quantum Chemistry Simulations [11.823527250715971]
  Quantum computing promises to revolutionize many-body simulations for quantum chemistry, but its potential is constrained by limited qubits and noise in current devices.<n>We introduce the Lossy Quantum Selected Configuration Interaction (Lossy-QSCI) framework, which combines a lossy subspace Hamiltonian preparation with a generic QSCI selection process.<n>This framework integrates a chemistry-inspired lossy Random Linear pipeline with a neural network-assisted Fermionic Expectation Decoder (NN-FED)
  arXiv  Detail & Related papers  (2025-05-23T13:00:16Z)
• Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
  Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium. Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP. This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
  arXiv  Detail & Related papers  (2024-06-10T17:22:09Z)
• 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)
• 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)
• Quantum Eigenvector Continuation for Chemistry Applications [57.70351255180495]
  We show that a significant amount of (quantum) computational effort can be saved by making use of already calculated ground states. In all cases, we show that the PES can be captured using relatively few basis states.
  arXiv  Detail & Related papers  (2023-04-28T19:22:58Z)
• Simulation of chemical reaction dynamics based on quantum computing [1.9441762996158096]
  We develop the ab initio molecular dynamics based on quantum computing to simulate reaction dynamics. We use this approach to calculate Hessian matrix and evaluate resources. Our results suggest that it is reliable to characterize the molecular structure, property, and reactivity.
  arXiv  Detail & Related papers  (2023-03-15T12:49:10Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• A perspective on the current state-of-the-art of quantum computing for drug discovery applications [43.55994393060723]
  Quantum computing promises to shift the computational capabilities in many areas of chemical research by bringing into reach currently impossible calculations. We briefly summarize and compare the scaling properties of state-of-the-art quantum algorithms. We provide novel estimates of the quantum computational cost of simulating progressively larger embedding regions of a pharmaceutically relevant covalent protein-drug complex.
  arXiv  Detail & Related papers  (2022-06-01T15:05:04Z)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• Quantum algorithm for a chemical reaction path optimization by using a variational quantum algorithm and a reaction path generation [0.0]
  We propose a quantum algorithm for the chemical reaction path optimization to obtain $E_a$. In our algorithm, quantum circuits can be used not only for the energy evaluation by the variational quantum eigensolver (VQE) but also for chemical reaction path generation. The proposed algorithm was applied to $mathrmH + mathrmH rightarrow mathrmH + mathrmH$ reaction, and we confirmed that $E_a$ was obtained accurately in the case of both the VQE and the
  arXiv  Detail & Related papers  (2020-09-15T00:40: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.