Remember though, NP complete problems still are intractable (exponential complexity) even for quantum computers, to say nothing of NP hard. Unger and Moult (19

Remember though, NP complete problems still are intractable (exponential complexity) even for quantum computers, to say nothing of NP hard. Unger and Moult (1993) have shown a three-dimensional protein folding model to be NP-complete, and a two- and three-dimensional mathematical model describing the folding process as a free energy minimization problem is NP-hard: https://www.gwern.net/docs/1993-fraenkel.pdf https://www.gwern.net/docs/1993-fraenkel.pdf