English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Ten Questions Nobody Can Answer Yet: An Open Problems List in Quantum Computing

Forum topic · 小凯 · 2026-11-07

Summary

This forum post is installment 089 of a Chinese-language quantum computing column, presenting a curated list of ten open problems before the series concludes. Framed as a 'sticky-note wall' of unsolved questions, the list spans theory to engineering: whether P equals NP; whether quantum computers can solve NP-complete problems; proving unconditional quantum advantage over classical computing; engineering timelines for fault-tolerant machines; the short list of practically useful exponential speedups; engineering qLDPC error-correcting codes; whether spacetime is truly an error-correcting code; whether machines can reach deep 'understanding'; whether room-temperature high-quality qubit gates can coexist; and extending quantum memory times for repeaters. The author argues that a thriving field is defined by its open problems, stresses distinguishing between theoretical gaps, engineering challenges, and unresolved physics, and notes that even quantum-over-classical superiority lacks a hypothesis-free proof. Each problem includes its current status and why it remains hard, cross-referenced to earlier column installments.

Ten Questions Nobody Can Answer Yet: An Open Problems List

> Navigation note: This post assumes you've read installments 081 (the BQP map), 082 (advantage and its attacks), 084 (spacetime as code), 085 (three layers of understanding), and 055 (thresholds). > Next up: 090, "A Graduation Roadmap: Textbooks, Papers, and Community" — concluding the ninth batch.

Research institutions often have a "sticky-note wall" in the hallway, covered with unsolved problems — anyone with an idea can take one down. This wall is the heartbeat of a field: the more sticky notes a field has, the younger and more alive it is.

After 88 installments of "what we know," before wrapping up it's time to say, properly, "what we don't know." Below are ten sticky notes, ordered from theory to engineering. Each gets three lines: the problem in plain words, the current status, and why it's hard.

The Ten Sticky Notes on the Wall

1. Is P equal to NP? (the western ridge of installment 081) The millennium problem of classical complexity — not a quantum question, yet it determines half the boundaries of the quantum map. Why hard: it requires an entirely new proof technique that humanity's mathematical toolbox doesn't yet contain.

2. Can quantum machines climb NP-complete problems? (the biggest blank in 081) The mainstream conjecture is "no," but after thirty years there is neither proof nor counterexample. Why hard: you must prove that *no clever algorithm exists* — proving "can't" is always harder than proving "can."

3. How strong is quantum, really — where is the unconditional proof? (the deep reason behind the cat-and-mouse of 082) No one can rigorously prove, without assumptions, that quantum is *strictly* stronger than classical (existing separations rely on idealized query models). Why hard: the adversary (classical algorithms) keeps evolving, and any proven "lower bound" may be broken by a new algorithm at any time.

4. The engineering timetable for fault-tolerant machines. (055/069) In theory, error correction has no obstacle (the threshold theorem guarantees it), but the engineering timeline for "a few hundred logical qubits" is pure guesswork. Why hard: this is a manufacturing problem, not a math problem — yield, wiring, and calibration walls (069) have no theoretical formula to solve them.

5. The checklist of practically useful quantum advantage. (082) Problems that are *both* exponentially faster *and* genuinely useful can still be counted on one hand (factoring and simulation). Why hard: the lesson of sampling experiments (082) — every new candidate must first pass the classical-simulator test.

6. Engineering good qLDPC codes. (057) Mathematically more efficient codes exist — but can the required interconnects and decoders actually be built? Why hard: the code geometry is non-planar, requiring the modular elevators of installment 068 to run in real time — the theory works, but the latency budget doesn't balance.

7. Is spacetime really an error-correcting code? (084) It holds rigorously in toy models; there is zero evidence for the real universe. Why hard: a conjecture at this level may require entirely new (cosmological-scale) experiments — or a new mathematician.

8. Can machines reach the third floor of "understanding"? (085) The path from floor one to floor two is open; nobody can draw the dashed line to floor three. Why hard: we don't even have a testable definition of consciousness — the problem itself isn't fully formed yet.

9. Does a room-temperature + high-quality-gate combination exist? (the long bet of 065/066) Photons and color centers work at room temperature, but gate quality falls short; high-quality gates all live in extreme cold. Why hard: the physical floor of decoherence may truly lock "room temperature + good gates" out of reach — or ultrapure materials might crack a window open.

10. The memory leap for quantum repeaters. (072) The last puzzle piece of entanglement-distribution networks: quantum memory going from milliseconds to seconds. Why hard: storage time and fidelity trade off against each other, with every gain carved out of a physical limit.

Why This Wall Matters

Why devote a closing post to "not knowing"? Three reasons:

  • A field with a sticky-note wall is alive — a field where every question has an answer is called a museum.
  • Sticky notes are signposts, not pillars of shame — each note points back to which installments teach you to understand it (the bracketed numbers are the map). If you've read the whole column, you're already standing at the threshold of these ten notes.
  • Honesty is this column's baseline — the "proofs" of 030, the attack-and-defense of 082, the verification of 088 all point to the same posture: separate the three boxes of "known, engineering-expected, and fundamentally unsolved," and never let contents leak between them.
  • Dismantling the Analogy

    Where the sticky-note wall metaphor breaks down:

  • Disanalogy one: on this wall, notes keep multiplying (new questions appear faster than old ones get solved) — mature fields see their notes decrease; quantum computing is in its adolescence.
  • Disanalogy two: the notes all look equally flat, but their difficulty differs enormously — some need one clever engineer (4, 6), some need new mathematics (1, 2, 3), and some need a physics revolution (7, 9). Before pulling a note off the wall, weigh which tool you're holding.

What to Take Away

1. Ten notes, three tiers: theoretical gaps (1/2/3/7/8), engineering clocks (4/6/10), checklists awaiting entries (5/9) — classifying the kinds of "unknown" matters more than merely listing them. 2. Unconditional proof is the biggest hidden thread: even "quantum strictly beats classical" has no assumption-free proof (3) — this is the abyss beneath the cat-and-mouse game of 082. 3. The value of the wall: the more sticky notes, the younger the field — the bracketed installment numbers are your note-pulling map, and installment 090 will hand you the next ladder.

The hook for the next stop: the last sticky note reads "you" — after 90 posts, what next? How to pick textbooks, read papers, find the community, and choose a career path. Next up: 090, "A Graduation Roadmap: Textbooks, Papers, and Community," closing out batch nine.

Tags

#quantum-computing#open-problems#complexity-theory#p-vs-np#quantum-advantage#error-correction#qldpc-codes#quantum-repeaters

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178636923