Quantum Computing Models: Principles Explained | 量子计算模型原理解析

📚 Quantum Computing Models: Principles Explained | 量子计算模型原理解析

Quantum computing represents a fundamental departure from classical computing, leveraging the principles of quantum mechanics to process information in ways that classical computers cannot. This article explores the core models and principles that define quantum computation, from qubits and superposition to quantum gates and algorithmic advantages.

量子计算是相对于经典计算的根本性变革，它利用量子力学的基本原理，以经典计算机无法实现的方式处理信息。本文将深入探讨定义量子计算的核心模型与原理，从量子比特与叠加态，到量子门与算法优势。

---

1. From Classical Bits to Qubits | 从经典比特到量子比特

A classical bit exists in one of two definite states: 0 or 1. In contrast, a quantum bit, or qubit, is a two-level quantum system that can exist in a state represented as |ψ⟩ = α|0⟩ + β|1⟩, where α and β are complex probability amplitudes satisfying |α|² + |β|² = 1. When measured, the qubit collapses to |0⟩ with probability |α|² or to |1⟩ with probability |β|².

经典比特只能处于两种确定状态之一：0 或 1。相比之下，量子比特（qubit）是一个双能级量子系统，其状态可表示为 |ψ⟩ = α|0⟩ + β|1⟩，其中 α 和 β 是满足 |α|² + |β|² = 1 的复数概率幅。当被测量时，量子比特会以 |α|² 的概率坍缩为 |0⟩，或以 |β|² 的概率坍缩为 |1⟩。

The key distinction is that before measurement, a qubit genuinely holds both states simultaneously. This is not a probabilistic mixture in the classical sense but a coherent quantum superposition. The Bloch sphere provides a geometric visualisation: the state of a single qubit corresponds to a point on the surface of a unit sphere, with the north and south poles representing |0⟩ and |1⟩ respectively.

关键区别在于，测量之前量子比特确实同时持有两种状态。这并非经典意义上的概率混合，而是一种相干的量子叠加。布洛赫球（Bloch sphere）提供了一种几何可视化：单个量子比特的状态对应于单位球面上的一个点，北极和南极分别代表 |0⟩ 和 |1⟩。

---

2. Superposition: The Power of ‘Both’ | 叠加态：”同时存在”的力量

Superposition is the principle that a quantum system can exist in multiple states at once. For a single qubit, this means being partly |0⟩ and partly |1⟩ simultaneously. For a system of n qubits, the state space expands dramatically: a register of n qubits can represent a superposition of all 2ⁿ basis states at the same time.

叠加态是指量子系统可以同时存在于多个状态的原理。对于单个量子比特而言，这意味着同时部分处于 |0⟩ 和部分处于 |1⟩。对于由 n 个量子比特组成的系统，状态空间急剧扩展：n 个量子比特的寄存器可以同时表示所有 2ⁿ 个基态的叠加。

|ψ⟩ = Σₓ cₓ |x⟩, where x ranges over all 2ⁿ binary strings

This exponential growth is the source of quantum parallelism. By applying a single quantum operation to the entire register, a quantum computer can act on all 2ⁿ states simultaneously. However, this parallelism is not directly accessible: measurement collapses the superposition and yields only one outcome, with probabilities given by the squared magnitudes of the amplitudes.

这种指数级增长正是量子并行性的来源。通过对整个寄存器施加一次量子操作，量子计算机可以同时作用于所有 2ⁿ 个状态。然而，这种并行性无法直接获取：测量会使叠加态坍缩并只产生一个结果，其概率由振幅的模平方决定。

---

3. Entanglement: Non-Local Correlation | 纠缠：非局域关联

Entanglement is a uniquely quantum phenomenon in which two or more qubits become correlated in such a way that the state of one qubit cannot be described independently of the others. For example, the Bell state (|00⟩ + |11⟩)/√2 describes two qubits that, when measured, always yield identical outcomes — yet neither qubit has a definite state before measurement.

