The Computational Revolution Begins | 计算革命的序幕

The Computational Revolution Begins | 计算革命的序幕

The Fundamental Question: Why Quantum Computing?

Consider this: every time you send a message on your phone, perform a financial transaction online, or simulate a new drug molecule in a computer, you are relying on a computational system that was fundamentally designed in the 1930s and 1940s. The transistors that power these devices—billions of them on a single chip—operate according to principles that Alan Turing, John von Neumann, and their contemporaries formalized decades before the first silicon integrated circuit was ever fabricated. These classical computers have served humanity extraordinarily well. They have taken us to the moon, connected the world through the internet, and enabled artificial intelligence systems that can recognize faces, translate languages, and compose music. Yet despite this remarkable progress, classical computers face a wall—a fundamental limit that no amount of engineering cleverness or investment can overcome without a paradigm shift.

This chapter confronts a deceptively simple question: Why do we need quantum computers when classical computers seem so powerful? The answer requires us to understand what computation actually is, why the exponential growth of classical computing power cannot continue indefinitely, and where the boundaries of classical information processing lie. We will explore the physics that underlies all computation, examine the approaching limits of transistor miniaturization, analyze why certain problems remain intractable even for the world's most powerful supercomputers, and preview how quantum mechanics offers a fundamentally different approach to information processing. By the end of this chapter, you will not only understand why quantum computing represents a revolution rather than merely an incremental improvement, but you will also be equipped to articulate precisely where and why quantum advantage emerges.

让我们先从一个看似简单的问题入手：为什么当经典计算机已经如此强大时，我们还需要量子计算机？答案要求我们理解什么是真正的计算，为什么经典计算能力的指数增长无法无限延续，以及经典信息处理的边界在哪里。

Computation as Physics: The Foundation Beneath the Machine

Understanding Computation as a Physical Process | 将计算理解为物理过程

The first insight we need to appreciate is that computation is not an abstract mathematical operation performed in some Platonic realm—it is a physical process governed by the laws of physics. When a classical computer adds two numbers, what actually happens is that physical systems (electrons flowing through transistors) change their states in response to electrical signals. The abstract logical operation we call "addition" is implemented through the physical dynamics of billions of electrons moving through semiconductor material.

This seemingly obvious observation has profound implications. The philosopher of science David Deutsch articulated this most clearly in his 1985 paper that laid the foundation for quantum computing theory: computation is a physical process, and therefore the laws of physics constrain what can be computed. If the laws of physics allow certain processes to occur, then in principle we could build a computer that harnesses those processes for computation. Conversely, if the laws of physics prohibit certain processes, no amount of clever engineering can create a classical computer that performs those processes efficiently.

To understand this concretely, consider what happens inside a classical computer when it performs a simple operation like checking whether a number is prime. At the physical level, this involves:

1. Representing the number in binary form using electrical charges stored in capacitors (bits) 2. Moving these charges through transistor circuits that implement logical operations 3. Dissipating energy as heat with each transistor switching

The Landauer limit, formulated by physicist Rolf Landauer in 1961, establishes a fundamental connection between information processing and thermodynamics. Landauer demonstrated that erasing one bit of information dissipates a minimum amount of energy as heat: $E \geq k_B T \ln 2$, where $k_B$ is Boltzmann's constant and $T$ is temperature. At room temperature (approximately 300K), this amounts to roughly $2.9 \times 10^{-21}$ joules per bit erased—a minuscule amount, but a fundamental lower bound.

现代计算机科学创始人之一David Deutsch在1985年的论文中最为清晰地阐述了这一观点：计算是一个物理过程，因此物理定律约束着什么是可计算的。如果物理定律允许某些过程发生，那么原则上我们可以构建一台利用这些过程进行计算的计算机。

