Pith. sign in

REVIEW 5 cited by

Toward end-to-end quantum simulation for protein dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.03972 v2 pith:HFAGGNKV submitted 2024-11-06 quant-ph cs.NAmath.NA

classification quant-phcs.NAmath.NA
keywords proteinquantumalgorithmsdynamicsefficientend-to-endsimulationstates
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modeling and simulating the protein folding process overall remains a grand challenge in computational biology. We systematically investigate end-to-end quantum algorithms for simulating various protein dynamics with effects, such as mechanical forces or stochastic noises. A major focus is the read-in of system settings for simulation, for which we discuss (i) efficient quantum algorithms to prepare initial states--whether for ensemble or single-state simulations, in particular, the first efficient procedure for preparing Gaussian pseudo-random amplitude states, and (ii) the first efficient loading of the connectivity matrices of the protein structure. For the read-out stage, our algorithms estimate a range of classical observables, including energy, low-frequency vibrational modes, density of states, displacement correlations, and optimal control parameters. Between these stages, we simulate the dynamic evolution of the protein system, by using normal mode models--such as Gaussian network models (GNM) and all-atom normal mode models. In addition, we conduct classical numerical experiments focused on accurately estimating the density of states and applying optimal control to facilitate conformational changes. These experiments serve to validate our claims regarding potential quantum speedups. Overall, our study demonstrates that quantum simulation of protein dynamics represents a robust, end-to-end application for both early-stage and fully fault-tolerant quantum computing.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction

    quant-ph 2026-04 conditional novelty 8.0 of 10

    LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.

  2. Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks

    cs.NE 2026-04 accept novelty 7.0 of 10

    LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.

  3. Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations

    quant-ph 2025-08 conditional novelty 7.0 of 10

    For strictly dissipative linear ODEs, quantum solvers based on time-marching or LCHS achieve query complexity O(polylog(1/ε)) that is independent of the evolution time T.

  4. LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction

    quant-ph 2026-04 conditional novelty 6.0 of 10

    A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.

  5. Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks

    cs.NE 2026-04 unverdicted novelty 6.0 of 10

    Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.

Pith tools