
  Key challenges:
  - Scaling to enough high-quality qubits for error correction
  - Reducing gate error rates below fault-tolerance thresholds
  - Developing practical algorithms that provide advantage on near-term hardware
  - Building the classical control and software stack

  What quantum computers won't do: They are not universally faster than classical computers. They
  excel at specific structured problems (simulation, factoring, optimization) but do not speed up
  general-purpose computing.

  Practical implications

  - Cryptography: Post-quantum cryptography standards (lattice-based, hash-based, etc.) are being
  standardized now (NIST finalized initial standards in 2024) to prepare for a future where Shor's
  algorithm threatens current public-key schemes.
  - Chemistry/materials: Simulating molecular behavior is a near-term practical target.
  - Optimization: Logistics, finance, and scheduling problems may benefit, though proven quantum
  advantage for optimization remains an open question.
  - Machine learning: Quantum ML is an active research area but has not yet demonstrated clear
  practical advantage.

✻ Crunched for 37s

❯ Write a very long essay about the history of mathematics from ancient times to modern day     
                                                                                                
  ⎿  Interrupted · What should Claude do instead?

❯ Explain the theory of relativity in detail with examples                                      
                                                                                                

✽ Burrowing… (1m 7s · ↓ 3.0k tokens)
  ⎿  Tip: Use Plan Mode to prepare for a complex request before making changes. Press shift+tab 
     twice to enable.

────────────────────────────────────────────────────────────────────────────────────────────────────
❯ Some follow-up question here 
────────────────────────────────────────────────────────────────────────────────────────────────────
  ⏵⏵ bypass permissions on (shift+tab to cycle)

