How Quantum Computing Actually Works (Part 1)

Quantum computers do not simply “try every answer at once.” So what do they actually do—and why have governments and technology companies spent billions trying to build them? In Part 1 of our two-part deep dive on quantum computing, Lester Nare and Krishna Choudhary build the field from first principles. The series was prompted by a new Nature cover paper, “A digitally controlled silicon quantum processing unit,” co-authored by Krishna and members of the HRL Quantum Team and collaborators. Before getting into that hardware in Part 2, we first need to understand why anyone wanted to build a quantum computer in the first place. We begin with Bell’s theorem and the experimental failure of local hidden-variable theories, then follow the realization that information is fundamentally physical through Rolf Landauer, reversible computation, Charles Bennett, Tommaso Toffoli, Paul Benioff, and the early quantum-information pioneers. Then Richard Feynman enters the story. Classically simulating an interacting quantum system requires keeping track of a state space that grows exponentially with the number of particles. Feynman’s insight was radical but simple: if nature is quantum mechanical, perhaps the computer simulating nature should be quantum mechanical too. From there, David Deutsch formalizes the universal quantum computer and produces the first quantum algorithm. We use the Deutsch–Jozsa algorithm, the double-slit experiment, and Feynman’s path-integral intuition to explain what quantum computation is actually exploiting: not a magical ability to test every answer, but carefully engineered interference between quantum amplitudes. Finally, we reach the algorithms that transformed quantum computing from an academic curiosity into a strategic technology. Daniel Simon develops a seemingly artificial quantum problem. Peter Shor recognizes the deeper mathematical structure, turns it into an efficient factoring algorithm, and suddenly public-key cryptography enters the conversation. Lov Grover follows with a quantum search algorithm—and governments begin taking quantum computing very seriously. We also discuss Google Willow and the many-worlds interpretation, quantum cryptography, post-quantum security, the origins of federal quantum-computing programs, and what useful quantum computers may ultimately be good for. Part 2: How do you actually build one?