[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7ARGDC685X79806W4MZ1YXG":3,"skill-same:01M7ARGDC685X79806W4MZ1YXG":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7ARGDC685X79806W4MZ1YXG","quantum-noise-error-correction-and-hardware",null,"Use when reasoning about real quantum hardware: what goes wrong (decoherence, gate errors, crosstalk), error mitigation vs correction, benchmarking (quantum volume, randomized benchmarking), barren plateaus, the idea of quantum error correction, the surface code and qLDPC codes, the 2024–2026 below-threshold breakthrough, magic states as the hidden cost, the hardware modalities (superconducting, trapped ion, neutral atom, photonic, spin, topological), the vendor roadmaps, and how to read a roadmap.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fquantum-computing\u002Fskills\u002Fquantum-noise-error-correction-and-hardware\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: quantum-noise-error-correction-and-hardware\ndescription: \"Use when reasoning about real quantum hardware: what goes wrong (decoherence, gate errors, crosstalk), error mitigation vs correction, benchmarking (quantum volume, randomized benchmarking), barren plateaus, the idea of quantum error correction, the surface code and qLDPC codes, the 2024–2026 below-threshold breakthrough, magic states as the hidden cost, the hardware modalities (superconducting, trapped ion, neutral atom, photonic, spin, topological), the vendor roadmaps, and how to read a roadmap.\"\n---\n\n# Quantum Computing: Noise and NISQ, Error Correction, and Hardware\n\n> **Part 2 of 5** of the *Quantum Computing* reference (plugin `quantum-computing`), covering §4–§7. Sibling skills: `quantum-foundations-and-algorithms` (§0–§3), `quantum-software-and-resource-estimation` (§8–§10), `quantum-applications-and-post-quantum-crypto` (§11–§13), `quantum-reference` (§14–§20). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** Verified August 2026. See §17 → `quantum-reference` for the currency snapshot and what goes stale first.\n\n> **How to read this.** Reference, not tutorial. Sections are independent. Three markers:\n> - **[DURABLE]** — physics, mathematics, or complexity theory. Does not expire.\n> - **[VERSIONED]** — hardware state, roadmaps, software versions, regulatory deadlines.\n>   Moving fast; verify before relying on it.\n> - **[CONTESTED]** — genuine scientific or strategic disagreement, of which this field\n>   has an unusual amount.\n>\n> **⚠️ GOTCHA** boxes mark the misconceptions that produce bad technical decisions and\n> bad business decisions.\n>\n> **The three framings that organize everything below:**\n> 1. **A quantum computer is not a faster computer. It is a different computer with a\n>    narrow set of exponential advantages.** For the overwhelming majority of workloads\n>    there is no quantum speedup, and none is expected. The interesting question is never\n>    \"how fast\" — it's \"does this specific problem have exploitable structure?\"\n> 2. **Nearly every headline conflates physical qubits with logical qubits.** A distance-7\n>    surface code uses **49 physical qubits to make one logical qubit**; breaking RSA-2048\n>    needs millions of physical qubits. Any number quoted without specifying which kind is\n>    nearly meaningless.\n> 3. **The cryptographic migration is urgent independently of when the hardware\n>    arrives.** \"Harvest now, decrypt later\" makes today's encrypted traffic a future\n>    liability, and regulators have stopped waiting for hardware predictions and published\n>    binding dates. §13 → `quantum-applications-and-post-quantum-crypto` is the section with real deadlines attached.\n\n---\n\n## §4. Noise and the NISQ Era\n\n### 4.1 What goes wrong\n\n**[DURABLE]** Quantum states are fragile in ways classical bits are not:\n- **Decoherence** — coupling to the environment destroys the state. **T1** (energy\n  relaxation \u002F amplitude damping) and **T2** (dephasing) are the two lifetimes, and\n  **T2 ≤ 2·T1** always.\n- **Gate errors** — imperfect control. Single-qubit errors ~10⁻⁴–10⁻³, two-qubit errors\n  ~10⁻³–10⁻² on current hardware, depending heavily on platform.\n- **Measurement\u002Freadout errors** — often the largest single error source, ~1%.\n- **Crosstalk** — operating one qubit disturbs its neighbours.\n- **Leakage** — the qubit escapes the computational subspace into a third level.\n- **Correlated and non-Markovian noise** — the assumption-breaker for many error models,\n  and a live research area.\n\n**The core tension**: circuit depth × error rate must stay small. At 10⁻³ two-qubit error,\nyou get roughly 1000 gates before errors dominate. **Useful algorithms need millions to\nbillions.** That gap is the entire justification for §5.\n\n### 4.2 Error mitigation (not correction)\n\n**[DURABLE] Mitigation reduces bias in expectation values; it does not fix the\ncomputation.** The distinction matters: correction (§5) makes arbitrarily long computations\npossible, mitigation buys you a factor at exponentially growing sampling cost.\n\n- **Zero-noise extrapolation (ZNE)** — run at amplified noise levels, extrapolate to zero.\n- **Probabilistic error cancellation (PEC)** — invert the noise channel by sampling;\n  **provably correct, exponentially costly in sampling overhead**.\n- **Readout error mitigation** — cheap, effective, do it always.\n- **Dynamical decoupling** — pulse sequences that echo away slow dephasing during idle time.\n- **Symmetry verification \u002F post-selection** — throw away runs that violate a known\n  conserved quantity.\n- **Twirling \u002F randomized compiling** — turn coherent errors into stochastic ones, which\n  are much better behaved.\n\n**⚠️ Every mitigation technique costs exponentially more shots as circuits grow.** They\nextend the NISQ regime; they do not scale to useful algorithms.\n\n### 4.3 Benchmarking\n\nBeyond raw qubit count: **randomized benchmarking** and **cycle benchmarking** for gate\nfidelity, **quantum volume** (IBM's single-number metric, now widely seen as saturating),\n**CLOPS** (speed), **algorithmic qubits** (IonQ's metric — ⚠️ vendor-defined), and\n**application-level benchmarks**. **[DURABLE] Be suspicious of any single-number metric,\nespecially one the vendor invented.**\n\n### 4.4 Barren plateaus\n\n**[DURABLE, and it's the most important negative result of the NISQ era.]** For many\nparameterized quantum circuits, gradients vanish **exponentially in the number of qubits**,\nmaking variational training (VQE, QAOA, QML) infeasible at scale. Causes include circuit\nexpressiveness, entanglement, noise, and global cost functions. Mitigations (local cost\nfunctions, shallow structured ansätze, smart initialization) exist — but **there is a\nsignificant result showing that provable absence of barren plateaus may imply classical\nsimulability**, i.e. the circuits you can train may be exactly the ones you didn't need a\nquantum computer for. That tension is unresolved and it is central to §16.3 → `quantum-reference`.\n\n---\n\n## §5. Error Correction and Fault Tolerance\n\n### 5.1 The idea\n\n**[DURABLE]** No-cloning forbids naive redundancy, but you can encode one **logical qubit**\ninto many **physical qubits** and measure *stabilizers* — operators that reveal error\nsyndromes **without measuring (and collapsing) the logical state**. Then correct.\n\n**The threshold theorem [DURABLE, and it's why the field exists]:** if physical error rates\nare below a threshold, arbitrarily long computations become possible with polylogarithmic\noverhead. The surface-code threshold is around **~1%**, which is why the field spent two\ndecades pushing gate fidelities toward it.\n\n### 5.2 Codes\n\n| Code | Overhead | Notes |\n|---|---|---|\n| **Surface code** | High (~1000:1 for useful rates) | 2D nearest-neighbour connectivity, high threshold. **The default for superconducting** |\n| **Color codes** | Similar | Transversal gates are easier; lower threshold |\n| **qLDPC codes** | **Much lower** | Requires long-range connectivity. **The most important recent development** — the main hope for reducing overhead |\n| **Bosonic codes** (cat, GKP) | Different trade-off | Encode in an oscillator's infinite-dimensional space; hardware-efficient |\n| **Concatenated codes** | Historically first | Simple analysis, worse thresholds |\n\n### 5.3 The 2024–2026 breakthrough\n\n**[VERSIONED — this is what actually changed.]** **Google's Willow chip (105\nsuperconducting qubits, announced 9 December 2024) demonstrated \"below threshold\" error\ncorrection for the first time on real hardware**: running the surface code at **distance\n3, 5, and 7 on the same chip**, the logical error rate fell **monotonically — roughly\nhalving with each increase in code distance**.\n\n**Why that specific result mattered [DURABLE reasoning]:** before Willow, nobody had\npublicly demonstrated that *adding more physical qubits actually lowered the logical error\nrate*. Every prior scaling attempt had added more error than it corrected. Willow\neliminated the legitimate scientific objection that scalable error correction might be\nphysically impossible on superconducting hardware.\n\n**⚠️ What it did not do:** demonstrate fault tolerance at useful scale. **A distance-7\nsurface code uses 49 physical qubits to produce one logical qubit**; Shor's on RSA-2048\nrequires millions of them. **The pathway is now credible. The pathway is still long.**\n\n### 5.4 Magic states — the hidden cost\n\n**[DURABLE]** Clifford gates can be done transversally and cheaply; **T gates cannot**.\nThe standard solution is **magic state distillation**: consume many noisy states to produce\none clean `|T⟩`. **This dominates the resource cost of fault-tolerant algorithms** — often\nthe majority of the qubits and time in a resource estimate (§9 → `quantum-software-and-resource-estimation`). Reducing or eliminating\ndistillation overhead (transversal T gates, better codes) is one of the two remaining\nengineering problems, alongside raw physical qubit scaling.\n\n---\n\n## §6. Hardware Modalities\n\n**[DURABLE] No modality has won, and each fails differently.** The trade-off structure is\nstable even as the numbers move.\n\n| Modality | Players | Strengths | Weaknesses |\n|---|---|---|---|\n| **Superconducting** | IBM, Google, Rigetti, IQM | Fast gates (ns), fab-compatible, most mature | Short coherence (µs), millikelvin dilution fridges, nearest-neighbour connectivity, crosstalk |\n| **Trapped ion** | Quantinuum, IonQ | **Best gate fidelities**, all-to-all connectivity, identical qubits, long coherence | **Slow gates (µs–ms)**, scaling requires shuttling or photonic interconnects |\n| **Neutral atom** | QuEra, Pasqal, Atom Computing | **Massive qubit counts** (1000+ demonstrated), reconfigurable geometry, room-temperature-ish optics | Slower operations, atom loss, younger |\n| **Photonic** | PsiQuantum, Xanadu | Room temperature, natural networking, fast | Probabilistic gates, photon loss, needs enormous component counts |\n| **Spin \u002F silicon** | Intel, Diraq, academic | CMOS-compatible, tiny footprint, potential to leverage existing fabs | Least mature; variability between devices |\n| **Topological** | Microsoft | Error protection built into the physics | ⚠️ **Most scientifically contested** (§16.5 → `quantum-reference`) |\n| **Annealing** | D-Wave | Thousands of qubits *now*, real commercial deployments | **Not universal**; advantage disputed (§16.4 → `quantum-reference`) |\n\n**[DURABLE] The comparison metric that matters is not qubit count.** It's the combination\nof **two-qubit gate fidelity**, **connectivity**, **gate speed**, **coherence relative to\ngate time**, and **whether the architecture has a credible scaling path**. A vendor quoting\nonly qubit count is telling you which number flatters them.\n\n---\n\n## §7. Where the Hardware Actually Is\n\n**[VERSIONED — highest decay risk in this document. Verify everything here.]**\n\n### 7.1 The roadmaps\n\n**IBM** publishes the most specific named-deliverable roadmap in the industry:\n- **Nighthawk** — 120-qubit processor with 218 next-generation tunable couplers in a square\n  lattice; ~30% more circuit complexity than the Heron family. Targeted to run\n  **~7,500 gates in 2026** with up to three 120-qubit modules (360 qubits), **10,000 gates\n  in 2027**, **15,000 in 2028**.\n- **Loon** — debuted 2025 with c-couplers linking qubits across the chip, the architecture\n  needed for qLDPC codes.\n- **Kookaburra** — the first module built around modular Quantum System Two, ~4,158 physical\n  qubits across the connected cluster; **the first IBM module capable of storing information\n  in qLDPC memory and processing it with an attached logical processing unit**.\n- **Starling (2029)** — **200 logical qubits from roughly 10,000 physical qubits, running\n  100 million operations.** The fault-tolerance target.\n- **Blue Jay (2033)** — **2,000 logical qubits, 1 billion operations.**\n- IBM states it will **prototype a real-time error-correction decoder in 2026**.\n\n**Google** publishes a six-milestone roadmap. It places itself at **Milestone 2** (~100\nphysical qubits, logical error rate ~10⁻²) with Willow. Milestone 3 is a long-lived logical\nqubit (~10³ physical qubits, 10⁻⁶ logical error). **Milestone 6 is the endpoint: ~10⁶\nphysical qubits with a 10⁻¹³ logical error rate.** ⚠️ **Google presents the million-qubit\nfigure as a destination, not a near-term specification** — and the gap from ~100-qubit\nchips is enormous.\n\n**Others**: **PsiQuantum** targets a million-qubit utility-scale photonic machine on a\nsimilar horizon. **DARPA's Quantum Benchmarking Initiative** funds Atom Computing,\nPhotonic Inc., Oxford Ionics (now part of IonQ), and others on parallel fault-tolerance\ntracks toward 2033 operational milestones. **Quantinuum** and **Microsoft** have reported\nlogical-qubit milestones on the H-series trapped-ion systems.\n\n### 7.2 How to read a roadmap\n\n**[DURABLE] Roadmaps are marketing documents with engineering inside them.** The questions\nthat separate signal from noise:\n1. **Physical or logical qubits?** (§0 → `quantum-foundations-and-algorithms` framing 2)\n2. **What two-qubit fidelity**, and measured how?\n3. **Is the connectivity claim about the chip or about a hypothetical module?**\n4. **Has the milestone been demonstrated, or is it a target year?**\n5. **Peer-reviewed, preprint, or press release?**\n6. **What did the previous roadmap promise for this year, and did it land?** — the single\n   most informative question, and the one nobody asks.\n","# Quantum Computing: Noise and NISQ, Error Correction, and Hardware\n\n> **Part 2 of 5** of the *Quantum Computing* reference (plugin `quantum-computing`), covering §4–§7. Sibling skills: `quantum-foundations-and-algorithms` (§0–§3), `quantum-software-and-resource-estimation` (§8–§10), `quantum-applications-and-post-quantum-crypto` (§11–§13), `quantum-reference` (§14–§20). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** Verified August 2026. See §17 → `quantum-reference` for the currency snapshot and what goes stale first.\n\n> **How to read this.** Reference, not tutorial. Sections are independent. Three markers:\n> - **[DURABLE]** — physics, mathematics, or complexity theory. Does not expire.\n> - **[VERSIONED]** — hardware state, roadmaps, software versions, regulatory deadlines.\n>   Moving fast; verify before relying on it.\n> - **[CONTESTED]** — genuine scientific or strategic disagreement, of which this field\n>   has an unusual amount.\n>\n> **⚠️ GOTCHA** boxes mark the misconceptions that produce bad technical decisions and\n> bad business decisions.\n>\n> **The three framings that organize everything below:**\n> 1. **A quantum computer is not a faster computer. It is a different computer with a\n>    narrow set of exponential advantages.** For the overwhelming majority of workloads\n>    there is no quantum speedup, and none is expected. The interesting question is never\n>    \"how fast\" — it's \"does this specific problem have exploitable structure?\"\n> 2. **Nearly every headline conflates physical qubits with logical qubits.** A distance-7\n>    surface code uses **49 physical qubits to make one logical qubit**; breaking RSA-2048\n>    needs millions of physical qubits. Any number quoted without specifying which kind is\n>    nearly meaningless.\n> 3. **The cryptographic migration is urgent independently of when the hardware\n>    arrives.** \"Harvest now, decrypt later\" makes today's encrypted traffic a future\n>    liability, and regulators have stopped waiting for hardware predictions and published\n>    binding dates. §13 → `quantum-applications-and-post-quantum-crypto` is the section with real deadlines attached.\n\n---\n\n## §4. Noise and the NISQ Era\n\n### 4.1 What goes wrong\n\n**[DURABLE]** Quantum states are fragile in ways classical bits are not:\n- **Decoherence** — coupling to the environment destroys the state. **T1** (energy\n  relaxation \u002F amplitude damping) and **T2** (dephasing) are the two lifetimes, and\n  **T2 ≤ 2·T1** always.\n- **Gate errors** — imperfect control. Single-qubit errors ~10⁻⁴–10⁻³, two-qubit errors\n  ~10⁻³–10⁻² on current hardware, depending heavily on platform.\n- **Measurement\u002Freadout errors** — often the largest single error source, ~1%.\n- **Crosstalk** — operating one qubit disturbs its neighbours.\n- **Leakage** — the qubit escapes the computational subspace into a third level.\n- **Correlated and non-Markovian noise** — the assumption-breaker for many error models,\n  and a live research area.\n\n**The core tension**: circuit depth × error rate must stay small. At 10⁻³ two-qubit error,\nyou get roughly 1000 gates before errors dominate. **Useful algorithms need millions to\nbillions.** That gap is the entire justification for §5.\n\n### 4.2 Error mitigation (not correction)\n\n**[DURABLE] Mitigation reduces bias in expectation values; it does not fix the\ncomputation.** The distinction matters: correction (§5) makes arbitrarily long computations\npossible, mitigation buys you a factor at exponentially growing sampling cost.\n\n- **Zero-noise extrapolation (ZNE)** — run at amplified noise levels, extrapolate to zero.\n- **Probabilistic error cancellation (PEC)** — invert the noise channel by sampling;\n  **provably correct, exponentially costly in sampling overhead**.\n- **Readout error mitigation** — cheap, effective, do it always.\n- **Dynamical decoupling** — pulse sequences that echo away slow dephasing during idle time.\n- **Symmetry verification \u002F post-selection** — throw away runs that violate a known\n  conserved quantity.\n- **Twirling \u002F randomized compiling** — turn coherent errors into stochastic ones, which\n  are much better behaved.\n\n**⚠️ Every mitigation technique costs exponentially more shots as circuits grow.** They\nextend the NISQ regime; they do not scale to useful algorithms.\n\n### 4.3 Benchmarking\n\nBeyond raw qubit count: **randomized benchmarking** and **cycle benchmarking** for gate\nfidelity, **quantum volume** (IBM's single-number metric, now widely seen as saturating),\n**CLOPS** (speed), **algorithmic qubits** (IonQ's metric — ⚠️ vendor-defined), and\n**application-level benchmarks**. **[DURABLE] Be suspicious of any single-number metric,\nespecially one the vendor invented.**\n\n### 4.4 Barren plateaus\n\n**[DURABLE, and it's the most important negative result of the NISQ era.]** For many\nparameterized quantum circuits, gradients vanish **exponentially in the number of qubits**,\nmaking variational training (VQE, QAOA, QML) infeasible at scale. Causes include circuit\nexpressiveness, entanglement, noise, and global cost functions. Mitigations (local cost\nfunctions, shallow structured ansätze, smart initialization) exist — but **there is a\nsignificant result showing that provable absence of barren plateaus may imply classical\nsimulability**, i.e. the circuits you can train may be exactly the ones you didn't need a\nquantum computer for. That tension is unresolved and it is central to §16.3 → `quantum-reference`.\n\n---\n\n## §5. Error Correction and Fault Tolerance\n\n### 5.1 The idea\n\n**[DURABLE]** No-cloning forbids naive redundancy, but you can encode one **logical qubit**\ninto many **physical qubits** and measure *stabilizers* — operators that reveal error\nsyndromes **without measuring (and collapsing) the logical state**. Then correct.\n\n**The threshold theorem [DURABLE, and it's why the field exists]:** if physical error rates\nare below a threshold, arbitrarily long computations become possible with polylogarithmic\noverhead. The surface-code threshold is around **~1%**, which is why the field spent two\ndecades pushing gate fidelities toward it.\n\n### 5.2 Codes\n\n| Code | Overhead | Notes |\n|---|---|---|\n| **Surface code** | High (~1000:1 for useful rates) | 2D nearest-neighbour connectivity, high threshold. **The default for superconducting** |\n| **Color codes** | Similar | Transversal gates are easier; lower threshold |\n| **qLDPC codes** | **Much lower** | Requires long-range connectivity. **The most important recent development** — the main hope for reducing overhead |\n| **Bosonic codes** (cat, GKP) | Different trade-off | Encode in an oscillator's infinite-dimensional space; hardware-efficient |\n| **Concatenated codes** | Historically first | Simple analysis, worse thresholds |\n\n### 5.3 The 2024–2026 breakthrough\n\n**[VERSIONED — this is what actually changed.]** **Google's Willow chip (105\nsuperconducting qubits, announced 9 December 2024) demonstrated \"below threshold\" error\ncorrection for the first time on real hardware**: running the surface code at **distance\n3, 5, and 7 on the same chip**, the logical error rate fell **monotonically — roughly\nhalving with each increase in code distance**.\n\n**Why that specific result mattered [DURABLE reasoning]:** before Willow, nobody had\npublicly demonstrated that *adding more physical qubits actually lowered the logical error\nrate*. Every prior scaling attempt had added more error than it corrected. Willow\neliminated the legitimate scientific objection that scalable error correction might be\nphysically impossible on superconducting hardware.\n\n**⚠️ What it did not do:** demonstrate fault tolerance at useful scale. **A distance-7\nsurface code uses 49 physical qubits to produce one logical qubit**; Shor's on RSA-2048\nrequires millions of them. **The pathway is now credible. The pathway is still long.**\n\n### 5.4 Magic states — the hidden cost\n\n**[DURABLE]** Clifford gates can be done transversally and cheaply; **T gates cannot**.\nThe standard solution is **magic state distillation**: consume many noisy states to produce\none clean `|T⟩`. **This dominates the resource cost of fault-tolerant algorithms** — often\nthe majority of the qubits and time in a resource estimate (§9 → `quantum-software-and-resource-estimation`). Reducing or eliminating\ndistillation overhead (transversal T gates, better codes) is one of the two remaining\nengineering problems, alongside raw physical qubit scaling.\n\n---\n\n## §6. Hardware Modalities\n\n**[DURABLE] No modality has won, and each fails differently.** The trade-off structure is\nstable even as the numbers move.\n\n| Modality | Players | Strengths | Weaknesses |\n|---|---|---|---|\n| **Superconducting** | IBM, Google, Rigetti, IQM | Fast gates (ns), fab-compatible, most mature | Short coherence (µs), millikelvin dilution fridges, nearest-neighbour connectivity, crosstalk |\n| **Trapped ion** | Quantinuum, IonQ | **Best gate fidelities**, all-to-all connectivity, identical qubits, long coherence | **Slow gates (µs–ms)**, scaling requires shuttling or photonic interconnects |\n| **Neutral atom** | QuEra, Pasqal, Atom Computing | **Massive qubit counts** (1000+ demonstrated), reconfigurable geometry, room-temperature-ish optics | Slower operations, atom loss, younger |\n| **Photonic** | PsiQuantum, Xanadu | Room temperature, natural networking, fast | Probabilistic gates, photon loss, needs enormous component counts |\n| **Spin \u002F silicon** | Intel, Diraq, academic | CMOS-compatible, tiny footprint, potential to leverage existing fabs | Least mature; variability between devices |\n| **Topological** | Microsoft | Error protection built into the physics | ⚠️ **Most scientifically contested** (§16.5 → `quantum-reference`) |\n| **Annealing** | D-Wave | Thousands of qubits *now*, real commercial deployments | **Not universal**; advantage disputed (§16.4 → `quantum-reference`) |\n\n**[DURABLE] The comparison metric that matters is not qubit count.** It's the combination\nof **two-qubit gate fidelity**, **connectivity**, **gate speed**, **coherence relative to\ngate time**, and **whether the architecture has a credible scaling path**. A vendor quoting\nonly qubit count is telling you which number flatters them.\n\n---\n\n## §7. Where the Hardware Actually Is\n\n**[VERSIONED — highest decay risk in this document. Verify everything here.]**\n\n### 7.1 The roadmaps\n\n**IBM** publishes the most specific named-deliverable roadmap in the industry:\n- **Nighthawk** — 120-qubit processor with 218 next-generation tunable couplers in a square\n  lattice; ~30% more circuit complexity than the Heron family. Targeted to run\n  **~7,500 gates in 2026** with up to three 120-qubit modules (360 qubits), **10,000 gates\n  in 2027**, **15,000 in 2028**.\n- **Loon** — debuted 2025 with c-couplers linking qubits across the chip, the architecture\n  needed for qLDPC codes.\n- **Kookaburra** — the first module built around modular Quantum System Two, ~4,158 physical\n  qubits across the connected cluster; **the first IBM module capable of storing information\n  in qLDPC memory and processing it with an attached logical processing unit**.\n- **Starling (2029)** — **200 logical qubits from roughly 10,000 physical qubits, running\n  100 million operations.** The fault-tolerance target.\n- **Blue Jay (2033)** — **2,000 logical qubits, 1 billion operations.**\n- IBM states it will **prototype a real-time error-correction decoder in 2026**.\n\n**Google** publishes a six-milestone roadmap. It places itself at **Milestone 2** (~100\nphysical qubits, logical error rate ~10⁻²) with Willow. Milestone 3 is a long-lived logical\nqubit (~10³ physical qubits, 10⁻⁶ logical error). **Milestone 6 is the endpoint: ~10⁶\nphysical qubits with a 10⁻¹³ logical error rate.** ⚠️ **Google presents the million-qubit\nfigure as a destination, not a near-term specification** — and the gap from ~100-qubit\nchips is enormous.\n\n**Others**: **PsiQuantum** targets a million-qubit utility-scale photonic machine on a\nsimilar horizon. **DARPA's Quantum Benchmarking Initiative** funds Atom Computing,\nPhotonic Inc., Oxford Ionics (now part of IonQ), and others on parallel fault-tolerance\ntracks toward 2033 operational milestones. **Quantinuum** and **Microsoft** have reported\nlogical-qubit milestones on the H-series trapped-ion systems.\n\n### 7.2 How to read a roadmap\n\n**[DURABLE] Roadmaps are marketing documents with engineering inside them.** The questions\nthat separate signal from noise:\n1. **Physical or logical qubits?** (§0 → `quantum-foundations-and-algorithms` framing 2)\n2. **What two-qubit fidelity**, and measured how?\n3. **Is the connectivity claim about the chip or about a hypothetical module?**\n4. **Has the milestone been demonstrated, or is it a target year?**\n5. **Peer-reviewed, preprint, or press release?**\n6. **What did the previous roadmap promise for this year, and did it land?** — the single\n   most informative question, and the one nobody asks.\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fquantum-computing\u002Fskills\u002Fquantum-noise-error-correction-and-hardware",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill quantum-noise-error-correction-and-hardware",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill quantum-noise-error-correction-and-hardware",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill quantum-noise-error-correction-and-hardware","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fquantum-computing\u002Fskills\u002Fquantum-noise-error-correction-and-hardware\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]