Resource analysis of quantum algorithms for coarse-grained protein folding models
arXiv:2311.04186 · doi:10.1103/PhysRevResearch.6.033112
Abstract
Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science challenge. We analyze the resource requirements for simulating protein folding on a quantum computer, assessing this problem's feasibility in the current and near-future technological landscape. We calculate the minimum number of qubits, interactions, and two-qubit gates necessary to build a heuristic quantum algorithm with the specific information of a folding problem. Particularly, we focus on the resources needed to build quantum operations based on the Hamiltonian linked to the protein folding models for a given amino acid count. Such operations are a fundamental component of these quantum algorithms, guiding the evolution of the quantum state for efficient computations. Specifically, we study course-grained folding models on the lattice and the fixed backbone side-chain conformation model and assess their compatibility with the constraints of existing quantum hardware given different bit-encodings. We conclude that the number of qubits required falls within current technological capabilities. However, the limiting factor is the high number of interactions in the Hamiltonian, resulting in a quantum gate count unavailable today.
arXiv comment18 pages, 9 figures
References in corpus (29)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Array Programming with NumPy
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum computational advantage using photons
- Superconducting Qubits: Current State of Play
- Trapped-Ion Quantum Computing: Progress and Challenges
- Multi-particle entanglement of hot trapped ions
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Layered architecture for quantum computing
- Resource-Efficient Quantum Algorithm for Protein Folding
- Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Simulating open quantum systems: from many-body interactions to stabilizer pumping
- Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- QFold: Quantum Walks and Deep Learning to Solve Protein Folding
- Fast multi-qubit gates through simultaneous two-qubit gates
- Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
- Extensive characterization of a family of efficient three-qubit gates at the coherence limit
- Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
- Comparison of Cloud-Based Ion Trap and Superconducting Quantum Computer Architectures
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Applying Deep Reinforcement Learning to the HP Model for Protein Structure Prediction
- Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
- Entangling gates for trapped-ion quantum computation and quantum simulation