Natalie Parham
@nat-parham.bsky.social
📤 196
📥 145
📝 13
phd student in cs theory, quantum computing at Columbia natalieparham.com
reposted by
Natalie Parham
Henry Yuen
about 2 months ago
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!).
add a skeleton here at some point
0
32
2
reposted by
Natalie Parham
Francisca Vasconcelos
about 2 months ago
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
loading . . .
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...
https://arxiv.org/abs/2508.11487
1
19
3
I have a new paper out: "Quantum Circuit Lower Bounds in the Magic Hierarchy".🔮🪜
arxiv.org/abs/2504.19966
a thread:
6 months ago
2
48
6
you reached the end!!
feeds!
log in