Protein structure prediction and design on near-term quantum computers
Doktorsavhandling, 2025
quantum approximate optimization algorithm
protein design
variational quantum algorithms
protein structure prediction
hardware-efficient ansatz
quantum walk
protein folding
life science
near-term intermediate-scale quantum devices
Författare
Hanna Linn
Tillämpad kvantfysik doktorander
Resource analysis of quantum algorithms for coarse-grained protein folding models
Physical Review Research,;Vol. 6(2024)
Artikel i vetenskaplig tidskrift
Hanna Linn, Lucas Knuthson, Anders Irbäck, Sandipan Mohanty, Laura Garcia Alvarez, and Göran Johansson "Designing lattice proteins with variational quantum algorithms"
Hanna Linn, Rui-Hao Li, Alexander Holden, Abdullah Ash Saki, Frank DiFilippo, Tomas Radivoyevitch, Daniel Blankenberg, Laura Garcıa- Alvarez, and Göran Johansson "Efficient Quantum Protein Structure Prediction with Problem-Agnostic Ansatzes"
Rui-Hao Li, Hakan Doga, Bryan Raubenolt, Sarah Mostame, Nicholas DiSanto, Fabio Cumbo, Jayadev Joshi, Hanna Linn, Maeve Gaffney, Alexander Holden, Vinooth Kulkarni, Vipin Chaudhary, Kenneth M. Merz Jr, Abdullah Ash Saki, Tomas Radivoyevitch, Frank DiFilippo, Jun Qin, Omar Shehab, and Daniel Blankenberg "Quantum Algorithm for Protein Structure Prediction Using the FaceCentered Cubic Lattice"
Hanna Linn, Yu Zheng, and Anton Frisk Kockum "Detecting quantum speedup of random walks with machine learning"
Simulating the folding process is highly complex, so we often try to predict the final structure instead. Modern AI methods do this well, but some cases remain challenging—where quantum algorithms might help.
Why predict protein structure at all?
Why simulate folding at all? Proteins begin as amino acid chains and fold into low-energy 3D shapes that define their function. The number of possible folds is astronomically large—checking them all would take longer than the age of the universe! Simulating every atom is daunting, so we group atoms to reduce complexity, at the cost of detail.
Quantum mechanics, through wave-particle duality and entanglement, enables the development of quantum computers through qubits. In theory, quantum algorithms may one day surpass classical ones in terms of speed and efficiency. For now, quantum computers are small and noisy, so we use hybrid algorithms, where quantum and classical parts work together.
This thesis explores such approaches, highlighting trade-offs, and clarifying where quantum computing might truly make an impact—and where it still falls short.
Wallenberg Centre for Quantum Technology (WACQT)
Knut och Alice Wallenbergs Stiftelse (KAW 2017.0449, KAW2021.0009, KAW2022.0006), 2018-01-01 -- 2030-03-31.
Ämneskategorier (SSIF 2025)
Nanotekniska livsvetenskaper och medicin
Algoritmer
Annan fysik
Annan data- och informationsvetenskap
DOI
10.63959/chalmers.dt/5762
ISBN
978-91-8103-305-2
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 5762
Utgivare
Chalmers