Chapter 10 Quantum Computing

Fundamentals

CH 10 Fundamentals Foundations

Foundations

Classical and Quantum computers side by side

Classical vs. Quantum

OVERVIEW

Classical and quantum computing represent two fundamentally different paradigms for processing information. Classical computing is the technology we use every day; it is what powers your laptop, smartphone, and the servers running Netflix, processing information using bits—tiny switches that are either "on" (1) or "off" (0). Every calculation, video, and email ultimately reduces to millions of these binary values processed at high speed. Its operation is deterministic and sequential, since classical computers process information sequentially, following deterministic pathways governed by Boolean logic, where every calculation ultimately reduces to combinations of these binary states. Quantum computing, by contrast, operates on completely different principles borrowed from quantum physics, using quantum bits or "qubits" instead of bits. Qubits leverage superposition, which allows them to exist in multiple states simultaneously, letting quantum computers explore many possibilities at once and vastly increasing their computational power. They also exploit entanglement, a phenomenon where qubits become interconnected, allowing changes to one qubit to affect another instantaneously, regardless of distance. The relationship between the two is best understood as complementary rather than competitive, with quantum machines positioned as specialized tools alongside, not in place of, the classical computers that have dominated technology for over seventy years.

STRENGTHS

Each paradigm excels at a distinct class of problems. Classical computing's strengths are maturity, reliability, and general-purpose versatility; classical systems are relatively stable and less prone to errors due to mature hardware and software, and they remain superior for the everyday deterministic tasks — browsing, arithmetic, document editing, gaming — that make up most computing. Their power also scales predictably, since power increases linearly with the number of semiconductor transistors in a system, in a 1-1 relationship. Quantum computing's strengths lie in specific, classically intractable problems. It excels in areas like cryptography, optimization, and material science, where classical computers struggle to find efficient solutions, and holds promise for accelerating machine learning algorithms, which could revolutionize fields like drug discovery, financial modeling, and climate forecasting. The core advantage is the ability to use interference for probability amplification and solve certain problems exponentially faster than classical systems, with parallelism that theoretically enables quantum computers to scale up compute capacity faster and to account for multiple outcomes having different probabilities. Quantum is also uniquely suited to simulating nature itself, since simulating quantum systems — molecules, materials, chemical reactions — is inherently difficult for classical computers because the quantum state space grows exponentially.

MISCONCEPTION

The single most important misconception is that quantum computers are simply faster, all-purpose classical computers that will replace the machines we use today. They will not. As one analysis notes, a key myth is the excessive hype — many expect quantum computers to boost every task, when in reality they may excel at specific problem types while classical systems remain superior at executing other jobs. The honest framing is explicit: quantum computers are not replacements for classical machines—at least not yet. The relationship is complementary, with quantum processors poised to serve as specialized co-processors for narrow problem classes like optimization, sampling, and quantum simulation, while the realistic future points toward hybrid quantum-classical architectures, where classical computers handle general processing and system control while quantum processors tackle specific tasks requiring quantum advantage. This misconception matters because it obscures both the genuine promise and the real limitations — quantum machines remain fragile, since qubits lose their quantum state easily through decoherence, often within microseconds, and require near absolute-zero temperatures and sophisticated isolation. A quantum computer would in fact be far worse than your laptop at sending an email; its value lies not in universal speed but in solving a narrow set of otherwise impossible problems.

The Algorithm

OVERVIEW

At its core, an algorithm is a finite, well-defined sequence of steps for solving a problem or performing a computation. This definition holds equally in classical and quantum computing: an algorithm is essentially a recipe of instructions that takes an input and reliably produces an output. It is the intellectual bridge between an abstract problem and a machine's physical execution — the design that converts raw hardware capability into a useful solution. Whether the task is sorting a list, searching a database, encrypting a message, factoring a number, or rendering an image, the algorithm specifies precisely how to get from question to answer. What differs between the two paradigms is not this fundamental nature but two deeper things: the kind of operations the steps are built from, and the physical substrate those steps run on. Classical algorithms are built from logical operations on bits; quantum algorithms are built from quantum gates acting on qubits. In both worlds, the algorithm is what gives the hardware purpose, since transistors and qubits do nothing useful on their own. Algorithms are also evaluated similarly — chiefly by time complexity, meaning how the number of required steps grows as the input size increases.

CLASSICAL ALGORITHM

In classical computing, an algorithm is a deterministic — or sometimes deliberately randomized — sequence of logical operations performed on bits. Each step manipulates definite values of 0s and 1s through Boolean logic gates such as AND, OR, and NOT, and the same input reliably produces the same output every time. The algorithm functions as the bridge between an abstract problem and the machine's concrete execution: high-level tasks are expressed in code, then compiled down to machine instructions that a processor executes one step at a time, sequentially or in parallel. The defining features of classical algorithms are determinism and discreteness. At every moment during the computation, the machine occupies exactly one definite state, and the algorithm dictates the precise transition from that state to the next. This predictability makes classical algorithms straightforward to verify, debug, and reproduce. They are evaluated primarily on two measures: time complexity, which describes how the number of steps grows with input size, and space complexity, which describes how much memory they consume. Most classical operations are also irreversible — information can be discarded as the computation proceeds. This step-by-step logical progression has powered virtually all everyday computing, from spreadsheets and web browsers to scientific simulation, for the entire history of digital machines.

QUANTUM ALGORITHM

In quantum computing, an algorithm is still a sequence of steps, but the steps are quantum gates applied to qubits, and the underlying logic is fundamentally different. Quantum gates are reversible (unitary) operations, and a quantum algorithm exploits three properties that have no classical equivalent. Superposition lets the algorithm operate on many possible states at once rather than one at a time. Entanglement links qubits so the system behaves as an interconnected whole rather than independent parts. Interference is the actual engine of computation: quantum algorithms are deliberately engineered so that paths leading to wrong answers cancel out through destructive interference, while paths leading to correct answers reinforce through constructive interference. This last point is crucial and often misunderstood — a quantum algorithm does not simply try all answers in parallel and pick the right one. Superposition creates a vast space of possibilities, but measurement yields only one outcome and collapses the superposition, so the art lies in choreographing interference so the correct answer is overwhelmingly the most probable result. Because measurement is probabilistic, quantum algorithms are typically run many times, with the answer emerging as a distribution. Shor's algorithm (factoring) and Grover's algorithm (search) are the canonical examples.

Bits vs. Qubits

OVERVIEW

