Quantum Approach to Fast Protein-Folding Time
arXiv:1906.09184 · doi:10.1088/0256-307X/36/8/080305
Abstract
In the traditional random-conformational-search model, various hypotheses with a series of meta-stable intermediate states were often proposed to resolve the Levinthal paradox. Here we introduce a quantum strategy to formulate protein folding as a quantum walk on a definite graph, which provides us a general framework without making hypotheses. Evaluating it by the mean of first passage time, we find that the folding time via our quantum approach is much shorter than the one obtained via classical random walks. This idea is expected to evoke more insights for future studies.
arXiv commentRevTex, 6 pages, 2 figures
References in corpus (9)
- Quantum Computation and Decision Trees
- Why Do Proteins Look Like Proteins?
- First-passage times in complex scale-invariant media
- Diffusive Dynamics of the Reaction Coordinate for Protein Folding Funnels
- Folding Kinetics of Protein Like Heteropolymers
- Mean first-passage times of non-Markovian random walkers in confinement
- Variational theory for site resolved protein folding free energy surfaces
- Medium effects on the selection of sequences folding into stable proteins in a simple model
- Random Walks on Complex Networks
Cited by in corpus (6)
- Quantum computational chemistry
- Polymer Physics by Quantum Computing
- Dominant Reaction Pathways by Quantum Computing
- Sampling Rare Conformational Transitions with a Quantum Computer
- Quantum Intelligence on Protein Folding Pathways
- Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems