Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems

• URL: http://arxiv.org/abs/2509.20668v1
• Date: Thu, 25 Sep 2025 02:04:41 GMT
• Title: Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems
• Authors: Margot Lockwood, Nathan Wiebe, Connah Johnson, Johannes Mülmenstädt, Jaehun Chun, Gregory Schenter, Margaret S. Cheung, Xiangyu Li,
• Abstract summary: A key challenge lies in the "curse of dimensionality"<n>We introduce a quantum algorithmic framework designed to overcome these challenges.<n>This framework opens the door to simulations of biologically relevant subcellular processes.
• Score: 1.4090780535978131
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Computational modeling of cellular systems, where reactants are governed by biochemical equations and physical representations, requires extensive classical computing resources. These limitations significantly constrain the system size and spatiotemporal scales of simulations. A key challenge lies in the "curse of dimensionality", where the number of possible reaction terms grows exponentially with the number of species, and the computation of reaction rates involving many-body interactions becomes intractable in polynomial time on classical computers. In this work, we introduce a quantum algorithmic framework designed to overcome these challenges, leveraging the architecture of quantum computing to simultaneously compute reaction rates and track the spatiotemporal dynamical evolutions of subcellular systems. We generalize the reaction-diffusion equation (RDE) for multiscale systems with arbitrary species count, encompassing higher-order interactions. Our approach achieves two principal quantum advantages: (i) an exponential quantum speedup in reaction-rate computation, contingent on the efficient preparation of polynomially accurate ground states on a quantum computer, and (ii)) a quadratic scaling in spatial grid points and polynomial scaling in the number of species for solving nonlinear RDEs, contrasting sharply with classical methods that scale exponentially with the system's degrees of freedom. To our knowledge, this represents the first efficient quantum algorithm for solving multiscale reaction-diffusion systems. This framework opens the door to simulations of biologically relevant subcellular processes across previously inaccessible spatial and temporal scales, with profound implications for computational biology, soft matter physics, and biophysical modeling.

Related papers

• Direct probing of the simulation complexity of open quantum many-body dynamics [42.085941481155295]
  We study the role of dissipation in simulating open-system dynamics using both quantum and classical methods.<n>Our results show that dissipation affects correlation length and mixing time in distinct ways at intermediate and long timescales.
  arXiv  Detail & Related papers  (2025-08-27T15:14:36Z)
• Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps [0.0]
  We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement.<n>We introduce novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits.<n>We also present efficient quantum circuits and numerical simulations that confirm the predicted vector-norm scaling.
  arXiv  Detail & Related papers  (2025-08-21T16:14:05Z)
• On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality [3.3083504598202733]
  A quantum algorithm offers an exponential speedup over any classical algorithm in simulating classical dynamics with long-range interactions.<n>Many real-world classical systems, such as those arising from partial differential equations, exhibit only local interactions.<n>This work offers new insights into the complexity of classical dynamics governed by partial differential equations.
  arXiv  Detail & Related papers  (2025-05-15T16:06:22Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• 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)
• Ab-initio variational wave functions for the time-dependent many-electron Schrödinger equation [41.94295877935867]
  We introduce a variational approach for fermionic time-dependent wave functions, surpassing mean-field approximations. We use time-dependent Jastrow factors and backflow transformations, which are enhanced through neural networks parameterizations. The results showcase the ability of our variational approach to accurately capture the time evolution, providing insight into the quantum dynamics of interacting electronic systems.
  arXiv  Detail & Related papers  (2024-03-12T09:37:22Z)
• 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)
• Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials [0.0]
  We propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer. We show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work.
  arXiv  Detail & Related papers  (2022-03-28T11:16:33Z)
• Quantum computation of molecular response properties [12.66895275733527]
  We propose an algorithm for computing linear and nonlinear molecular response properties on quantum computers. On the other hand, we introduce a variational hybrid quantum-classical variant of the proposed algorithm, which is more practical for near-term quantum devices.
  arXiv  Detail & Related papers  (2020-01-10T12:49:20Z)

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.