Protein structure prediction and design on near-term quantum computers
Doctoral thesis, 2025

In the convergence of quantum computing and life science, we explore protein structure prediction and design on near-term intermediate-scale quantum devices. We investigate the algorithmic and resource constraints of today’s quantum computers, aiming to assess their potential in solving biologically relevant problems. We describe key variational quantum algorithms, including the problem-informed Quantum Approximate Optimization Algorithm and the problem-agnostic Hardware-Efficient Ansatz. Additionally, quantum walks are examined. The computationally complex coarse-grained lattice models in protein structure prediction and design are discussed. Quantum algorithms are then applied to these models to address the utility and limitations of today’s quantum computers. The thesis critically evaluates the limitations of quantum methods in comparison to classical approaches, highlighting the trade-offs between resource requirements in today’s quantum devices and the performance of quantum algorithms. Through this interdisciplinary investigation, the work contributes to understanding how quantum algorithms may advance computational biology in today’s quantum computing landscape.

variational quantum algorithms

quantum approximate optimization algorithm

hardware-efficient ansatz

protein design

quantum walk

life science

protein structure prediction

near-term intermediate-scale quantum devices

protein folding

Kollektorn, MC2
Opponent: Laxmi Parida, Forskare, IBM Research, USA

Author

Hanna Linn

Applied Quantum Physics PhD Students

Resource analysis of quantum algorithms for coarse-grained protein folding models

Physical Review Research,;Vol. 6(2024)

Journal article

DNA is transcribed into mRNA, which then forms a chain of amino acids. But what shape does this chain take when it folds into a functional protein? And how can we design one with a specific shape?
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 and Alice Wallenberg Foundation (KAW 2017.0449, KAW2021.0009, KAW2022.0006), 2018-01-01 -- 2030-03-31.

Subject Categories (SSIF 2025)

Nanotechnology for/in Life Science and Medicine

Algorithms

Other Physics Topics

Other Computer and Information Science

DOI

10.63959/chalmers.dt/5762

ISBN

978-91-8103-305-2

Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 5762

Publisher

Chalmers

Kollektorn, MC2

Online

Opponent: Laxmi Parida, Forskare, IBM Research, USA

More information

Latest update

10/15/2025