纠缠是一种独特的量子现象，两个或多个量子比特以某种方式相互关联，使得一个量子比特的状态不能独立于其他量子比特来描述。例如，贝尔态 (|00⟩ + |11⟩)/√2 描述了两个量子比特，测量时它们总是产生相同的结果——然而在测量之前，每个量子比特都没有确定的状态。

The mathematical condition for entanglement is that the joint state cannot be written as a tensor product of individual states: |ψ⟩ ≠ |φ₁⟩ ⊗ |φ₂⟩. Entanglement enables protocols such as quantum teleportation and superdense coding. It also underpins the computational power of certain quantum algorithms, as it creates correlations that have no classical counterpart.

纠缠的数学条件在于，联合状态不能写成各个独立状态的张量积：|ψ⟩ ≠ |φ₁⟩ ⊗ |φ₂⟩。纠缠使量子隐形传态和超密编码等协议成为可能。它还支撑着某些量子算法的计算能力，因为它创造了经典世界没有对应物的关联。

---

4. The Circuit Model of Quantum Computation | 量子计算的线路模型

The quantum circuit model is the most widely used framework for quantum computation. It extends the classical circuit model by replacing logic gates with unitary quantum gates. A computation proceeds from an initial state (typically all |0⟩), through a sequence of quantum gates applied to selected qubits, to a final measurement.

量子线路模型是量子计算中使用最广泛的框架。它通过将逻辑门替换为酉量子门来扩展经典线路模型。计算从初始状态（通常是全 |0⟩）开始，经过一系列作用于选定量子比特的量子门，最后进行测量。

Key properties of quantum gates:

量子门的关键性质：

• Unitarity: Every quantum gate must be unitary, satisfying U†U = I, which guarantees that probabilities are preserved. Consequently, quantum circuits are reversible — information is never destroyed.
• 酉性：每个量子门必须是酉的，满足 U†U = I，这保证了概率守恒。因此，量子线路是可逆的——信息永远不会被销毁。
• Completeness: A universal set of gates (such as H, S, T, and CNOT) can approximate any unitary operation to arbitrary precision. This is analogous to how NAND alone suffices for classical computation.
• 完备性：一组通用门（如 H、S、T 和 CNOT）可以任意精度近似任何酉操作。这类似于经典计算中仅用 NAND 门即可实现一切逻辑。

H: |0⟩ → (|0⟩ + |1⟩)/√2, CNOT: |a,b⟩ → |a, a ⊕ b⟩

The Hadamard gate creates superposition, while the CNOT gate entangles two qubits. Together, these gates allow the construction of arbitrary quantum circuits. A key difference from classical circuits is that measurement is not a gate but a non-unitary, irreversible process that terminates the quantum evolution.

Hadamard 门用于创建叠加态，而 CNOT 门用于纠缠两个量子比特。两者结合可以构造任意量子线路。与经典线路的关键区别在于，测量不是门操作，而是一个非酉的、不可逆的过程，它终止了量子演化。

---

5. The Quantum Turing Machine and Other Models | 量子图灵机与其他模型

Just as the Turing machine provides a formal model for classical computation, the quantum Turing machine (QTM), introduced by David Deutsch in 1985, formalises quantum computation. In a QTM, the transition function maps a classical state and symbol to a superposition of possible (state, symbol, head-movement) triples, with complex amplitudes instead of deterministic outcomes.

正如图灵机为经典计算提供了形式化模型，量子图灵机（QTM）由大卫·多伊奇于 1985 年提出，为量子计算提供了形式化描述。在 QTM 中，转移函数将经典状态和符号映射到可能的（状态、符号、磁头移动）三元组的叠加，用复数振幅代替确定性结果。

Alternative but equivalent models include:

其他等价模型包括：

• Adiabatic quantum computing: Based on the adiabatic theorem — a system slowly evolved from a known ground state to a final Hamiltonian encodes the problem; the system remains in its ground state, and the solution is read out at the end.
• 绝热量子计算：基于绝热定理——系统从已知基态缓慢演化到编码问题的最终哈密顿量；系统始终处于基态，最终读取得到问题的解。
• Measurement-based quantum computing: Also called one-way quantum computing, it begins with a highly entangled cluster state and performs only single-qubit measurements; the sequence of measurements determines the computation.
• 基于测量的量子计算：又称单向量子计算，它从高度纠缠的簇态开始，仅执行单量子比特测量；测量序列决定计算过程。
• Topological quantum computing: Encodes information in quasiparticles called anyons, whose braiding operations implement quantum gates; this approach offers inherent error resistance.
• 拓扑量子计算：将信息编码在称为任意子的准粒子中，其编织操作实现量子门；这种方法具有天然的容错能力。