A unit of information is the smallest, most basic building block from which all data in a computing system is constructed and processed. It is the atom of computation — the indivisible element a machine stores, manipulates, and reads to perform any task, from arithmetic to streaming video. Every more complex piece of data, whether text, image, sound, or instruction, ultimately reduces to long combinations of these fundamental units. A unit of information does two essential things: it holds a state, representing some value the system can store, and it participates in operations, being transformed by the machine's logic gates as a computation proceeds. The number of distinct states a single unit can occupy determines how much information it carries and how the system can process it. Crucially, the nature of a unit defines the entire character of the computing paradigm built upon it. Classical and quantum computing differ at this most fundamental level precisely because they use different units of information with different physical properties and rules. Understanding the unit is therefore the key to understanding the machine: the bit underpins all classical computing, while the qubit underpins quantum computing, and their differing capabilities flow directly from how each one stores and behaves.

BITS

A bit, short for "binary digit," is the fundamental unit of information in classical computing. A classical binary bit has to be in one of two possible states: 0 or 1. It is strictly deterministic and mutually exclusive — like a switch, it is either on or off, never both, and never anything in between. Every piece of data your computer processes, from text messages to streaming video, ultimately reduces to long strings of these binary values. The bit's power comes not from any single unit but from combination: stringing many bits together allows the representation of numbers, letters, instructions, and ultimately any digital content, while logic gates such as AND, OR, and NOT transform these bits to carry out computation. A defining feature of the bit is its predictability. At any given moment, a bit occupies exactly one definite state, and reading it does not change it — measurement is non-destructive and repeatable. This determinism makes classical systems reliable, reproducible, and easy to verify, which is why bits have powered the entire history of digital computing. The trade-off is that n classical bits can represent only one of their possible states at any single instant, limiting how much a classical machine can hold in play simultaneously.

QUBITS

A qubit, short for "quantum bit," is the fundamental unit of quantum information — the quantum analog of the classical bit. Unlike a classical bit that can only be 0 or 1 at any given time, a qubit can exist in a combination of both 0 and 1 states simultaneously, a property called superposition. A qubit can represent 0, 1, or any proportion of 0 and 1 at the same time, with certain probabilities for each. Physically, building one means finding a physical system that behaves quantum mechanically and can be controlled with precision — examples include the spin of an electron or the polarization of a photon. Physicists visualize a qubit's state using the Bloch sphere, where the north pole corresponds to the 0 state, the south pole to the 1 state, and every other point on the surface represents some superposition of the two; whereas a classical bit can only sit at one of the two poles, a qubit can occupy any point on the sphere, giving it a far richer range of states. This advantage comes at a cost: the moment we measure it, the superposition collapses, and the qubit randomly snaps to either 0 or 1 according to those probabilities.

3 Key Properties

SUPERPOSITION

Superposition is the first foundational pillar of quantum computing — the property that allows a qubit to hold many possible values at once rather than a single definite one. As one description puts it, the state of possibility available to qubits is called superposition, where super means many and position means possibilities; a traditional bit can be either 0 or 1, but a qubit in superposition does not have a defined value because it holds many potential values at the same time. The payoff is parallelism: because a qubit can be in a superposition of 0 and 1, a quantum computer can perform multiple computations in parallel by processing all possible states of the qubits at once, whereas a classical computer can only perform one computation at a time. This blended state is not permanent, however; when we measure a qubit, we just get 0 or 1 back — whichever value the qubit's wave function collapsed to when it was measured. In practice, qubits are placed into superposition through quantum gate operations that manipulate their probability amplitudes, most commonly the Hadamard gate, which transforms a qubit in the |0⟩ state into an equal superposition of |0⟩ and |1⟩. A common analogy is a spinning coin: before it lands, it is meaningfully both heads and tails at once.

ENTANGLEMENT

Entanglement is the second pillar of quantum computing — a uniquely quantum linkage that ties qubits together so they behave as a single, inseparable system. As IBM describes it, entanglement is the ability of qubits to correlate their state with other qubits; entangled systems are so intrinsically linked that when quantum processors measure a single entangled qubit, they can immediately determine information about other qubits in the entangled system. This correlation holds regardless of the distance between the qubits, enabling quantum systems to represent and manipulate complex correlations in data. Physically, entanglement arises when two or more qubits interact in such a way that their quantum states become inseparable; once entangled, the qubits form a composite system, meaning the overall quantum state can no longer be described by the state of each qubit individually. Its importance is structural, since it is entanglement that allows qubits to function together as a system, unlocking the true power of quantum computation. Entanglement also compounds superposition's reach, as when an entangled qubit is in superposition, each of its entangled connections is also in superposition, and these cascading uncertainties exponentially increase the potential power of quantum computers. The classic analogy is two magically linked coins flipped in distant cities.

INTERFERENCE

Interference is the third key property and, crucially, the mechanism by which quantum computers actually arrive at answers. IBM frames it directly: interference is the engine of quantum computing; when qubits are placed into a state of collective superposition, they structure information in a way that resembles waves, with amplitudes associated with each outcome, and these amplitudes become the probabilities of the outcomes of a measurement. The technique exploits the wave-like nature of those amplitudes, since quantum algorithms leverage interference to amplify correct paths and cancel out incorrect ones, increasing the probability of reaching the right answer. Like ripples in a pond, positive and negative probability amplitudes can either combine to massively boost the right answer through constructive interference or cancel the wrong answers out entirely through destructive interference. This is what separates a quantum computer from brute force — it is not merely trying every possibility at once, but choreographing cancellation and reinforcement so the correct result dominates at measurement. A helpful analogy is navigating a maze: rather than checking every path one by one, quantum interference cancels out wrong turns and strengthens the path to the correct exit, much as noise-canceling headphones erase unwanted sound while preserving the desired signal.

CH 10 Tech Theory

Theory

Richard Feynman

BRIEF BIO

Richard Phillips Feynman (1918–1988) was an American theoretical physicist widely regarded as one of the most brilliant and influential scientists of the twentieth century. Born in New York City, he showed early aptitude for mathematics and physics, completing his undergraduate studies at MIT before earning his doctorate at Princeton in 1942. During the Second World War he was recruited to the Manhattan Project at Los Alamos, where, despite being one of the youngest group leaders, he contributed to the development of the atomic bomb. After the war he held positions at Cornell University and then, from 1950, at the California Institute of Technology, where he spent the rest of his career and produced his most celebrated work. Feynman was renowned not only for his scientific genius but for his exceptional gifts as a teacher and communicator, his irreverent personality, and his wide-ranging curiosity — from safe-cracking to bongo drumming. His best-selling memoir Surely You're Joking, Mr. Feynman! captured his playful character for a broad public. Beyond his foundational contributions to quantum electrodynamics, his later interest in the relationship between physics and computation, expressed in a landmark 1981 lecture, would help give birth to the entire field of quantum computing.

