Nearly Time-Optimal Pure State Tomography with Pauli Measurements
[2026-06-12, Sabee Grewal (UT Austin) ] We give an algorithm for pure state tomography with near-optimal copy complexity using single-qubit measurements. Specifically, given \widetilde{O}(2^n/\epsilon) copies of an unknown pure n-qubit state \lvert\psi\rangle, the algorithm performs only \textit{nonadaptive Pauli measurements}, runs in time \mathrm{poly}(2^n,1/\epsilon), and outputs \lvert \widehat{\psi} \rangle that has fidelity 1-\epsilon with \lvert \psi \rangle with high probability. This improves upon the previous best copy complexity bound of \widetilde{O}(3^n/\epsilon).

▶︎
OPTICAL COMPUTING with PLASMA: Stanford PhD Defense

▶︎
On the Complexity of Decoded Quantum Interferometry

▶︎
Scott Aaronson - The TRUTH About Quantum Computing

▶︎
Why Aliens Would NEVER Invade Africa

▶︎
Randomized truncation of quantum states

▶︎
Yann LeCun: World Models: Enabling the next AI revolution

▶︎
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

▶︎
Terence Tao – How the world’s top mathematician uses AI

▶︎
Inside the Mind of Anthropic CEO Dario Amodei | The Circuit | Extended Interview

▶︎
How AI Cracked the Protein Folding Code and Won a Nobel Prize

▶︎
Nobel Prize lecture: Demis Hassabis, Nobel Prize in Chemistry 2024

▶︎
The Riemann Hypothesis, Explained

▶︎
The Race to Harness Quantum Computing's Mind-Bending Power | The Future With Hannah Fry

▶︎
21 Yr Old Disproves 4 Decades Old Belief in Computing

▶︎
How To Think SO CLEARLY People Assume You're A Genius

▶︎
We're 99.9% sure this pattern is true, but no one can prove it

▶︎
Unitary designs in nearly optimal depth

▶︎
Few Single Qubit Measurements Suffice to Certify Any Quantum State

▶︎
How to Speak 10X Clearer (The CLEAR Framework)

▶︎