All of these models are computationally equivalent to the circuit model, meaning any problem solvable in one model can be solved in any other with at most polynomial overhead. This mirrors the Church-Turing thesis for classical computing.

所有这些模型在计算能力上与线路模型等价，即任何一个模型中可解决的问题都可以在另一个模型中求解，且开销最多为多项式级。这对应于经典计算中的丘奇-图灵论题。

---

6. Quantum Measurement and the No-Cloning Theorem | 量子测量与不可克隆定理

Measurement in quantum mechanics is fundamentally different from classical observation. A measurement of a qubit in the computational basis {|0⟩, |1⟩} is described by projection operators P₀ = |0⟩⟨0| and P₁ = |1⟩⟨1|. The measurement outcome is probabilistic, and the act of measurement irreversibly alters the quantum state.

量子力学中的测量与经典观测有本质的不同。在计算基 {|0⟩, |1⟩} 下测量量子比特时，用投影算子 P₀ = |0⟩⟨0| 和 P₁ = |1⟩⟨1| 描述。测量结果是概率性的，而且测量行为本身不可逆地改变了量子态。

A direct consequence of the linearity of quantum mechanics is the no-cloning theorem: it is impossible to create an identical copy of an arbitrary unknown quantum state. The proof is straightforward — a hypothetical cloning unitary U satisfying U|ψ⟩|0⟩ = |ψ⟩|ψ⟩ for all |ψ⟩ would contradict linearity when applied to a superposition.

量子力学线性性的一个直接推论是不可克隆定理：无法创建任意未知量子态的完全相同副本。证明很简单——假设存在一个克隆酉算子 U，使得对所有 |ψ⟩ 都有 U|ψ⟩|0⟩ = |ψ⟩|ψ⟩，那么将其作用于叠加态时会与线性性矛盾。

This theorem has profound implications: quantum information cannot be copied or broadcast, which is why quantum error correction requires sophisticated techniques such as redundancy across entangled states. It also ensures the security of quantum key distribution — eavesdropping necessarily disturbs the transmitted qubits.

这一定理具有深远的影响：量子信息不能被复制或广播，这就是为什么量子纠错需要复杂的冗余编码技术。它同时保证了量子密钥分发的安全性——窃听必然干扰传输中的量子比特。

---

7. Key Quantum Algorithms | 关键量子算法

Quantum algorithms exploit superposition and entanglement to achieve speedups over classical algorithms. Two of the most famous examples demonstrate different types of advantage.

量子算法利用叠加和纠缠来获得相对于经典算法的加速。两个最著名的例子展示了不同类型的优势。

Shor’s algorithm factors large integers in polynomial time, whereas the best known classical algorithms require exponential time. It works by reducing factoring to the problem of finding the period of a modular exponential function, which is solved efficiently using the quantum Fourier transform. This breaks RSA encryption, which relies on the hardness of factoring.

Shor 算法能够在多项式时间内分解大整数，而最好的经典算法需要指数时间。它的工作原理是将质因数分解转化为寻找模指数函数周期的问题，并利用量子傅里叶变换高效求解。这直接威胁到依赖分解难度的 RSA 加密体系。

Grover’s algorithm searches an unsorted database of N items in only O(√N) queries, compared to O(N) for classical search. It achieves this through amplitude amplification: iteratively rotating the state vector towards the target solution. Although the speedup is only quadratic, it is proven optimal, meaning no quantum algorithm can do better.

Grover 算法在包含 N 个项的无序数据库中搜索只需 O(√N) 次查询，而经典搜索需要 O(N) 次。它通过振幅放大实现：迭代地将状态向量旋转向目标解。虽然加速只是二次级别的，但已被证明是最优的，即没有任何量子算法可以做得更好。