ACCOMPLISHMENTS

Feynman's accomplishments span physics, computation, and public science. His crowning achievement was his work on quantum electrodynamics (QED), the theory of how light and matter interact, for which he shared the 1965 Nobel Prize in Physics. He invented the celebrated "Feynman diagrams," an intuitive graphical method for representing particle interactions that remains an indispensable tool across physics. In quantum computing specifically, he delivered his seminal lecture "Simulating physics with computers" at the Physics of Computation Conference at the MIT Endicott House in May of 1981, later published in the International Journal of Theoretical Physics in 1982. In it, he argued from the observation that natural phenomena are quantum rather than classical in their essence, showing that classical computers cannot efficiently simulate quantum systems and proposing that to simulate quantum systems, you would need to build quantum computers. He followed this with a 1985 paper, "Quantum Mechanical Computers," developing the idea further — though notably he refers to atoms rather than qubits and doesn't mention qubits in any of these papers. Other accomplishments include his influential Feynman Lectures on Physics, his foundational thinking on nanotechnology, and his role on the Rogers Commission investigating the 1986 Challenger disaster.

IMPACT

Feynman's impact on quantum computing is foundational — he is widely credited with conceiving the field's central premise. His 1981 lecture is now properly regarded as one of the most influential pieces of work that helped lay out the foundations of quantum computing as a research discipline in its own right. The core insight endures: he conjectured a universal quantum simulator capable of modeling any quantum mechanics system, and his 1982 insights laid the groundwork for future developments in quantum computing technology and theory. The motivating problem he identified — that simulating systems with many interacting particles is intractable classically because the number of probabilities becomes unworkable — remains one of the primary justifications for building quantum computers today, with quantum simulation still considered one of their most promising applications. Because of this, Feynman's ideas and work continue to influence the field of quantum computing, and he is often considered one of the founders of the entire field. Beyond the specific proposal, his impact is also conceptual and cultural: he reframed the deep connection between physics and information, inspiring generations of researchers — from David Deutsch's universal quantum computer to today's experimental efforts — to pursue machines that compute using the laws of quantum mechanics. His vision effectively launched a discipline that did not yet exist.

David Deutsch

BRIEF BIO

David Elieser Deutsch is a British physicist widely regarded as one of the founding figures of quantum computation. He was born on 18 May 1953 in Haifa, Israel, and later moved to England, where he pursued his education and built his career. He studied at the University of Cambridge and then the University of Oxford, cultivating an early and lasting passion for fundamental physics and the deep theoretical structure of the universe. Deutsch has spent his career at Oxford, where he is a visiting professor in the Department of Atomic and Laser Physics at the Centre for Quantum Computation in the Clarendon Laboratory. Beyond his technical work, Deutsch is unusual among physicists for the breadth of his intellectual interests, weaving together quantum theory, philosophy of science, computation, and evolutionary biology into a unified worldview. He is the most prominent living advocate of Hugh Everett's many-worlds interpretation of quantum mechanics, arguing that it is the only interpretation that takes quantum theory seriously as a literal description of reality. A Fellow of the Royal Society, Deutsch is known not only as a rigorous theorist but as a gifted popularizer, making profound ideas accessible to general audiences through his widely read books.

ACCOMPLISHMENTS

Deutsch's central accomplishment was formalizing the idea of a universal quantum computer, transforming a loose intuition into rigorous theory. In 1985 he published the seminal paper "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," in which he extended the classical Church-Turing thesis to the quantum realm and proposed the concept of a universal quantum computer. Where Feynman had only sketched an intuition, it was Deutsch who, in 1985, provided the rigorous theoretical foundation: a formal model of a universal quantum computer and a proof that it could simulate any physical system. His accomplishments extend across the field's theoretical foundations; according to the Royal Society, he laid the foundations of the quantum theory of computation, and has subsequently made or participated in many of the most important advances, including the discovery of the first quantum algorithms, the theory of quantum logic gates and quantum computational networks, the first quantum error-correction scheme, and several fundamental quantum universality results. He co-developed the Deutsch-Jozsa algorithm, among the first to demonstrate quantum advantage, and was the first to publish a proof that quantum computers could outperform classical Turing machines in certain tasks. His 1997 book The Fabric of Reality unified quantum physics, epistemology, computation, and evolution.

IMPACT

Deutsch's impact on quantum computing is foundational and field-defining. By formalizing the universal quantum computer, he revolutionized computation by theorizing a machine exceeding classical limits, leveraging quantum mechanics to solve problems deemed intractable, redefining computation's very nature. His influence is not confined to a single result; the Royal Society credits him with having set the agenda for worldwide research efforts in this new, interdisciplinary field. His reframing was profound, encapsulated in his own dictum that "the theory of computation is now the quantum theory of computation." The theoretical machine he described in 1985 is precisely what experimentalists now strive to build, with recent hardware such as Google's Willow chip (2024) described as a step toward the kind of fault-tolerant universal quantum computer that David Deutsch theorised in 1985. Deutsch himself remains grounded about progress, observing that "no practically usable universal quantum computer has been built yet," framing it as a matter of when, not if. Beyond the technical, his work made the field's philosophical implications comprehensible to the public and challenged fundamental notions of reality itself, ensuring his influence spans not only quantum computing but the broader understanding of what computation and physical law truly are.

Peter Shor

BRIEF BIO

Peter Williston Shor is an American theoretical computer scientist and mathematician regarded as one of the founders of quantum computing. He was born on August 14, 1959, in New York City, to Joan Bopp Shor and S. W. Williston Shor. He displayed exceptional mathematical talent from an early age, which carried him to an elite education and an undergraduate degree in mathematics at the California Institute of Technology, where he demonstrated an increasing interest in the theoretical foundations of applied mathematics. He went on to earn his doctorate before joining AT&T Bell Labs, the legendary research institution where he was working when he made his most famous breakthrough. It was there, after hearing a colleague speak on quantum cryptography, that Shor turned his attention to what quantum computers might achieve. Since 2003 he has been a professor of applied mathematics at the Massachusetts Institute of Technology, where he holds the Morss Professorship. Today he also serves as a principal investigator at the Brookhaven Lab-led Co-design Center for Quantum Advantage, leading research in quantum error correction and quantum algorithms. Working at a time when quantum computing was widely dismissed as a mere thought experiment, Shor became the figure who proved the field had profound, practical consequence.

