Scott Aaronson
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 5 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Quantum Computing: Between Hope and Hype | Post-Quantum Cryptography Conference Austin 2025 | 2025-01-15 |
Claims that two‑qubit gate fidelities have reached 99.9% two-qubit fidelity and that Google demonstrated a surface‑code protected logical qubit on a 103-qubit… | ||
| Circuit Conspiracies | Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms | 2024-04-22 |
Poses the peakedness problem: pick random quantum circuits (1D nearest‑neighbor SU(4) layers), condition on having an output basis string with probability ≥δ… | ||
| Verifiable Quantum Supremacy: What I Hope Will Be Done | Quantum Summer Cluster Workshop 2023 | 2023-07-10 |
Argues for a concrete research program: design circuits that are NISQ-implementable, provably hard for classical simulation, yet classically efficiently… | ||
| Recent Progress in Quantum Advantage | Quantum and Lattices Joint Reunion Workshop | 2022-06-13 |
Argues that useful exponential quantum advantage needs three things at once: NISQ-able hardware, a clear classical hardness gap, and an efficiently verifiable… | ||
| Verification of BosonSampling Devices | Quantum Games and Protocols | 2014-02-24 |
BosonSampling uses N identical photons through an M‑mode linear optical network so output probabilities equal the permanent of N×N submatrix amplitudes, giving… | ||
| nothing matches | ||