---

8. Quantum Error Correction | 量子纠错

Qubits are fragile: decoherence from environmental interactions rapidly degrades quantum states. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit into many physical qubits. The surface code, for example, arranges qubits on a 2D lattice and measures stabiliser operators to detect errors without disturbing the encoded information.

量子比特十分脆弱：与环境相互作用导致的退相干会迅速破坏量子态。量子纠错（QEC）通过将一个逻辑量子比特编码到多个物理量子比特中来应对这一挑战。例如，表面码将量子比特排列在二维晶格上，通过测量稳定子算子来检测错误，而不会干扰所编码的信息。

The key insight of QEC is that errors are discretised by measurement — an unknown continuous error can be projected onto a finite set of Pauli errors (X, Z, or both) by syndrome measurement. Because quantum gates cannot clone states, QEC encodes information redundantly across entangled qubit blocks, enabling the correction of any single-qubit error.

量子纠错的关键洞见在于，测量使错误离散化——未知的连续误差可以通过综合征测量投影到有限的泡利错误集（X、Z 或两者兼有）上。由于量子门不能克隆状态，QEC 利用纠缠量子比特块之间的冗余编码来实现对任意单量子比特错误的纠正。

For a fault-tolerant quantum computer, the error rate per gate must be below a threshold (approximately 10⁻⁴ to 10⁻² depending on the code). Below this threshold, increasing the number of physical qubits exponentially suppresses the logical error rate — the foundation of the roadmap towards large-scale quantum computers.

对于容错量子计算机，每个门的错误率必须低于一个阈值（约为 10⁻⁴ 到 10⁻²，具体取决于编码方案）。低于该阈值时，增加物理量子比特的数量可以指数级地抑制逻辑错误率——这是通往大规模量子计算机路线图的基础。

---

9. Complexity Theory for Quantum Computing | 量子计算的复杂性理论

Quantum complexity theory classifies problems based on resource requirements on a quantum computer. The central class is BQP (Bounded-error Quantum Polynomial time), which contains all decision problems solvable by a quantum computer in polynomial time with error probability at most 1/3 on every input.

量子复杂性理论根据量子计算机上的资源需求对问题进行归类。核心复杂性类为 BQP（有界误差量子多项式时间），包含所有量子计算机在多项式时间内可解、且每个输入上的错误概率不超过 1/3 的判定问题。

P ⊆ NP ⊆ PSPACE, BQP ⊆ PSPACE, and it is unknown whether NP ⊆ BQP

It is known that P ⊆ BQP, reflecting that quantum computers can simulate classical computation efficiently. Whether BQP contains NP — that is, whether quantum computers can solve NP-complete problems efficiently — remains an open question. Evidence suggests not, since Grover’s algorithm achieves only a quadratic speedup for unstructured search.

已知 P ⊆ BQP，这反映了量子计算机可以高效模拟经典计算。是否 BQP 包含 NP——即量子计算机能否高效求解 NP 完全问题——仍然是一个开放问题。证据表明不能，因为 Grover 算法对无结构搜索仅实现了平方级加速。

---

10. Physical Implementations of Qubits | 量子比特的物理实现

Several physical platforms are being pursued for building quantum computers, each with distinct trade-offs between coherence time, gate fidelity, and scalability.

目前有几种物理平台用于构建量子计算机，每种平台在相干时间、门保真度和可扩展性之间各有不同的权衡。

Platform | 平台	Qubit Type | 量子比特类型	Strength | 优势	Challenge | 挑战
Superconducting | 超导	Josephson junction | 约瑟夫森结	Fast gates, scalable fabrication | 门速度快，可规模化制造	Short coherence times | 相干时间短
Trapped ions | 离子阱	Atomic ion energy levels | 原子离子能级	Very long coherence | 相干时间极长	Slow gate operations | 门操作速度慢
Photonic | 光子	Photon polarisation/path | 光子偏振/路径	Low decoherence | 退相干低	Difficulty of two-qubit gates | 双量子比特门实现难
Semiconductor spin | 半导体自旋	Electron/nuclear spin | 电子/核自旋	Small size, compatible with silicon | 尺寸小，与硅工艺兼容	Homogeneity and control | 均匀性与控制难度