ACCOMPLISHMENTS

Shor's signature accomplishment is the algorithm that bears his name. Shor's algorithm is a quantum algorithm for finding the prime factors of an integer, developed in 1994, and is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to the best known classical algorithms. His original 1994 paper showed that factoring and discrete logarithms can be done quickly on a quantum computer, with profound implications because most modern encryption relies on factoring being hard. His second landmark accomplishment came the following year, addressing the field's biggest obstacle. As MIT describes it, in 1995, Shor countered the assumption that quantum computing was impossible with another algorithm, on quantum error correction, introducing the idea that quantum errors could be isolated and fixed without measuring the qubit itself, thereby leaving the quantum computation intact. This became known as the Shor code, the first practical quantum error correction scheme, allowing quantum systems to maintain coherence longer. His broader work spans quantum information theory, including the capacity of quantum channels to transmit data. In recognition, he received the 2023 Breakthrough Prize in Fundamental Physics and MIT's 2022–2023 Killian Award.

IMPACT

Shor's impact transformed quantum computing from a theoretical curiosity into a field of urgent global importance. His factoring algorithm put quantum computing on the proverbial map; by threatening encryption, national governments, whole industries, and the public at large were forced to take notice of this relatively new technology, and decades later it remains the standard bearer of quantum algorithms. He derived it in 1994, at a time when quantum computing was largely considered a thought experiment, proving that qubits could theoretically solve some problems exponentially faster than the most powerful classical computers. His error-correction work was equally consequential, since it set off the beginning of the field of quantum error correction and remains a central ingredient in efforts to build practical machines. As MIT's mathematics head summarized, Shor's work demonstrated that quantum computers could efficiently solve problems classical computers couldn't, and that Claude Shannon's error-correcting approach had a quantum analogue — his vision and technical mastery really transformed the field. The cryptographic threat he exposed continues to drive the worldwide migration to post-quantum cryptography. His influence even reaches fundamental physics, with his ideas now at the frontiers of metrology and quantum gravity — opening, in the words of his Killian citation, new avenues of human thought and endeavor.

Lov Grover

BRIEF BIO

Lov Kumar Grover is an Indian-American computer scientist best known as the originator of the Grover database search algorithm used in quantum computing. He was born in Meerut, India, in 1961. Grover received his bachelor's degree from the Indian Institute of Technology, Delhi, in 1981, and his PhD in electrical engineering from Stanford University in 1985, having also earned master's degrees in electrical engineering from Caltech and physics from Stanford along the way. He went to Bell Laboratories in 1984, the legendary research institution where he would spend most of his career. Notably, his early work was not in quantum computing at all; he worked initially in computer-aided design, designing and implementing a VLSI CAD system based on simulated annealing used to produce several thousand AT&T commercial chips. He served as a visiting professor at Cornell University from 1987 to 1994 before returning to Bell Labs. Famously, as his own seminar biography puts it, in his spare time he invented the quantum search algorithm that bears his name. By 1998 he had moved into the Physics Research department at Bell Labs to focus on quantum topics, and he retired in 2008, becoming an independent researcher.

ACCOMPLISHMENTS

Grover's defining accomplishment is the quantum search algorithm he published in 1996. As he described it, in 1996 he published "A fast quantum mechanical algorithm for database search" at STOC, the ACM Symposium on the Theory of Computing. The algorithm delivers a provable advantage: Grover's algorithm finds the correct entry in O(√N) steps — a quadratic speedup compared to a classical computer; for one million entries, instead of 500,000 steps, it needs approximately 1,000. More formally, it is a quantum algorithm for unstructured search that finds, with high probability, the unique input to a black-box function that produces a particular output value. The algorithm works by exploiting two fundamental properties of quantum mechanics: superposition and quantum interference, using a technique now known as amplitude amplification — a second foundational contribution credited to him. Its significance was historic, winning renown as the second major algorithm proposed for quantum computing, after Shor's 1994 algorithm, and in 2017 it was finally implemented in a scalable physical quantum system. His STOC publication is considered one of the milestones of quantum information science. At Bell Labs, he was promoted to Distinguished Member of the Technical Staff in 2002 in recognition of his impact.

IMPACT

Grover's impact established that quantum computing's advantages extend far beyond code-breaking into the ubiquitous problem of search. Computer scientists had long known that searching N unsorted entries takes around N steps, but Grover showed how the strange rules of quantum mechanics allowed the search to be done in a number of steps equal to the square root of N — that was a big deal. The breadth of its applicability is what distinguishes it; unlike algorithms built for one narrow task, quantum searching has found application in designing numerous other important algorithms. This versatility makes it a building block across optimization, cryptanalysis, and machine learning, and it remains the fastest possible search algorithm that could run on a quantum computer — a proven optimality that cements its lasting importance. Grover's work has even reached into the natural sciences, as he and others have hypothesized that some natural processes may be based on quantum searching, including energy transfer in photosynthesis, crack detection, and the number of base amino acids in genes. Indeed, researchers have explored whether the algorithm may actually be a property of nature, evidence of which might even help explain the genetic code. Alongside Shor's, Grover's algorithm stands as one of the two pillars that proved quantum computers could do something genuinely transformative.

CH 10 Fundamentals Engineering

Engineering

Devoret & Schoelkopf

BRIEF BIOS

Michel Devoret and Robert Schoelkopf are Yale physicists whose collaboration helped create the superconducting qubit technology at the heart of modern quantum computing. Michel H. Devoret was born in 1953 in Paris, France, and earned a degree in engineering in 1975 from the École Nationale Supérieure des Télécommunications, then a degree in quantum optics in 1976 and a Ph.D. from the University of Paris-Sud. Early in his career he joined John Clarke's research group at UC Berkeley for postdoctoral work, then in 1985 founded the Quantronics group at CEA-Saclay to study the quantum behavior of superconducting circuits. He joined the Yale faculty in 2002. Today he serves as chief scientist for Google Quantum AI and professor at UC Santa Barbara. His collaborator, Robert John Schoelkopf III, was born on January 24, 1964, in Manhattan, New York City, and is a graduate of Princeton University who earned his Ph.D. in physics from the California Institute of Technology; from 1986 to 1988 he was an electrical/cryogenic engineer at NASA's Goddard Space Flight Center. He came to Yale as a postdoctoral researcher in 1995, joined the faculty in 1998, and is now the Sterling Professor of Applied Physics and Physics and Director of the Yale Quantum Institute.

