Natalie Parham
@nat-parham.bsky.social
phd student in cs theory, quantum computing at Columbia
natalieparham.com
natalieparham.com
Reposted by Natalie Parham
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
arxiv.org/abs/2508.11487
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...
arxiv.org
August 19, 2025 at 12:54 AM
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!).
Reposted by Natalie Parham
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/abs/2508.11487
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...
arxiv.org
August 19, 2025 at 12:22 AM
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/abs/2508.11487
I have a new paper out: "Quantum Circuit Lower Bounds in the Magic Hierarchy".🔮🪜
arxiv.org/abs/2504.19966
a thread:
arxiv.org/abs/2504.19966
a thread:
April 29, 2025 at 10:47 PM
I have a new paper out: "Quantum Circuit Lower Bounds in the Magic Hierarchy".🔮🪜
arxiv.org/abs/2504.19966
a thread:
arxiv.org/abs/2504.19966
a thread: