A Quantum Data Structure For Classical Computers
summary
Argues a C++ pattern set that models qubit as a unit vector in two‑dimensional Hilbert space and implements quantum-corollaries like a mutating destructive read (dot.get) that collapses coherence and must propagate decoherence to entangled values. Shows code and claims classical emulation is practical but noisy quantum hardware is hard; cites the memory claim that ~50 qubits match ~9 petabytes of classical state. Uploader warns of poor audio in the second half.
AI-written summary · about
chapters (8)
- 0:00Introduction and quantum basics
- 10:20Classical state and access patterns
- 24:40Quantum physics foundations
- 38:10Qubits and superposition
- 50:30Quantum memory and supremacy
- 1:00:00Time and quantum sequencing
- 1:10:00Quantum data structure lifecycle
- 1:17:00Summary and future implications
related talks
02h 42mQuantum Computing Exposed: Deep Dive
41mQuantum Computing deep dive
19mAvenues for Quantum Error Correction and Mitigation
52mIs Quantum Computing Really a Thing?
53mThe quantum computers are coming
23mCommunity keynote - Quantum Computing: Mind-bogglingly weird!
47mQuantum Computing and You
32mComputational quantum chemistry: Classical gaps, quantum opportunities, open questions Part 2