ACCOMPLISHMENTS

Their joint accomplishments center on founding a new field and inventing its key device. Together with Yale colleague Steven Girvin, the pair created the new field of "circuit quantum electrodynamics," which allows quantum information to be distributed by microwave signals on wires. Their signature invention was a more stable qubit; in 2002 Devoret and his Yale colleagues designed a superconducting qubit called the transmon qubit, which, with its decreased sensitivity to charge noise, would become widely used by quantum researchers worldwide. Schoelkopf's lab produced a remarkable string of firsts based on these ideas, including the development of a "quantum bus" for information, and the first demonstrations of quantum algorithms and quantum error correction with integrated circuits. Schoelkopf is also credited with inventing the Radio-Frequency Single-Electron Transistor and the 3D transmon qubit. Devoret's crowning recognition came in 2025, when he was recognized with the 2025 Nobel Prize for Physics, shared with English physicist John Clarke and American physicist John M. Martinis, for critical contributions to understanding quantum phenomena in macroscopic systems. The two have shared earlier honors as well, including the Fritz London Memorial Prize and the John Stewart Bell Prize.

IMPACT

The impact of Devoret and Schoelkopf is foundational to the dominant hardware platform in quantum computing today. Their circuit QED approach has been extraordinarily influential, having generated hundreds of academic papers and been cited by other researchers more than 100,000 times. The transmon qubit they helped create is now the industry standard, and their broader work, as one summary puts it, co-developed circuit QED and the transmon qubit, the core of modern quantum computing, with that work now powering Google, IBM, Amazon, and a global quantum "gold rush." The deeper significance reaches back to Devoret's early experiments; as Yale's Steven Girvin explained, "the work Michel did with John Clarke and John Martinis demonstrated for the first time that electrical circuits big enough to see with your eye could still behave in a quantum way — it laid the groundwork for the construction of artificial atoms and led eventually to the work in quantum we're seeing today." Schoelkopf's key engineering insight — that working with microwaves would make it easier, and less expensive, to engineer a quantum computer chip — turned theoretical concepts into manufacturable hardware. Together, they transformed superconducting circuits from a curiosity into the practical basis on which much of the quantum computing industry is now built.

John Martinis

BRIEF BIO

John Matthew Martinis is an American physicist regarded as one of the foremost experimentalists in superconducting quantum computing. Born in 1958, he grew up in San Pedro, California; his father had moved to the United States from Yugoslavia to start a new life. Martinis received both a bachelor's degree and a doctorate in physics from the University of California, Berkeley, in 1980 and 1987, respectively. He then completed postdoctoral fellowships in France at the Alternative Energies and Atomic Energy Commission and in the United States at the National Institute of Standards and Technology (NIST). In 2004 his academic career took him to the University of California, Santa Barbara, where he later held the Worster Chair in Experimental Physics. A turning point came in 2014, when Google Quantum AI Lab, a partnership between UC Santa Barbara and Google, announced it had hired Martinis and his team in a multimillion-dollar deal to build a quantum computer using superconducting qubits. After resigning from Google in April 2020 following reassignment to an advisory role, he briefly joined Australia's Silicon Quantum Computing, and in 2022 he founded Qolab, a quantum computing private company based on semiconductor chip manufacturing. He is now Professor Emeritus at UCSB.

ACCOMPLISHMENTS

Martinis's accomplishments span foundational physics and landmark engineering. His crowning recognition came in 2025, when he shared the 2025 Nobel Prize in Physics with John Clarke and Michel Devoret for their joint work on macroscopic quantum phenomena in superconductors — fundamental contributions, including to the discovery of macroscopic quantum tunneling and energy quantization, that established much of the scientific foundation for quantum computing. His most famous engineering achievement was leading the team that reached a historic milestone: he and his team published a paper in Nature in 2019 where they presented how they achieved quantum supremacy for the first time using the Sycamore processor, a 53-qubit quantum processor. The feat was striking; a calculation that reportedly would have taken IBM's Summit — the world's most powerful commercially available computer — around 10,000 years to complete was allegedly cracked in under four minutes by Google's 53-qubit Sycamore machine. Earlier, the quantum device he developed with UCSB colleagues was named Science magazine's 2010 Breakthrough of the Year. His other honors include sharing the 2014 Fritz London Memorial Prize with Michel Devoret and Robert J. Schoelkopf, and the 2021 John Stewart Bell Prize.

IMPACT

Martinis's impact is to have carried quantum computing across the threshold from theory into demonstrated reality. As one profile frames it, he stands as the architect who transformed quantum mechanical curiosities into practical computational engines, his career embodying the evolution of quantum technology from laboratory science to world-changing capability. The Sycamore result was a watershed; it provided a powerful proof of the quantum-computing concept, and Martinis argued the precise speed comparison mattered less than the trajectory, since the speed advantage will grow exponentially as new qubits are added. The Nobel Committee captured his broader significance directly: "John Martinis transformed quantum mechanics from physics theory into computing technology; his work bridging fundamental science and practical application has launched a technological revolution." His decades of work on superconducting qubits also advanced quantum device engineering and error correction strategies, shaping the dominant hardware platform used across the industry today. Now, through Qolab, he continues pushing toward building scalable, low-error quantum systems through deep industry collaboration and system-level design. From fundamental circuit experiments to the first demonstration that a quantum computer could surpass classical machines, Martinis helped turn quantum computing into a genuine engineering discipline.

Wineland & Haroche

BRIEF BIOS

David Wineland and Serge Haroche are the two physicists who jointly won the 2012 Nobel Prize in Physics for their pioneering work controlling individual quantum systems. David Wineland was born on February 24, 1944, in Wauwatosa, Wisconsin; he received a bachelor's degree in physics from the University of California, Berkeley, in 1965 and a doctorate in physics from Harvard University in 1970. He worked at the National Institute of Standards and Technology in Boulder, Colorado, from 1975 to 2017, and later taught at the University of Oregon. His American counterpart in the prize was French; Serge Haroche was born on September 11, 1944, in Casablanca, Morocco, received degrees in physics in 1967 from the École Normale Supérieure in Paris, and earned a doctoral degree in 1971 from Université Paris VI, where his adviser was the physicist Claude Cohen-Tannoudji. Haroche was a postdoctoral fellow at Stanford University in 1972 and 1973, working in the laboratory of American physicist Arthur Schawlow. He has spent much of his career at the Collège de France in Paris. Born just months apart, the two worked independently on opposite sides of the Atlantic, pursuing the same long-held dream of studying single quantum objects directly.

