arrow
返回

Efficient quantum algorithm for lattice protein folding

delete2024-12-27
delete0
PRE
AI
Y
Youle Wang *
DOI:10.1088/2058-9565/ada08edelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Predicting a protein's three-dimensional structure from its primary amino acid sequence constitutes the protein folding problem, a pivotal challenge within computational biology. This task has been identified as a fitting domain for applying quantum annealing, an algorithmic technique posited to be faster than its classical counterparts. Nevertheless, the utility of quantum annealing is intrinsically contingent upon the spectral gap associated with the Hamiltonian of lattice proteins. This critical dependence introduces a limitation to the efficacy of these techniques, particularly in the context of simulating the intricate folding processes of proteins. In this paper, we address lattice protein folding as a polynomial unconstrained binary optimization problem, devising a hybrid quantum-classical algorithm to determine the minimum energy conformation effectively. Our method is distinguished by its logarithmic scaling with the spectral gap, conferring a significant edge over the conventional quantum annealing algorithms. The present findings indicate that the folding of lattice proteins can be achieved with a resource consumption that is polynomial in the lattice protein length, provided an ansatz state that encodes the target conformation is utilized. We also provide a simple and scalable method for preparing such states and further explore the adaptation of our method for extension to off-lattice protein models. This work paves a new avenue for surmounting complex computational biology problems via the utilization of quantum computers.
Keyword:
quantum computing
protein folding
polynomial unconstrained binary optimization

期刊

Quantum Science and Technology 封面图
Quantum Science and Technology
IF:
5
论文数:
1.4K
被引数:
5.1K

机构

暂无机构信息
引用论文

引用论文

[8] Animal models for meningitis
err1994-01-01
err0
PREAI
errMartin G. Tauber; André Zwahlen
err分享
err收藏
What is the Computational Value of Finite-Range Tunneling?
err2016-08-01
err316
errOAAI
errDenchev, Vasil S.; Boixo, Sergio; Isakov, Sergei V.; Ding, Nan; Babbush, Ryan; Smelyanskiy, Vadim; Martinis, John; Neven, Hartmut
err分享
err收藏
Noise-induced barren plateaus in variational quantum algorithms
err2021-11-29
err201
errOAAI
errWang, Samson; Fontana, Enrico; Cerezo, M.; Sharma, Kunal; Sone, Akira; Cincio, Lukasz; Coles, Patrick J.
err分享
err收藏
The prospects of quantum computing in computational molecular biology量子计算在计算分子生物学中的应用前景
err2020-05-22
err122
errOAAI
errOuteiral, Carlos; Strahm, Martin; Shi, Jiye; Morris, Garrett M.; Benjamin, Simon C.; Deane, Charlotte M.
err分享
err收藏
Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
err分享
err收藏
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
err2014-07-23
err2.7K
errOAAI
errPeruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alan; O'Brien, Jeremy L.
err分享
err收藏
Peptide conformational sampling using the Quantum Approximate Optimization Algorithm
err2023-07-17
err8
errOAAI
errBoulebnane, Sami; Lucas, Xavier; Meyder, Agnes; Adaszewski, Stanislaw; Montanaro, Ashley
err分享
err收藏
学者 查看更多内容