Abstract
Abstract
Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of possibilities with the number of designable sites. The present work introduces circuits implementing a pure quantum approach, Grover’s algorithm, to solve protein design problems. Our algorithms can adjust to implement any custom pair-wise energy tables and protein structure models. Moreover, the algorithm's oracle is designed to consist of only adder functions. Quantum computer simulators validate the practicality of our circuits, containing up to 234 qubits. However, a smaller circuit is implemented on real quantum devices. Our results show that using \(\mathcal{O}\left(\sqrt{N}\right)\) iterations, the circuits find the correct results among all N possibilities, providing the expected quadratic speed up of Grover's algorithm over classical methods (i.e., \(\mathcal{O}\text{(}N\text{)}\)).
Publisher
Research Square Platform LLC
Reference40 articles.
1. Protein design is NP-hard;Pierce NA;Protein Eng,2002
2. Postscript about NP-hard problems;Knuth DE;ACM SIGACT News,1974
3. Nielsen, M. A. & Chuang, I. Quantum computation and quantum information. (Cambridge University Press, 2010).
4. A. Theory for the folding and stability of globular proteins;Dill K;Biochemistry,1985
5. The protein threading problem with sequence amino acid interaction preferences is NP-complete;Lathrop RH;Protein Engineering, Design and Selection,1994