ACCOMPLISHMENTS

Their shared crowning accomplishment was the 2012 Nobel Prize, awarded jointly "for ground-breaking experimental methods that enable measuring and manipulation of individual quantum systems." The two pursued complementary approaches to the same goal. Wineland's work concentrated on charged atoms: he traps electrically charged atoms, or ions, controlling and measuring them with light, or photons. Cooling a single ion to microdegrees above absolute zero, Wineland and his colleagues experimentally demonstrated some of the classic thought-experiments of modern physics, including the observation of quantum jumps as a single atom changed state, and the creation of "Schrödinger cat" states — having an ion in two macroscopically separated places at the same time. Haroche pursued the mirror-image method, trapping photons, particles of light or microwaves, in a cavity where the photons bounce back and forth between two mirrors a billion times before escaping. The achievement was profound because, as the Nobel committee noted, the two opened the door to a new era of experimentation with quantum physics by demonstrating the direct observation of individual quantum particles without destroying them — something earlier physicists had believed impossible.

IMPACT

The impact of Wineland and Haroche on quantum computing is foundational, since precise control over single quantum systems is the prerequisite for any quantum machine. The Royal Swedish Academy emphasized that they independently invented and developed methods for measuring and manipulating individual particles while preserving their quantum-mechanical nature, in ways that were previously thought unattainable — and a Nobel committee member stated directly that the pair's work represents "the first tiny steps towards building a quantum computer." They realized what had long seemed unreachable; together they realized a long-standing dream of quantum physics: studying the behavior of single quantum objects, an achievement the founders of quantum mechanics had believed lay beyond the realm of experiment. The significance was captured by quantum-optics pioneer Alain Aspect, who observed that observing, manipulating and controlling individual quantum systems has been a major breakthrough of the last few decades; Schrödinger doubted it might ever be possible, but this year's laureates have done it. Wineland's trapped-ion techniques in particular became the basis for an entire hardware platform now pursued commercially by companies like IonQ and Quantinuum. By making it possible to control quantum states without destroying them, the pair supplied the experimental bedrock on which today's quantum computers are built.

Mikhail Lukin

BRIEF BIO

Mikhail Dmitrievich "Misha" Lukin is a Russian-American theoretical and experimental physicist renowned for his pioneering work in quantum optics, atomic physics, and quantum information science. He was born on October 10, 1971, in Moscow. He studied physics and mathematics at the Moscow Institute of Physics and Technology (MIPT), graduating in 1993, then joined Texas A&M University, where he wrote a research paper titled "Quantum Coherence and Interference in Optics and Laser Spectroscopy" that he used for his Ph.D. thesis under advisor Marlan Scully. He later became a fellow and joint director of the Institute for Theoretical Atomic and Molecular Physics, a division of the Harvard-Smithsonian Center for Astrophysics. Today he is the Joshua and Beth Friedman University Professor of Physics at Harvard University, where he serves as co-director of the Harvard Quantum Initiative in Science and Engineering and the Harvard-MIT Center for Ultracold Atoms. His research, as Harvard describes it, focuses on quantum optics and atomic physics, emphasizing studies of quantum systems consisting of interacting photons, atoms, molecules and electrons coupled to realistic environments. He was elected a member of the National Academy of Sciences in 2018.

ACCOMPLISHMENTS

Lukin's accomplishments span theory and experiment across quantum computing, sensing, and networking. His research has advanced the control of quantum dynamics in systems involving interacting photons, atoms, molecules, and electrons, leading to breakthroughs in quantum computing, sensing, and networking, including the development of Rydberg atom-based quantum simulators and nanoscale sensors for medical applications. He is a central figure in neutral-atom quantum computing, a leading hardware platform; as he himself noted, "neutral atom arrays emerged as a leading platform for programmable quantum simulations and quantum information processing." His landmark experimental papers include "Logical quantum processor based on reconfigurable atom arrays" (2023, Nature), "Probing topological spin liquids on a programmable quantum simulator" (2021, Science), "Quantum optimization of maximum independent set using Rydberg atom arrays" (2022, Science), and "High-fidelity parallel entangling gates on a neutral-atom quantum computer" (2023, Nature). His team helped develop the first reconfigurable arrays of neutral atoms using "optical tweezers" — focused laser beams that trap and position neutral atoms into specific configurations. His early career also produced foundational work in quantum optics, recognized by the American Physical Society's 2009 I. I. Rabi Prize for pioneering theoretical and experimental work at the interface between quantum optics, quantum information processing, and the quantum many-body problem.

IMPACT

Lukin's impact has been to help establish neutral-atom arrays as one of the most promising routes to scalable quantum computing. His group's work demonstrated that reconfigurable atom arrays could deliver fundamental improvements in error correction techniques, crucial for reliable quantum computing, by simulating the rearrangement of atoms to reduce the overhead, allowing the system to maintain high performance without requiring excessive resources. He frames these advances as collective field-building, noting that the work let his team "move the entire field of quantum information science" forward and, in his words, "redefined a frontier of quantum information science." His influence extends well beyond his own laboratory through institutional leadership; as co-director of the Harvard Quantum Initiative since 2018, he oversees a broad effort to integrate quantum research across physics, engineering, computer science, and related fields, fostering education and collaboration among over 100 faculty and hundreds of students and postdocs, an initiative emphasizing scalable quantum systems and their applications in computing, sensing, and simulation. Through his co-founding role in QuEra Computing, his Rydberg-atom research has also moved from the lab toward commercial quantum machines, cementing his role as both a scientific pioneer and a builder of the broader quantum ecosystem.

CH 10 Fundamentals Leaders

Leaders

IonQ, Rigetti, PsiQuantum

OVERVIEW

IonQ, Rigetti, and PsiQuantum are three quantum-computing startups pursuing fundamentally different hardware approaches. IonQ builds trapped-ion systems; like Quantinuum, it suspends individual charged atoms in an electromagnetic trap inside an ultra-high vacuum and manipulates them with finely tuned lasers, which gives very high fidelity at the cost of slower operation. It is the sector's largest pure-play by revenue, with roughly US$130 million in 2025 sales and 2026 guidance of US$225–245 million, optimized for qubit fidelity. Rigetti takes the superconducting route, joining IBM and Google in a technology that prints tiny circuits with Josephson junctions onto a chip, cools them in a dilution refrigerator to a few thousandths of a degree, and steers them with shaped microwave pulses. Rigetti builds modular superconducting chips optimized for scalability. PsiQuantum pursues photonics; like Xanadu, its builders generate and interfere single particles of light through optical chips that can run close to room temperature, sidestepping the cryostat entirely. Its strategy targets fault-tolerant scale via CMOS-compatible silicon-photonic integration, and it has attracted major investment, recently raising a $1B Series E at a $7B valuation, using a fusion-based approach.

