Lightning Talks
summary
Short lightning set with concrete claims and tools: a quantum-arithmetic method merges Karatsuba with Fourier-space phases to get subquadratic multiplication scaling n^1.58 gates while reducing workspace to one ancilla and lowering Shor to ~n^2.46; noise analysis finds realistic non‑unital errors (T1, readout) destroy anti‑concentration so classical samplers can win; a state‑vs‑source‑code model shows forward‑only unitary learning needs ~D^2/ε uses; new tensor‑network simulation reproduces USTC/Xanadu GBS in ~1 hour on 300 GPUs by treating ≈90% of photons as classical; constant‑depth QRAM constructions use fan‑in/out and GT gates.
AI-written summary · about
chapters (8)
- 0:00Lightning Talks intro
- 0:21Quantum multiplication minimal qubits
- 22:40Noisy random circuit sampling
- 40:10Quantum algorithms with source code
- 1:15:30Classical simulation Gaussian boson sampling
- 1:31:12Hiding secrets in quantum outputs
- 2:08:14Quantum cryptography lower bounds
- 2:28:58Constant-depth quantum circuits QRAM
related talks
01h 31mLightning Talks
06mLightning Talk: Quantum Computing and Superpositional Cats
01h 01mInvited Talk: Welcome to Quantum 3.0!
37mResource-Efficient Quantum Computing by Breaking Abstractions
43mPanel Discussion
01h 09mRecent Progress in Quantum Advantage
01h 08mPutting Quantum Supremacy on a Rigorous Footing
02h 42mQuantum Computing Exposed: Deep Dive