量子比特相比普通比特有什么独特之处，又带来什么算力可能？
What is unique about a qubit versus a classical bit, and what computing possibility does it open?
普通比特非 0 即 1，而量子比特可处于 0 和 1 的叠加态，多个比特还能纠缠，使特定算法能并行探索指数级状态空间。Feynman 在 1982 年提出量子计算思想，Nielsen 与 Chuang 的教材系统化了其理论。
A classical bit is 0 or 1, but a qubit can be in a superposition of both, and multiple qubits can entangle, letting certain algorithms explore an exponential state space in parallel. Feynman proposed quantum computing in 1982; Nielsen and Chuang systematized the theory.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Feynman《量子力学计算机》(1982)；Nielsen 与 Chuang《量子计算与量子信息》
Feynman, 'Simulating physics with computers' (1982); Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子比特 #叠加 #纠缠 #量子计算
Grover 搜索算法的“二次加速”意味着什么？
What does the 'quadratic speedup' of Grover's search mean?
在未排序的 N 项里找目标，经典方法平均要试 N/2 次，而 Grover 只需约 √N 次。这不是指数级加速，但把“暴力搜索”的成本从线性降到平方根级，对部分搜索与破解对称密钥有实质影响。
Finding a target among N unsorted items takes about N/2 tries classically but only ~√N with Grover. Not exponential, but it drops brute-force cost from linear to square-root, mattering for some search and symmetric-key tasks.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#Grover #搜索
Shor 算法为什么能威胁 RSA 加密？
Why does Shor's algorithm threaten RSA encryption?
RSA 的安全建立在“大整数很难分解成质因数”上。Shor 算法利用量子傅里叶变换高效求周期，从而能快速分解大整数，一旦大型量子计算机成熟，现有 RSA 密钥将被轻易破解。
RSA's security rests on the hardness of factoring large integers. Shor's algorithm uses quantum Fourier transform to find periods efficiently, factoring big numbers fast—so a mature quantum computer could break RSA keys.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#Shor #量子
什么是秀尔算法？
What is Shor's algorithm?
秀尔算法是 1994 年提出的量子算法，能在多项式时间内分解大整数，而经典算法只能指数级耗时。若大规模量子计算机实现，它将威胁现行 RSA 等公钥密码体系。
Shor's algorithm, proposed in 1994, factors large integers in polynomial time, whereas classical algorithms need exponential time. If large-scale quantum computers are realized, it would threaten current public-key systems like RSA.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 来源待核验 · Source pending review
来源 · Source
出处备注：著录含书名，但缺版次 / 出版社 / 年份中的一部分，需编辑补全后才能做独立比对。
Peter Shor 1994 年论文《量子计算算法》
Peter Shor, Algorithms for quantum computation (1994)
#秀尔算法 #整数分解 #量子算法
量子比特和经典比特有什么不同？
What is the difference between a qubit and a classical bit?
经典比特只能是 0 或 1；量子比特借助叠加可同时处于 0 和 1 的线性组合状态，测量时按概率坍缩为确定值，因此 n 个量子比特能表示 2^n 种状态的叠加。
A classical bit is 0 or 1; a qubit can be in a superposition of both, collapsing to a definite value on measurement, so n qubits represent a superposition of 2^n states.
难度 专业 · 适合 大众
CC BY 4.0 · 来源待核验 · Source pending review
来源 · Source
出处备注：此条未指向带版次的可引用著作（通识性内容、机构文件或未展开的英文书名），本库不提供独立书目出处；如需精确引用，需由编辑补全具体篇目与版次。
Nielsen & Chuang
Nielsen & Chuang
#量子 #基础
量子比特（qubit）和经典比特最根本的区别是什么？
What is the most fundamental difference between a qubit and a classical bit?
经典比特非 0 即 1，而量子比特可以处于 0 和 1 的叠加态，并能与其他 qubit 纠缠。测量时才坍缩成确定值，正是叠加与纠缠带来了量子并行与加速的潜力。
A classical bit is 0 or 1, but a qubit can be in a superposition of 0 and 1 and entangle with others. Measurement collapses it to a definite value; superposition and entanglement enable quantum parallelism.
难度 进阶 · 适合 初中(12-15)
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Feynman《量子力学计算机》(1982)；Nielsen 与 Chuang《量子计算与量子信息》
Feynman, 'Simulating physics with computers' (1982); Nielsen & Chuang, 'Quantum Computation and Quantum Information'
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子比特 #叠加
不可克隆定理禁止复制未知量子态,那量子纠错为什么仍然可行?稳定子测量在其中扮演什么角色?
The no-cloning theorem forbids copying an unknown quantum state — so why is quantum error correction still possible, and what role do stabilizer measurements play?
纠错码把逻辑信息编码进多个物理比特的纠缠态,冗余来自纠缠而非复制,因此不与不可克隆定理冲突。稳定子测量只揭示错误综合征、不读取编码态的振幅,测量本身不会使逻辑信息坍缩;解码器据综合征选择相应的恢复操作。
Codes spread logical information across an entangled state of many physical qubits, so the redundancy comes from entanglement rather than duplication and never touches no-cloning. Stabilizer measurements reveal only the error syndrome and never the encoded amplitudes, so measuring them does not collapse the logical state, and the syndrome tells the decoder which recovery to apply.
难度 进阶 · 适合 初中(12-15)
CC BY 4.0 · 已核验 · Verified 2026-11-02
来源 · Source
W. K. Wootters 与 W. H. Zurek,《单个量子不可克隆》,Nature 299, 1982;Shor 的九比特码,Physical Review A 52, 1995
W. K. Wootters and W. H. Zurek, A Single Quantum Cannot Be Cloned, Nature 299, 1982; Shor's nine-qubit code, Physical Review A 52, 1995
独立核验依据 · Independent verification: 核验依据 1 CROSSREF 标识 10.1038/299802a0：A single quantum cannot be
#量子计算 #量子纠错
建造通用量子计算机的头号障碍常被归结为退相干,它在物理上到底指什么?
What does decoherence—the usual headline obstacle to building a quantum computer—actually mean physically?
量子计算依赖叠加态内部的相对相位,而量子比特无法与环境完全隔绝,杂散电磁场、材料缺陷乃至宇宙射线都在持续对它进行等效测量,使相位关系在微秒到毫秒尺度上随机化,叠加随之退化成经典概率混合。门操作必须赶在相干性耗尽前完成,这正是处理器要在接近绝对零度的稀释制冷机中运行的原因。表面码等纠错方案给出了工程出路:只要物理门错误率压到百分之一量级以下,用上千个物理比特编码一个逻辑比特就能任意延长相干时间。
Quantum algorithms depend on relative phases inside a superposition, but no qubit is perfectly isolated: stray fields, material defects, even cosmic rays continually measure it effectively, scrambling those phases within microseconds to milliseconds until the state decays into a classical mixture. Gates must outrun decoherence before coherence runs out, which is why processors operate at millikelvin temperatures inside dilution refrigerators. Error correction offers the engineering way out—surface codes show that once physical gate error drops below roughly one percent, encoding one logical qubit in thousands of physical ones extends coherence arbitrarily.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source
Nielsen 与 Chuang《Quantum Computation and Quantum Information》第 8 章(量子噪声与量子操作)
M. Nielsen & I. Chuang, "Quantum Computation and Quantum Information", Chapter 8 (Quantum Noise and Quantum Operations)
独立核验依据 · Independent verification: 核验依据 1 ISBN 9780521635035 (2016)
#量子比特 #退相干
量子计算机为何威胁现有公钥加密？
Why do quantum computers threaten current public-key encryption?
Shor 算法能在多项式时间内分解大整数和求离散对数，直接攻破 RSA 与椭圆曲线等经典公钥体系，因此催生了后量子密码学的研究与标准化。
Shor's algorithm factors integers and solves discrete logs in polynomial time, breaking RSA and ECC; this drives post-quantum cryptography research and standardization.
难度 入门 · 适合 大众
CC BY 4.0 · 来源待核验 · Source pending review
来源 · Source
出处备注：此条未指向带版次的可引用著作（通识性内容、机构文件或未展开的英文书名），本库不提供独立书目出处；如需精确引用，需由编辑补全具体篇目与版次。
Shor 1994
Shor 1994
#量子 #密码