这意味着我们一直在使用错误的工具来完成某些任务。经典计算机是按照经典物理学的规则设计的——每个比特在任意时刻都是0或1，不存在叠加态。这种设计选择在我们只需要模拟经典物理系统时工作得很好，但当我们需要模拟量子力学系统（分子、原子和基本粒子的真实行为）时，我们面临着一个根本性的困难：用经典比特模拟量子系统需要指数级的资源。

The Classical Computing Paradigm | 经典计算范式

Classical computers, regardless of their physical implementation, share a common conceptual framework built on three fundamental principles:

1. Deterministic or Probabilistic State Representation: Each bit exists in exactly one state at any given time—either 0 or 1. This is not merely a practical limitation but a fundamental characteristic of classical physics. While we can use probabilistic bits (random number generators), each physical instance of a bit has a definite value.

2. Local Operations: Logic gates operate on one, two, or three bits at a time. The output of a gate depends only on its input bits, not on distant parts of the computer (this is the locality assumption, though in practice signals do propagate through the entire system).

3. Sequential or Parallel Classical Operations: While modern computers can perform operations in parallel across multiple cores, each individual operation remains fundamentally classical—manipulating definite 0s and 1s through deterministic or classically probabilistic transformations.

The power of classical computing comes from the enormous scale at which these simple operations are performed. A modern smartphone processor contains approximately 15-20 billion transistors, each capable of switching billions of times per second. Supercomputers can perform on the order of $10^{18}$ floating-point operations per second. Yet as we shall see, scale alone cannot overcome certain fundamental barriers.

经典计算机，无论其物理实现如何，都建立在三个基本原则之上的共同概念框架上：

1. 确定性或概率性状态表示：每个比特在任意给定时刻存在于确切的状态——0或1 2. 局部操作：逻辑门一次操作一个、两个或三个比特 3. 顺序或并行经典操作：虽然现代计算机可以在多个核心上并行执行操作，但每个单独的操作从根本上仍然是经典的

Moore's Law and the Approaching Physical Limits | 摩尔定律及逼近的物理极限

The Triumph of Miniaturization | 小型化的胜利

In 1965, Gordon Moore, co-founder of Intel, observed that the number of transistors on integrated circuits was doubling approximately every two years. This observation, later formalized as Moore's Law, became a self-fulfilling prophecy that drove five decades of continuous innovation in the semiconductor industry. The implications were staggering: if Moore's Law held, a computer that would cost millions of dollars and fill an entire room in 1970 could be miniaturized to fit in your pocket by 2020—and would be millions of times more powerful.

摩尔定律的神奇之处在于它不仅仅是关于计算能力的预测，更是关于经济学的预测。随着晶体管变小，每个晶体管的成本降低，而芯片上晶体管的数量增加。这种良性循环推动了整个行业的指数级投资。然而，摩尔定律描述的是工程进展，而不是物理学的基本限制。当我们接近这些物理限制时，指数级增长的时代将不可避免地结束。

摩尔定律在1965年至2020年间基本保持有效，但工程师们必须克服一系列越来越严峻的挑战。晶体管的缩小导致了泄漏电流的增加、短沟道效应，以及热管理的困难。

到2020年代，领先的半导体制造商正在生产5纳米及以下工艺节点的芯片。在这些尺度上，芯片上的关键特征尺寸与单个病毒的大小相当——小到连光线中的可见光波长都无法用于光刻工艺。工程师们已经转向使用极紫外光刻（EUV）技术，甚至正在探索新技术如全栅极晶体管（GAAFET）架构。

The Physical Walls Ahead | 前方的物理壁垒

Despite these innovations, several fundamental physical limits are approaching that cannot be overcome through engineering cleverness alone:

1. Quantum Tunneling: As transistor gates become thinner than about 5-7 nanometers, electrons can tunnel through the gate oxide barrier even when the transistor is supposed to be "off." This quantum mechanical effect causes current to leak, leading to exponentially higher power consumption and loss of the transistor's switching behavior. At 3 nanometers, tunneling becomes unavoidable with traditional silicon transistor designs.

2. Heat Dissipation: The Landauer limit we discussed ea