Why Classical Computers Struggle With Molecules
Picture a computational chemist at her workstation on a Tuesday morning in 2025. She has just submitted a simulation job to her institution's high-performance computing cluster: a mid-sized drug candidate, roughly 50 atoms, interacting with a target protein binding site. The cluster queues the job. Three hours later, her phone buzzes with the estimated completion time: twenty-two days. She does not cancel it. She has done this before. She knows there is no faster option using the tools she has.
This is not an unusual story in pharmaceutical research. It is, in fact, the norm. Across laboratories at Pfizer, Bayer, Roche, and hundreds of smaller biotech firms, teams routinely submit simulation jobs that will not finish for days, weeks, or months. Some jobs are simply never run because the computational cost is judged too high to be practical. Molecules that might be worth investigating never get investigated. Drug candidates that could save lives never make it past the in-silico screening stage because the computers available to study them are not powerful enough to do so accurately and quickly.
The root cause is not a lack of engineering effort. Classical computing has advanced enormously since the 1970s, and the algorithms used to simulate molecular behavior have improved just as dramatically. The problem is deeper than that. It is mathematical. The way quantum mechanics works, the way electrons actually behave inside molecules, does not map cleanly onto the architecture of classical computers. As a result, every classical simulation of a quantum system is, at best, an approximation. And the cost of improving that approximation grows in ways that quickly become unmanageable.
Understanding why this is true, and what quantum computers offer as an alternative, requires a short detour into the physics that governs how atoms and electrons behave. The story of quantum computing in drug discovery begins not with hardware but with the fundamental difficulty of representing quantum systems on machines that were never designed to think in quantum terms.
The Exponential Scaling Wall
Every atom in a molecule has electrons. Those electrons do not simply orbit the nucleus in neat, fixed paths. They exist in quantum states: overlapping probability clouds that describe where the electron might be found and how much energy it is likely to carry. When two atoms bond, their electrons do not behave independently. They become correlated: the quantum state of one electron depends on the quantum state of every other electron in the system. This is the phenomenon known as electron correlation, and it is the central reason classical simulation of molecules is so computationally expensive.
To represent the full quantum state of a molecule with N electrons on a classical computer, you need a mathematical object with roughly 2 to the power of N entries. This is not a linear scaling problem. It is not even a polynomial one. It is exponential. A molecule with 20 electrons requires a state vector with approximately one million entries. A molecule with 50 electrons requires a state vector with more than one quadrillion entries. A molecule with 100 electrons, which is not a particularly large drug candidate by pharmaceutical standards, requires a state vector with more entries than there are atoms in the observable universe. No classical computer, no matter how large, can store or manipulate that object directly.
This is the exponential scaling wall. It is not a wall that better hardware can simply knock down. You cannot build enough RAM to store a state vector for a 200-electron system. You cannot design a processor fast enough to multiply a matrix with more rows than atoms in a galaxy in any reasonable timeframe. The wall is fundamental. It is a consequence of the mathematics of quantum mechanics, not a consequence of current engineering limitations.
Researchers have spent decades developing clever ways to work around this wall. The most widely used approach in pharmaceutical applications is Density Functional Theory, or DFT. Instead of tracking the full quantum state of every electron, DFT works with the electron density: a three-dimensional function that describes the probability of finding an electron at any point in space. This is a much more compact representation. It scales with the cube of the number of electrons in the system rather than exponentially, which makes it feasible to run on modern supercomputers for molecules of pharmaceutical interest.
What Approximation Costs You
DFT is a powerful tool. It has been used to predict molecular geometries, reaction energies, and electronic properties for decades, and it remains the workhorse of computational chemistry in both academic and industrial settings. The 1998 Nobel Prize in Chemistry was awarded in part to Walter Kohn for his foundational work on DFT. But DFT is also, at its core, an approximation. The theory replaces the intractable many-body quantum problem with a simpler problem involving only the electron density, but doing so requires making assumptions about how electrons interact with one another.
These assumptions are encoded in what is called the exchange-correlation functional, and choosing the right one is as much an art as a science. Different functionals give different results. For some problems, the differences are small enough to be negligible. For others, particularly problems involving transition metal atoms, van der Waals interactions, or strongly correlated electron systems, the differences can be large enough to lead to qualitatively wrong answers. A drug candidate that DFT predicts will bind strongly to a target protein may, in reality, bind weakly or not at all. The approximation fails precisely in the cases where drug designers most need accuracy.
More accurate methods exist. Coupled Cluster theory, often described by the acronym CCSD(T), is sometimes called the "gold standard" of quantum chemistry because it accounts for electron correlation far more completely than DFT. But CCSD(T) scales roughly as the seventh power of the number of electrons in the system. That means doubling the size of a molecule makes the calculation roughly 128 times more expensive. A system that takes one hour to simulate at 10 electrons would take more than a year at 20 electrons. For anything approaching a realistic drug molecule, CCSD(T) is simply out of reach on classical hardware.
The pharmaceutical industry has adapted to these constraints by building workflows that use DFT where they can and by accepting that some of the answers they get will be wrong. Experienced computational chemists develop intuitions about where DFT is likely to fail. They add safety margins. They run multiple functionals and compare results. They validate in-silico predictions against experimental data wherever possible. But all of this workaround infrastructure has a cost: it slows down the drug discovery process, adds uncertainty to every step, and means that some classes of molecules are simply too difficult to study computationally with any confidence.
What Quantum Computers Do Differently
A quantum computer is not a faster classical computer. That distinction matters enormously, and it is the source of much of the confusion surrounding quantum computing in popular coverage. Classical computers process information using bits: binary digits that are either 0 or 1. A quantum computer processes information using qubits, which can exist in superpositions of 0 and 1 simultaneously. This is not a metaphor or an approximation. It is a physical property of the quantum systems used to build qubits, whether those systems are superconducting circuits, trapped ions, photons, or any of the other physical platforms currently being developed.
The consequence of superposition is that a quantum computer with N qubits can, in principle, represent and manipulate all 2 to the N possible states of a system simultaneously. This is the same exponential relationship that makes classical simulation of quantum systems so hard, but now it is working in the quantum computer's favor rather than against it. Where a classical computer must store a state vector with 2 to the N entries to represent a quantum system, a quantum computer with N qubits naturally inhabits that 2 to the N dimensional space. The hardware is doing the same thing the physics does.
This is why Richard Feynman argued in his 1982 lecture that the best way to simulate nature is with a machine that operates according to quantum mechanical rules. It is a point that has taken decades to move from theoretical insight to practical engineering, but the direction of travel has been clear for a long time. Understanding the details of what quantum medicine means in practice requires grasping why this architectural difference is so consequential for biology and pharmacology specifically.
Superposition and the Search Problem
Drug discovery is fundamentally a search problem. You are looking for a molecule, usually one among an astronomically large space of possible molecules, that binds selectively to a biological target, is safe for human consumption, can be synthesized at reasonable cost, and satisfies dozens of other pharmacological criteria. The estimated size of drug-like chemical space is staggering: researchers estimate that there are somewhere between 10 to the 23rd and 10 to the 60th possible small molecules that could, in principle, be synthesized and tested as drug candidates. No experimental screening program can explore more than a tiny fraction of this space.
Classical computers address this search problem through a combination of physics-based simulation and machine learning models trained on experimental data. Both approaches have made enormous contributions to pharmaceutical research. But both share a common limitation: they must evaluate candidate molecules sequentially or in limited batches, and the accuracy of their predictions is constrained by the approximations described above. You can screen millions of compounds computationally, but if your model is systematically wrong about a class of binding interactions, you will miss the best candidates in that class.
Quantum algorithms like Grover's algorithm offer a different approach to search problems. By exploiting superposition to explore many candidate states simultaneously and then using interference to amplify the probability of finding good solutions, Grover's algorithm can search an unsorted database of N items in roughly the square root of N steps, compared to N/2 steps on average for a classical random search. For a database of one trillion candidates, this represents a reduction from roughly 500 billion steps to roughly one million steps. That is a meaningful speedup, even if it is not the exponential advantage that gets the most attention in discussions of quantum computing.
Entanglement and Correlated Electrons
For pharmaceutical simulation specifically, the most important quantum mechanical property may not be superposition but entanglement. Entanglement is the phenomenon by which two or more quantum systems become correlated in ways that cannot be described by any classical probability distribution. Measuring the state of one entangled particle instantly determines, in a statistical sense, something about the state of the others, regardless of the distance between them.
In a molecule, electrons are entangled with one another. The electron correlation that makes classical simulation so difficult is, at its root, a consequence of quantum entanglement. When a classical computer tries to simulate a strongly correlated electron system, it must somehow represent these entanglement relationships using classical probability distributions, and this is precisely where the exponential cost comes from. The correlations between electrons in a large molecule cannot be efficiently compressed into any classical representation without losing important information.
A quantum computer, by contrast, naturally represents entanglement. Its qubits can be placed in entangled states that directly mirror the entangled states of the electrons in the molecule being simulated. This is not an approximation. The hardware is implementing the same mathematical structure that the physics requires. As a result, quantum computers have the potential to simulate strongly correlated electron systems, including the active sites of metalloenzymes, the electronic structure of transition metal complexes in drug candidates, and the quantum mechanical details of how drugs interact with DNA, with an accuracy that is simply not achievable on classical hardware at any practical scale.
A Real Comparison: VQE vs DFT
The Variational Quantum Eigensolver, known as VQE, is currently the most widely used algorithm for quantum chemistry on near-term quantum hardware. Developed in 2014 by Alberto Peruzzo, Jarrod McClean, and their collaborators at Oxford and Harvard, VQE is a hybrid quantum-classical algorithm: it uses a quantum processor to prepare and measure a parameterized quantum state, then uses a classical optimizer to update the parameters until the energy of the state converges to its minimum. The energy at convergence corresponds to the ground-state energy of the molecule, which encodes the information needed to predict chemical properties and reaction pathways.
Comparing VQE to DFT on the same molecular systems reveals both the promise and the current limitations of the quantum approach. For small, strongly correlated systems, such as the nitrogen fixation reaction catalyzed by the enzyme nitrogenase, VQE running on current quantum hardware has been shown to produce energy estimates that are closer to experiment than DFT with standard functionals, even with the noise and error rates present in today's machines. Researchers at IBM and Google have published benchmark results showing that VQE can capture electron correlation effects that DFT consistently misses.
However, VQE has its own scaling challenges. The number of qubits required grows with the size of the molecular orbital basis set used, and the circuit depth required to implement accurate ansatz states grows rapidly with the degree of electron correlation in the system. On current noisy intermediate-scale quantum hardware, VQE is limited to systems of roughly 10 to 30 qubits before noise overwhelms the signal. This means that in 2026, VQE is competitive with DFT primarily for small, chemically important subsystems: binding site fragments, reaction transition states, cofactor models, and the like, rather than for full drug molecules in complex biological environments.
The Accuracy-Scale Tradeoff
For a reaction center containing a transition metal cluster with a dozen or so atoms, VQE on a 50-qubit quantum processor can achieve chemical accuracy, meaning errors below 1 kilocalorie per mole, in cases where DFT gives errors of 5 to 10 kilocalories per mole or more. At this level of accuracy, the difference between a correct and incorrect prediction of whether a drug candidate will react with its target can be the difference between a lead compound and a dead end. That gap is where quantum computing earns its place in the pharmaceutical toolkit.
The comparison becomes more nuanced when you factor in wall-clock time and infrastructure cost. Running DFT on a modern computational chemistry cluster is cheap, fast, and widely accessible. Running VQE on a 50-qubit quantum processor requires access to hardware that costs tens of millions of dollars to build and operate, produces results with significant noise that must be mitigated through error correction protocols, and requires specialized expertise to program and interpret. For the vast majority of pharmaceutical simulation tasks in 2026, DFT remains the practical choice. But for the hard problems, the ones where DFT is known to fail systematically, VQE and related quantum algorithms are beginning to provide a credible alternative.
Where Classical Computing Still Wins
It would be a mistake to conclude from the above that quantum computers are simply better than classical ones and that the pharmaceutical industry should be racing to replace its computational infrastructure. The reality is considerably more nuanced. Classical computers have decades of software development behind them, massive parallelism, low noise, and a mature ecosystem of tools that pharmaceutical researchers know how to use. There are many problems in drug discovery where classical computing is not just adequate but genuinely excellent.
Molecular dynamics simulations, which track how large biomolecules like proteins move and flex over time, are one clear example. These simulations use classical force fields rather than quantum mechanics to describe atomic interactions, and for large systems like protein-ligand complexes containing tens of thousands of atoms, this approximation is entirely appropriate. The questions being asked, such as how tightly does a drug bind, how quickly does it associate and dissociate, what conformational changes does binding induce, are questions that can be answered accurately at the classical level. Quantum effects matter primarily for electronic structure; the mechanics of how large molecules move is largely a classical problem.
Machine learning models trained on large pharmaceutical datasets represent another domain where classical computing excels. Models that predict ADMET properties, which is to say absorption, distribution, metabolism, excretion, and toxicity, from molecular structure have reached impressive levels of accuracy using classical deep learning architectures. These models do not need to solve the Schrodinger equation. They need to identify statistical patterns in large datasets, and classical hardware is extremely well suited to that task. The same is true for generative models that propose novel molecular structures, virtual screening pipelines that triage large compound libraries, and the clinical trial analysis tools that help researchers interpret experimental results.
The honest answer is that classical computing and quantum computing are not in direct competition for the same workloads. They are suited to different parts of the drug discovery pipeline. Recognizing which part of the problem benefits from which type of computation is itself an important scientific and engineering challenge, and one that the field is only beginning to work through systematically.
The Hybrid Reality of 2026
The practical architecture that is emerging in pharmaceutical quantum computing is neither purely quantum nor purely classical but a carefully engineered hybrid. IBM, which operates some of the most powerful quantum processors currently available through its IBM Quantum Network, has partnered with pharmaceutical companies including Pfizer to explore hybrid quantum-classical workflows for drug discovery applications. Bayer has announced collaborations with quantum computing providers to investigate quantum approaches to crop science and pharmaceutical research simultaneously. Google's quantum AI team has published results demonstrating chemical accuracy for small molecules on its Sycamore processor and has roadmaps pointing toward fault-tolerant computation within this decade.
In a typical hybrid workflow as it exists today, a pharmaceutical research team will use classical tools to do the initial heavy lifting: docking calculations to identify promising binding poses, DFT calculations to rank candidates by predicted binding energy, molecular dynamics to assess stability. When they identify a small set of high-priority candidates and a specific chemical question where quantum accuracy matters, such as understanding the electronic mechanism by which a covalent warhead reacts with its target residue, they route that specific calculation to a quantum processor. The quantum calculation returns a more accurate energy estimate or electronic structure description, which is fed back into the classical analysis pipeline.
This is not the vision of quantum supremacy that captured popular imagination in 2019, when Google announced that its Sycamore processor had completed a specific calculation in 200 seconds that would take a classical supercomputer 10,000 years. That demonstration involved a carefully constructed mathematical problem, not a pharmaceutical application. But the hybrid model described above is something more useful in a practical sense: a genuine improvement in the accuracy of quantum chemistry calculations for specific, tractable problems that matter to drug discovery. The science of quantum approaches to cancer therapy depends in part on advances in exactly this kind of hybrid simulation capability.
The development of better quantum error correction is accelerating this transition. In 2023 and 2024, multiple groups demonstrated quantum error correction codes that could suppress logical error rates below physical error rates, a key milestone. As error correction improves and qubit counts increase toward the thousands and eventually millions needed for fully fault-tolerant computation, the set of pharmaceutical problems that can be addressed with genuine quantum advantage will expand. The question is not whether quantum computers will be useful for drug discovery but when, and for which specific applications, they will be useful enough to justify the infrastructure investment.
What This Means for Drug Timelines
The average time from initial target identification to approved drug currently sits at around 10 to 15 years, with total development costs often exceeding one billion dollars when accounting for the many candidates that fail along the way. A significant fraction of those failures happen late in clinical development, after hundreds of millions of dollars have already been spent, because early-stage predictions about safety and efficacy turned out to be wrong. Better computational tools at the discovery stage have the potential to shift that failure curve: to catch more problems earlier, before expensive clinical trials begin, and to identify the best candidates from a much larger and more diverse pool than experimental screening alone can reach.
Quantum simulation contributes to this goal primarily by improving the accuracy of the electronic structure calculations that underpin predictions about how drugs interact with their targets at the molecular level. If a quantum computer can predict binding energies, reaction mechanisms, and selectivity profiles with higher accuracy than current classical methods, then the computational filters applied at the hit-to-lead and lead optimization stages of drug discovery become more reliable. Fewer promising candidates are discarded because of false-negative predictions. Fewer weak candidates advance because of false-positive ones. The overall efficiency of the pipeline improves.
Researchers estimate that improvements in early-stage computational accuracy could, over time, reduce the total cost of drug development by compressing the lead optimization phase and reducing late-stage attrition. The magnitude of this effect is difficult to quantify precisely because it depends on how widely quantum tools are adopted, how much the accuracy of quantum calculations improves relative to classical methods, and how well the industry adapts its workflows to take advantage of hybrid approaches. But the directional case is clear: more accurate simulations at earlier stages translate to better decisions and, ultimately, to medicines that reach patients faster and more affordably.
For the computational chemist waiting three weeks for her simulation to finish, the promise of quantum computing is not abstract. It is the possibility that, within a decade, the same calculation could run in hours rather than weeks, with higher accuracy rather than lower, and that the results would be trustworthy enough to make confident decisions about which candidate to advance to the next stage. That shift, from approximation to accuracy and from weeks to hours, is what the quantum computing industry is working toward. The path is technically difficult and the timeline is uncertain, but the destination is coming into focus with increasing clarity.
Both IBM and Google have published quantum hardware roadmaps projecting fault-tolerant quantum processors capable of running pharmaceutical-scale simulations within the next several years. Whether those timelines prove accurate remains to be seen. Quantum hardware development has a history of optimistic projections meeting harder-than-expected engineering realities. But the underlying science is sound, the investment is substantial, and the applications in pharmaceutical research are compelling enough that every major drug company has either launched its own quantum computing program or entered into partnerships with hardware providers. The race is real, and the stakes are high enough to justify serious attention from anyone involved in the future of medicine.
Related Articles
Apr 1, 2026
How Quantum Computing Speeds Up Drug Discovery
Quantum computers can simulate molecular interactions classical machines cannot. Here is how the industry is compressing drug development timelines.
Jun 3, 2026
Protein Folding and Quantum Computing: The Next Frontier
AlphaFold changed what we know about protein structure. Quantum computing may change how we design drugs around it.
Jun 5, 2026
The Quantum Drug Discovery Pipeline: From Atom to Patient
A stage-by-stage map of where quantum computing intervenes in drug discovery and why each stage matters.