表面码（surface code）为何成为纠错主流方案？
Why has the surface code become the leading error-correction scheme?
表面码把逻辑比特铺在二维方格的多个物理比特上，错误以局部“任意子”激发形式出现，只需近邻测量即可诊断，阈值约 1% 且工程上较易布线。
The surface code spreads a logical qubit over a 2D lattice; errors show as local anyon excitations diagnosed by neighbor measurements, with a ~1% threshold and practical wiring, making it the leading scheme.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-11-03
来源 · Source
Kitaev，《基于任意子的容错量子计算》，Annals of Physics 303 (2003)
Kitaev, 'Fault-tolerant quantum computation by anyons', Annals of Physics 303 (2003)
独立核验依据 · Independent verification: 核验依据 1 ARCHIVE 标识 arxiv-quant-ph9707021：Fault-tolerant quantum
#表面码 #任意子 #纠错阈值
量子退火和门模型量子计算本质区别在哪？
What is the essential difference between quantum annealing and gate-model computing?
门模型用可控的逻辑门序列构造算法（如 Shor、Grover）；量子退火把问题编码成能量地形，让系统从高温基态慢慢“滑”到最低能量解，适合组合优化而非通用计算。
Gate models run algorithms via controlled logic gates (Shor, Grover); quantum annealing encodes a problem as an energy landscape and lets the system relax to the minimum, suiting optimization rather than universal computing.
难度 专业 · 适合 初中(12-15)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang，《量子计算与量子信息》
Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子退火 #门模型 #优化
退相干时间 T1 与 T2 为何是量子计算机实用化的“命门”？
Why are decoherence times T1 and T2 the crux of practical quantum computing?
T1 是能量弛豫（0 变 1）、T2 是相位相干丢失的时间；运算必须在远小于 T2 内完成并纠错，否则信息蒸发。材料缺陷、热噪声与电磁干扰都在压缩这两个时间。
T1 is energy relaxation and T2 is dephasing time; computations must finish and be corrected well within T2 or information evaporates. Defects, heat and noise all shrink these times—the crux of practical qubits.
难度 专业 · 适合 小学高段(9-12)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang，《量子计算与量子信息》
Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#T1 #T2 #退相干
Grover 搜索为何是“平方加速”而非指数加速？
Why is Grover search a square-root speedup, not exponential?
经典搜索无序列表要试约 N 次，Grover 算法用量子振幅放大约根号 N 次就能找到目标，是平方根级加速，适合查找但非指数飞跃。
A classical search needs about N tries; Grover's algorithm uses amplitude amplification to find the target in about sqrt(N) steps—a quadratic speedup useful for search but not exponential.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-11-03
来源 · Source
Grover，《数据库的量子力学快速算法》，Physical Review Letters 79 (1997)
Grover, 'A Fast Quantum Mechanical Algorithm for Database Search', Physical Review Letters 79 (1997)
独立核验依据 · Independent verification: 核验依据 1 ARCHIVE 标识 arxiv-quant-ph9605043：A fast quantum mechanic
#Grover #振幅放大 #搜索
量子隐形传态能瞬间把人送走吗？
Can quantum teleportation send a person instantly?
不能。它只传送量子态的信息，且必须配合一条经典信道和一份预先共享的纠缠；原物会被销毁，速度也不超光速。
No. It transfers a quantum state using pre-shared entanglement plus a classical channel; the original is destroyed and nothing travels faster than light.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-11-02
来源 · Source
Bennett 等，《遥传未知的量子态》，Physical Review Letters 70 (1993)
Bennett et al., 'Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels', Physical Review Letters 70 (1993)
独立核验依据 · Independent verification: 核验依据 1 CROSSREF 标识 10.1103/physrevlett.70.1895：Teleporting an u
#隐形传态 #纠缠 #量子信息
为什么量子计算机容易出错，又要做“纠错”？
Why are quantum computers error-prone and need error correction?
量子比特极易被环境扰动（退相干），单个比特出错率高。量子纠错用多个物理比特编码一个逻辑比特，靠冗余和测量来发现并纠正错误。
Qubits decohere easily, so single-bit error rates are high. Quantum error correction encodes one logical qubit in many physical ones, using redundancy and measurement to detect and fix faults.
难度 进阶 · 适合 小学高段(9-12)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang，《量子计算与量子信息》
Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子纠错 #退相干 #逻辑比特
量子计算机能取代家里的电脑吗？
Can a quantum computer replace the computer at home?
暂时不能。它只在特定难题（如大数分解、模拟分子）上快，普通上网打字还是经典电脑更合适。
Not yet. It only wins on special hard tasks like factoring or molecule simulation; everyday typing is still better on classical PCs.
难度 入门 · 适合 小学低段(6-8)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang，《量子计算与量子信息》
Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子计算 #应用 #局限
量子计算机和家里的电脑有什么不一样？
How is a quantum computer different from the computer at home?
普通电脑用 0 或 1 的小开关；量子计算机用“量子比特”，能同时是 0 和 1 的叠加，像一次尝试很多种可能。
Normal computers use bits that are 0 or 1; a quantum computer uses qubits that can be both at once, exploring many possibilities in parallel.
难度 入门 · 适合 幼儿(3-6)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang，《量子计算与量子信息》
Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子计算 #量子比特 #叠加