News for hackers. Stuff that matters.
Re:Chad Rigetti on Building Quantum Computers [video] by adamgravitis on Friday September 30, 2016 @06:04PM (#12615540)
The main computationally intractable problems around drug discovery surround protein folding and identifying macromolecule shapes. This is necessary to infer receptor sites for potential drug targets.

The problem is massively intractable. QC could revolutionize the space.

Re:Chad Rigetti on Building Quantum Computers [video] by Hydraulix989 on Saturday October 01, 2016 @03:16AM (#12616860)
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