INFLUENCES

Each company's work rests on the foundational physics and the broader hardware race that preceded it. The trapped-ion approach IonQ commercializes descends directly from the Nobel-winning techniques of David Wineland, whose methods for controlling individual ions with lasers established the platform. Rigetti's superconducting qubits build on the circuit quantum electrodynamics and transmon designs pioneered by Devoret, Schoelkopf, and Martinis, now the most widely used qubit architecture. PsiQuantum's photonic strategy draws on decades of quantum optics and the practical bet that existing semiconductor manufacturing can be repurposed for quantum hardware. All three are also shaped powerfully by government and defense interest, which now functions as a major influence on their development. A landmark example is DARPA's Quantum Benchmarking Initiative, a rigorous, independently verified evaluation by a 50-expert assessment team of which hardware platforms can actually achieve utility-scale quantum computing and when; as of early 2026, IonQ, Quantinuum, PsiQuantum and QuEra have advanced through various stages. National funding shapes them too; in 2026 the U.S. Department of Commerce announced that Rigetti will receive up to $100 million in planned funding to address key technical challenges to develop and scale next-generation superconducting quantum computing technologies. Rigetti also partners with the UK Ministry of Defence.

IMPACT

The three companies' impact lies in proving out competing paths to practical quantum computing, with applications still largely emerging. IonQ delivers trapped ion quantum computing systems, cloud access, and enterprise solutions for real-world quantum applications, leading the field on gate fidelity, where trapped-ion systems achieve greater than 99.9% two-qubit fidelity with all-to-all connectivity. Rigetti contributes the scalability advantages of superconducting chips, part of a combined industry effort where the IBM, Google, and Rigetti programmes target a utility-scale superconducting quantum computer ready for defence applications by 2030-2033, the same horizon IonQ targets in trapped-ion and PsiQuantum in photonic. PsiQuantum's photonic bet aims squarely at the fault-tolerant, large-scale machines that practical applications will ultimately require. The realistic near-term framing remains cautious, however; across the industry, commercial "quantum advantage" for real-world problems is still a work in progress, and useful chemistry, cryptography, and optimization workloads at scale remain a late-decade story. That speculative quality is reflected in their finances, since that gap is why these stocks trade like lottery tickets. Collectively, by advancing trapped-ion, superconducting, and photonic platforms in parallel, these startups ensure the field explores multiple routes rather than betting on a single technology — accelerating the broader push toward fault-tolerant quantum computing.

abstract design portraying quantum computing

Information Theory

OVERVIEW

MIT and Caltech are two of the most influential academic homes for quantum information theory, the discipline that studies how information behaves under the laws of quantum mechanics. Caltech is a prominent leader in quantum research, primarily through its Institute for Quantum Information and Matter (IQIM), which focuses on theoretical and experimental aspects of quantum information science, including quantum computation and quantum many-body physics. Within Caltech's computing department, faculty work on the theoretical aspects of quantum computing, including complexity theory, cryptography, algorithms, benchmarking, and error correction. MIT is equally central, renowned for its extensive contributions to quantum research, particularly through the MIT Center for Quantum Engineering and the Research Laboratory of Electronics, which advance quantum computing, communication, and sensing technologies. MIT's theory work, anchored in its Center for Theoretical Physics, investigates the deepest questions of the field, asking if a perfectly functioning quantum computer were built, which problems could it solve faster than conventional computers, and which problems do not admit any speedup, and what is the fundamental limitation in the computational power of our universe governed by quantum mechanics. Together, the two institutions have helped define quantum information science as a rigorous field bridging physics, computer science, and mathematics — exploring how information itself is, as MIT researchers put it, far richer than classical intuition suggests.

INFLUENCES

The development at both institutions traces to foundational figures and ideas. The intellectual origin runs through Caltech's own Richard Feynman; as Caltech recounts, quantum information theory owes its existence to ideas posed by Feynman, Nobel laureate and Caltech professor of physics, two decades earlier. A pivotal influence at Caltech was John Preskill, who switched his focus to quantum information theory by the mid-1990s, a career change that eventually led to the creation of the Institute for Quantum Information and Matter. The catalyst was Shor's algorithm; Preskill recalled realizing "there was a big difference between what problems we'd be able to solve and which ones we'd never be able to solve with computing technology because it's a quantum world instead of a classical one." Caltech's faculty include other founders, notably Alexei Kitaev, one of the founders of the field of quantum information science, known for topological quantum computation. At MIT, the influences are equally weighty: Peter Shor is now an MIT professor, and the broader QIS group includes Soonwon Choi and Aram Harrow, Isaac Chuang, Seth Lloyd, Anand Natarajan, and emeritus faculty Eddie Farhi and Jeffrey Goldstone. The notion of a quantum computer itself was first introduced by Caltech Professor and MIT alumnus Richard Feynman.

IMPACT

The impact of MIT and Caltech on quantum information theory has been field-defining and continues to shape the discipline's frontiers. MIT's work was central to launching the field; in 1994, CSAIL member Peter Shor showed that quantum computers, if built, would be able to break most of the cryptographic codes used in modern electronic commerce — a result that played a central role in launching quantum computing and information as a field of study. MIT theorists have produced landmark algorithmic results, including the quantum adiabatic algorithm and quantum walk algorithms, and the first example of a problem for which quantum computers exhibit no speedup. The field has expanded well beyond computation, since the idea of using quantum mechanics to process information has grown from computation and communication to encompass diverse topics such as sensing and simulations in biology and chemistry. Caltech's reach extends into both theory and commercialization; its researchers pursue quantum error correction and quantum algorithms, among others, and integrating quantum system hardware, while it partners with Amazon Web Services to bridge fundamental research and commercial applications. Caltech faculty also advance core theory, with Fernando Brandao designing faster quantum algorithms for linear algebra and optimization, and Urmila Mahadev establishing landmark results on the classical verification of quantum computation. Notably, IQIM's John Preskill coined the term "quantum supremacy" itself.

Quantum Experience

OVERVIEW

