Willow, Our Quantum Chip
Scope of Quantum Advantage
- Commenters stress that exponential quantum speedups apply to a narrow class of problems, not “all computing.”
- BQP (efficient quantumly solvable problems) is discussed; relationship to P and NP is unknown, and NP‑complete problems are not believed to become easy in general.
- Grover’s algorithm gives only quadratic speedup for unstructured search, often overshadowed by easier classical scaling.
Practical Use Cases
- Near‑term: mainly simulation of quantum systems, certain optimization and search tasks, and potentially specialized ML/linear algebra (quantum machine learning, HHL, etc.).
- Long‑term: factoring and discrete log (breaking RSA/ECC), some materials and chemistry, and niche optimization.
- Many note that random circuit sampling (RCS), the benchmark used, has no direct practical application.
Willow’s Technical Contribution
- Big excitement around demonstrated quantum error correction “below threshold”: logical error rates decreasing exponentially as more physical qubits are added.
- Willow provides ~100 physical qubits; experiments show a distance‑7 surface code with logical lifetimes exceeding best physical qubits, plus high‑distance repetition codes.
- Some highlight T1 / coherence improvements; others note decoherence and connectivity remain hard limits.
Crypto and Security Implications
- Consensus: Willow is far from breaking modern RSA/ECC; estimates for practical Shor implementations require thousands of high‑quality logical qubits and millions of physical qubits.
- Still, “store‑now, decrypt‑later” is a real concern; many argue to start migrating to post‑quantum cryptography (lattice‑based KEMs, new signature schemes).
- Symmetric crypto (AES, hashes) is seen as only quadratically weakened by Grover and can be strengthened by longer keys.
Benchmarks and “Supremacy” Skepticism
- RCS result (minutes vs 10^25 years on a naive classical algorithm) is seen by some as a meaningful “beyond‑classical” milestone.
- Others call the comparison misleading, noting prior Google claims were later matched or narrowed by optimized classical simulations and that RCS is a contrived task.
Many‑Worlds / Multiverse Controversy
- Strong pushback on the blog’s claim that the result “lends credence” to parallel universes.
- Multiple comments emphasize that interpretations of quantum mechanics (many‑worlds, pilot‑wave, Copenhagen, etc.) are experimentally equivalent so far and that this is philosophy, not an experimentally supported conclusion.
Learning, Ecosystem, and Meta‑Issues
- Many links to beginner resources (IBM, Microsoft, textbooks, courses) and advice: learn linear algebra; focus on algorithms vs hardware.
- Debate on whether corporate labs (Google, IBM, etc.) now advance quantum more effectively than academia, largely due to stable teams, tooling, and engineering resources.
- Broader societal worries include future decryption of historical traffic, impact on cryptocurrencies, and whether institutions are prepared for a post‑quantum world.