Exploring the use of quantum computing for facilitating spatially and temporally resolved models of a biological cell

• URL: http://arxiv.org/abs/2607.27571v1
• Date: Thu, 30 Jul 2026 01:24:19 GMT
• Title: Exploring the use of quantum computing for facilitating spatially and temporally resolved models of a biological cell
• Abstract summary: We present a complexity analysis comparing classical and quantum algorithms for representative biological problems.<n>We highlight algorithmic developments designed to leverage both near-term exploratory and fault-tolerant quantum architectures.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Whole-cell simulation, modeling all of a cell's functional systems over its life cycle, is an outstanding challenge in computational biology. Even the simplest living cell contains thousands of interacting proteins and metabolites (on the order of trillions of atoms) whose full functional dynamics spans roughly five orders of magnitude in space (nm to $μ$m) and nearly nineteen in time (fs to hours). Further, many of the governing physical and chemical properties remain incompletely characterized. Simulating such complex systems at fully atomistic resolution over a full cell cycle is computationally intractable on classical architectures, raising a central question: Can quantum computing offer a viable path to whole-cell simulations that integrate molecular- and systems-level complexity? This Perspective examines the potential of quantum computing across three hierarchical scales: atomistic-molecular modeling, metabolic and regulatory networks, and whole-cell spatial modeling. We present a complexity analysis comparing classical and quantum algorithms for representative biological problems, identifying regimes of substantial theoretical speedup under specified algorithmic assumptions. We highlight algorithmic developments designed to leverage both near-term exploratory and fault-tolerant quantum architectures, and discuss practical bottlenecks: data encoding overhead, system conditioning, measurement constraints, and hybrid quantum-HPC integration. Together, these results outline a roadmap for quantum-accelerated whole-cell modeling and the biological insights such multiscale frameworks may eventually enable.

Related papers

• Bridging Krylov Complexity and Universal Analog Quantum Simulator [11.570003197315259]
  We introduce generalized Krylov complexity, a concept originating from operator growth dynamics, as a direct diagnosis for this synthesis complexity.<n>By analyzing representative systems including Rydberg atom arrays, we demonstrate that the generalized Krylov complexity of a target operation serves as a strong predictor of the minimum time required for its realization.<n>Our results establish Krylov complexity as an intuitive and predictive tool for designing efficient control protocols in analog quantum simulators.
  arXiv  Detail & Related papers  (2026-05-08T12:39:43Z)
• Advancing Practical Quantum Embedding Simulations via Operator Commutativity Based State Preparation for Complex Chemical Systems [0.0]
  Hybrid quantum-classical algorithms implemented on quantum computers offer a promising route toward addressing this problem.<n>We propose a dynamic ansatz construction strategy based on operator commutativity and energy driven screening within density matrix embedding theory.<n>We demonstrate improved accuracy and significantly reduced quantum gate requirements compared with conventional ansatze.
  arXiv  Detail & Related papers  (2026-04-21T13:51:55Z)
• Exploring polymer classification with a hybrid single-photon quantum approach [45.88028371034407]
  We present a hybrid classical-quantum formalism that couples a classical deep neural network for polymer featurization with a single-photon-based quantum classifier.<n>This pipeline successfully classifies polymer species by their optical gap, with performance in line with CPU-based noisy simulations and a proof-of-principle run on Quandela's Ascella quantum processor.
  arXiv  Detail & Related papers  (2025-12-19T23:06:38Z)
• Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems [1.4090780535978131]
  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.
  arXiv  Detail & Related papers  (2025-09-25T02:04:41Z)
• A Quantum Platform for Multiomics Data [0.0]
  Quantum computing offers a new paradigm for addressing classically intractable problems.<n>We introduce a hybrid quantum-classical machine learning platform designed to bridge this gap.<n>We propose to demonstrate the platform's utility through quantum-enhanced classification of phenotypic states from molecular variables and prediction of temporal evolution in biological systems.
  arXiv  Detail & Related papers  (2025-06-17T00:33:06Z)
• 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)
• 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)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• A Scalable Approach to Quantum Simulation via Projection-based Embedding [0.0]
  We describe a new and chemically intuitive approach that permits a subdomain of the electronic structure of a molecule to be calculated accurately on a quantum device. We demonstrate that our method produces improved results for molecules that cannot be simulated fully on quantum computers but which can be resolved classically at a lower level of approximation.
  arXiv  Detail & Related papers  (2022-03-02T14:27:44Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.