IBM has been a foundational force in quantum computing, and its most democratizing contribution was the IBM Quantum Experience. As the company recounts, on 4 May 2016, IBM put the first quantum computer on the cloud — a seminal moment in computing history. The platform was a cloud-based quantum computing platform that allowed users to run algorithms and experiments on IBM's quantum processor, initially offering access to a five-qubit machine. Its significance was radical accessibility; before 2016, quantum computers were largely confined to specialized labs, and the launch meant that for the first time, quantum computers were no longer reserved solely for institutions with deep resources — they became accessible to students, startups, researchers, and developers across the globe. As one IBM leader put it, "the concept of putting a quantum computer on the cloud in 2016 was an absolute stroke of brilliance because it enabled everything that's happened since then. It said: we want everyone to have access to a quantum computer." The move established the foundations of today's quantum computing ecosystem and is now widely viewed as a turning point that expanded access, accelerated development, and shifted quantum computing from a research discipline toward an early-stage industry.

INFLUENCES

IBM's quantum work built on decades of prior research and the efforts of key individuals. The company's quantum journey reaches back to foundational algorithm demonstrations; in implementing Shor's algorithm, the IBM team used a rudimentary quantum computer composed of nuclear magnetic resonance to factor the number 15 — a small step, but a significant milestone, and IBM's next breakthrough came in 2000 when they demonstrated quantum error correction for the first time. The Quantum Experience itself emerged from a practical bottleneck: IBM's small quantum team was strained by requests to run experiments, so team leads Jay Gambetta and Jerry Chow decided to put a quantum processor on the cloud, having noticed members were already remotely accessing devices on nights and weekends. Crucial technical groundwork came from software pioneers, as a development team worked closely with Andrew Cross and Lev Bishop, who were developing the OpenQASM quantum assembly language to convert the notation used by theorists into the language of quantum computers. IBM rapidly built an ecosystem around the hardware; in 2017, IBM released Qiskit, the first quantum software development kit, followed in 2018 by the establishment of the IBM Quantum Network, the first commercial ecosystem for quantum computing. The broader field owed its conceptual debts to Feynman, Deutsch, and Shor.

IMPACT

IBM's contributions have had enormous and lasting impact, both technical and human. The hardware has advanced dramatically; IBM's first cloud processor had five qubits, and the company has since surpassed its early projection of 100 qubits by 2026, with the Heron r3 processor reaching 156 qubits and demonstrating lower error rates, while also reporting experimental chips with more than 1,100 qubits. A landmark came in 2023 with the first demonstration of quantum utility — executing a quantum circuit beyond exact classical simulation. Scientific applications have included molecular simulation, as IBM presented in 2017 the first experimental demonstration of a quantum computer simulating a molecule larger than hydrogen or helium — lithium hydride — using a six-qubit device. The platform's reach is vast, now hosting 240,000 users after 10 years of access. Yet challenges persist, since error rates remain a central challenge; quantum computations are sensitive to noise, and reducing errors is essential for scaling systems to solve practical problems. Perhaps the deepest impact is generational, as IBM notes that the early users of cloud-accessible quantum computers are now the developers, founders, and partners shaping the field's future.

Sycamore Processor

OVERVIEW

Google has been a leading force in quantum hardware, and its defining contribution was the Sycamore processor and the "quantum supremacy" milestone it achieved. Google made headlines in 2019 by achieving quantum supremacy — using its 53-qubit Sycamore processor to perform in about 200 seconds a task that was estimated to require 10,000 years on a top supercomputer. The chip's design reflected the dominant hardware approach; the Sycamore chip is made up of 53 quantum bits, or qubits, and uses superconducting technology, which allows it to perform quantum computations at extremely low temperatures. The specific task was random circuit sampling, and the demonstration marked a milestone in computing and signaled Google's emergence as a leader in quantum hardware. It is important to note, however, that the claim has been genuinely contested: critics argued Google's methodology was questionable, and since then, supercomputers have caught up, leaving Sycamore behind. Despite its high error rate, Sycamore's performance demonstrated the immense potential of quantum computing, and the achievement not only validated the feasibility of quantum computing but laid the groundwork for future research and applications. Building on it, Google set an ambitious goal announced by CEO Sundar Pichai in 2021: to build a "useful, error-corrected quantum computer" by 2029.

INFLUENCES

Sycamore emerged from a steady progression of Google quantum processors and the recruitment of key talent. The company's hardware lineage is well documented; from Bristlecone (2018) to Sycamore (2019) and Sycamore 2 (2021), Google has continuously refined its quantum processors, with even earlier work on the Foxtail chip in 2017. The immediate predecessor was instructive: in March 2018, Google introduced Bristlecone, a 72-qubit quantum processor designed to test and refine error rates; while it did not achieve quantum supremacy, it provided invaluable insights into qubit coherence and error rates, setting the stage for future advancements. A decisive human influence was John Martinis, who led the superconducting-qubit hardware team Google recruited from UC Santa Barbara in 2014 and who oversaw the Sycamore supremacy demonstration. The broader effort has been led by Hartmut Neven, founder and lead of Google Quantum AI. The work also rests on the field's deeper foundations — the superconducting transmon qubit pioneered by Devoret and Schoelkopf, and the theoretical groundwork laid by Feynman and Deutsch. After Sycamore, this trajectory continued into the 105-qubit Willow chip, which has twice as many qubits as Sycamore and improves T1 coherence time from Sycamore's 20 microseconds to 100 microseconds.

IMPACT

Google's impact has been to push the field toward genuine quantum advantage and, increasingly, toward error-corrected, practical machines. Sycamore's lasting significance is historical; the 2019 result heralded a new era in computing and accelerated worldwide interest and investment. Its successor now carries the practical ambition forward, since unlike earlier devices limited to proof-of-concept experiments, Willow is designed to enable the next step toward practical, fault-tolerant computation by demonstrating below-threshold error correction — a crucial advance, as the system showed exponential suppression of logical error rates as code distance increases, confirming below-threshold operation. Willow has effectively eclipsed Sycamore in raw benchmarking, performing a random circuit sampling benchmark in under 5 minutes — a computation Google estimated would take the largest classical supercomputer ten septillion years to simulate. Google's leadership envisions broad applications; Hartmut Neven told the BBC that Willow would be used in practical applications, and expressed the belief that advanced artificial intelligence will benefit from quantum computing. Some of Neven's claims, including that Willow's success lends credence to the notion that quantum computation occurs in many parallel universes, prompted controversy — though even skeptics agree Google's experimental results are solid, testable, and reproducible. From validating quantum supremacy to advancing error correction, Google has helped move quantum computing toward real-world utility.