Sign in

Natalie Parham

@nat-parham.bsky.social
277 followers 149 following 13 posts

phd student in cs theory, quantum computing at Columbia natalieparham.com

PostsRepliesMedia
Reposted by Natalie Parham
Steve Flammia @sflammia.bsky.social · 13/03/2026
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...
jobs.chronicle.com
Chief Executive Officer - New York City, New York (US) job with arXiv | 37961678
arXiv seeks its first CEO to champion open, free scientific discovery and guide the platform’s next chapter as an independent nonprofit.
07551
Reposted by Natalie Parham
Student Workers of Columbia @swcolumbia.bsky.social · 26/02/2026
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. 🧵
13216
Reposted by Natalie Parham
Clément Canonne @ccanonne.github.io · 26/02/2026
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.
8708
Reposted by Natalie Parham
Ben Brubaker @benbenbrubaker.bsky.social · 17/02/2026
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!
quantamagazine.org
A New Complexity Theory for the Quantum Age | Quanta Magazine
Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.
1215
Reposted by Natalie Parham
Francisca Vasconcelos @franvasco.bsky.social · 17/12/2025
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
arxiv.org
Improved Lower Bounds for QAC0
In this work, we establish the strongest known lower bounds against QAC$^0$, while allowing its full power of polynomially many ancillae and gates. Our two main results show that: (1) Depth 3 QAC$^0...
2193
Reposted by Natalie Parham
Henry Yuen @henryyuen.bsky.social · 19/08/2025
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!).
0322
Reposted by Natalie Parham
Francisca Vasconcelos @franvasco.bsky.social · 19/08/2025
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
arxiv.org
Random Unitaries in Constant (Quantum) Time
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitar...
1192
Natalie Parham @nat-parham.bsky.social · 29/04/2025
I have a new paper out: "Quantum Circuit Lower Bounds in the Magic Hierarchy".🔮🪜 arxiv.org/abs/2504.19966 a thread:
2473