Each platform requires ultra-low temperatures (typically millikelvin) or ultra-high vacuum to isolate qubits from environmental noise, and all approaches face the fundamental challenge of scaling beyond a few hundred qubits while maintaining error rates below the fault-tolerance threshold.

每种平台都需要超低温（通常为毫开尔文级）或超高真空来隔离环境噪声，所有方案都面临从几百个量子比特规模化扩展的根本挑战，同时还要将错误率保持在容错阈值以下。

---

11. Applications and Practical Limits | 应用与实际限制

Quantum computing is not expected to replace classical computers. Instead, it offers a specialised advantage for specific problem structures — those involving integer factorisation, unstructured search, quantum simulation, and certain optimisation tasks.

量子计算并不会取代经典计算机。相反，它为特定问题结构提供了专门的优势——包括整数分解、无结构搜索、量子模拟以及某些优化任务。

• Quantum chemistry and materials science: Simulating molecular Hamiltonians exactly is intractable classically but natural for qubits.
• 量子化学与材料科学：精确模拟分子哈密顿量在经典上不可行，但对量子比特而言是自然擅长的。
• Cryptography: Shor’s algorithm threatens RSA and ECC, motivating the development of post-quantum cryptography.
• 密码学：Shor 算法威胁 RSA 和 ECC，催生了后量子密码学的发展。
• Optimisation: Quantum algorithms such as QAOA may offer heuristics for combinatorial optimisation, though provable speedups remain uncertain.
• 优化问题：QAOA 等量子算法可能为组合优化提供启发式方案，但可证明的加速仍然不确定。

The current era of noisy intermediate-scale quantum (NISQ) devices has demonstrated quantum advantage for specific contrived problems, but real-world applications require fault-tolerant quantum computers with millions of physical qubits — a goal that remains actively pursued but not yet achieved.

当前含噪声中等规模量子（NISQ）时代已经在特定构造的问题上展示了量子优势，但实际应用需要数百万物理量子比特的容错量子计算机——这一目标仍在积极追求中，尚未实现。

---

12. Conclusion and Examination Focus | 总结与考点聚焦

For examination purposes, candidates should understand the fundamental distinctions between classical and quantum information, the mathematical representation of qubits and gates, the significance of superposition and entanglement, and the reasons why quantum computers can solve certain problems faster. The following points are frequently assessed:

应试角度而言，考生需要理解经典信息与量子信息的根本区别、量子比特与量子门的数学表示、叠加与纠缠的意义，以及量子计算机为何能在某些问题上更快。以下为高频考点：

• The qubit state |ψ⟩ = α|0⟩ + β|1⟩ with the normalisation condition |α|² + |β|² = 1.
• 量子比特状态 |ψ⟩ = α|0⟩ + β|1⟩ 及归一化条件 |α|² + |β|² = 1。
• The Bloch sphere representation and the geometric meaning of superposition.
• 布洛赫球表示及叠加态的几何意义。
• The unitarity condition U†U = I and its implication of reversibility.
• 酉条件 U†U = I 及其可逆性含义。
• The no-cloning theorem and its role in quantum cryptography.
• 不可克隆定理及其在量子密码学中的作用。
• Shor’s and Grover’s algorithms — what they achieve and their complexity classes.
• Shor 算法与 Grover 算法——各自解决的问题及复杂度类。
• The difference between the circuit model, adiabatic model, and other computational models.
• 线路模型、绝热模型及其他计算模型之间的区别。

Mastery of these principles provides not only exam readiness but also a foundation for understanding the rapid developments in this transformative field. Quantum computing is no longer purely theoretical — it is an engineering reality with ongoing breakthroughs in error correction, hardware, and algorithms.

掌握这些原理不仅有助于备考，也为理解这一革命性领域的快速发展奠定了基础。量子计算已不再是纯粹的理论——这是一个正在纠错、硬件和算法方面持续取得突破的工程现实。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）