John Wright

Efficiently implementing Haar random unitaries from a random oracle is fundamentally impossible, shattering hopes for universal quantum computation via this model.

A novel shadow tomography algorithm achieves near-optimal sample complexity by exploiting average-case guarantees, but an inherent measurement bottleneck limits further improvement.