Can quantum computers fold proteins?
No. As of August 2026, quantum hardware has "folded" only toy lattice peptides of about 6–10 amino acids — puzzles a laptop solves exactly by enumeration — while classical deep learning (AlphaFold) already predicts real protein structures at scale. There is no known quantum speedup for protein structure prediction, and the classical baseline is one of the strongest in all of computing.
Yes — classically, with no quantum computer involved Protein structure prediction is the clearest case in this whole section of a problem being substantially solved by classical computing while quantum hardware was still folding toys. AlphaFold 2 (2021) cracked single-chain structure prediction; AlphaFold 3 (2024) extended it to biomolecular interactions. Any claim that quantum computers are needed to "solve protein folding" ignores that the practically useful version of the problem was solved without them.
Yes — for lattice toys of ~7–10 amino acids IBM researchers encoded a coarse lattice-folding model into qubits and found lowest-energy conformations with a variational algorithm. It is a legitimate algorithmic demonstration with polynomial qubit scaling — and it is emphatically not folding a protein: the model places amino acids on a lattice with simplified interactions, and instances this size are exactly solvable classically in seconds.
Yes — the annealing version, since 2012, at 6 amino acids The earliest hardware protein-folding demo mapped an HP lattice model onto a D-Wave annealer as an optimization problem. Historically interesting as a proof that biological toy problems can be encoded onto quantum hardware at all. The instance is brute-force enumerable, and fourteen years later the demonstrated problem sizes across all platforms have grown only marginally.
No established quantum speedup, even on paper Unlike factoring (Shor) or chemistry (phase estimation), protein folding has no quantum algorithm with a proven meaningful speedup. Careful resource analyses of the lattice-folding algorithms conclude the quantum approaches do not beat classical solvers at any analysed scale. And a quadratic Grover-type speedup on an NP-hard search is exactly the kind error-correction overheads are expected to cancel — see <a href="/reality/optimization">the optimization page</a>.
Hasn't AlphaFold already solved this?
For the version of the problem people usually mean — given an amino-acid sequence, predict the 3D structure — largely yes, and classically. AlphaFold learned the sequence-to-structure mapping from evolutionary data and known structures; it runs on GPUs and its predictions are accurate enough to be standard tools in structural biology.
What AlphaFold does not do is simulate the folding process — the physical pathway a chain takes, misfolding, aggregation, dynamics of disordered regions. Those remain genuinely hard. But they are hard for quantum computers too: nobody has a quantum algorithm with any demonstrated or proven edge on folding dynamics either. "Classically unsolved" does not mean "quantum solves it".
What have quantum computers actually folded?
Lattice toys. Every hardware demonstration to date uses the same recipe: simplify the protein to beads on a grid (the HP model or similar), score conformations by simplified contact energies, encode the choice of turns into qubits, and search for the minimum-energy conformation as an optimization problem — via annealing or a variational circuit.
The record sizes are roughly 6 amino acids on a D-Wave annealer (2012) and 7–10 amino acids in gate-based experiments (2021, IBM). Real proteins run from ~50 to thousands of residues, and the lattice model discards most of the actual physics. Every demonstrated instance can be solved exactly on a laptop by enumeration. These experiments are worthwhile as algorithm tests — as biology, they demonstrate nothing beyond classical reach.
You can inspect variational circuits of exactly this scale in the lab, and see what today's QPUs can execute.
Could quantum computers ever help with proteins?
Plausibly — but not by folding them. The credible niche is quantum chemistry on small, electronically hard pieces of the problem: metal-containing active sites, covalent inhibitor reactions, bond-level accuracy where classical force fields fail. That is the drug-chemistry story with the same requirements and caveats — fault-tolerant hardware first — covered in will quantum computers revolutionize drug discovery?.
For the folding question itself to change, someone would need a quantum algorithm with a super-quadratic advantage for conformational search or folding dynamics, plus error-corrected hardware to run it, plus evidence it beats not just brute force but AlphaFold-class learned predictors and modern molecular dynamics. None of the three exists today. Set your expectations there.
Classifications follow the QPU137 editorial policy: every applied label carries a date, source, scale, and hardware, or it does not render. Found an error? Report it.