The arXiv is becoming a nonprofit separate from Cornell, and they're looking for a CEO. Please repost to let good candidates know! @dabacon.tachyon.institute, @harrowing.bsky.social, @michaelnielsen.bsky.social jobs.chronicle.com/job/37961678...

BREAKING: Columbia student kidnapped by DHS! Early this morning, DHS agents entered a Columbia Residential building under the guise of searching for a “missing person” and abducted a student without any intervention. This took place just one day after our ICE off Campus rally. 🧵

In light of the current funding situation (worldwide), a modest proposal: instead of pouring billions of dollars into GenAI claiming "it *could* accelerate science and research," consider putting 1% of that amount in what *will* accelerate science and research. Namely, funding science and research.

How can we make sense of computational problems that we don’t even have the language to describe? I spoke to @henryyuen.bsky.social about what’s missing from the standard approach to quantum complexity theory — read more in @quantamagazine.bsky.social!

Very excited to share a new paper with Malvika Joshi, Avishay Tal, and John Wright on “Improved Lower Bounds for QAC^0”! In this work, we prove the strongest known lower-bounds to date for QAC^0 with the full power of polynomially many ancillae. arXiv: arxiv.org/abs/2512.14643

How fast can (pseudo)random unitaries be implemented on a quantum computer? O(1) time suffices (provided you can do things like intermediate measurements)! This -and more- is thanks to a superfun collaboration with Ben Foxman, @nat-parham.bsky.social, and @franvasco.bsky.social (all PhD students!).

In exciting new work with Ben Foxman, @nat-parham.bsky.social , and @henryyuen.bsky.social we show that t-designs and pseudorandom unitaries are implementable in constant (quantum) time! arxiv.org/abs/2508.11487

I have a new paper out: "Quantum Circuit Lower Bounds in the Magic Hierarchy".🔮🪜 arxiv.org/abs/2504.19966 a thread: