activity
20232026
most citedEfficient Unitary T-designs from Random Sums

13 citations · 31 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CL2026

LLM Router: Rethinking Routing with Prefill Activations

Tanay Varshney, Annie Surla, Michelle Xu +5

Existing routers rely on semantic query features or handcrafted features, which often fail to capture model-specific failures or intrinsic task difficulty. We instead route using i…

quant-ph2025

Deep thermalization with and without quantum chaos

Soumik Ghosh, Arjun Mirani, Yihui Quek +1

Can measuring part of a quantum system make the remainder more random than the whole? Deep thermalization is a phenomenon in which measurement on part of a thermalizing quantum man…

hep-th2024★ 2 cited

Cryptographic tests of the python's lunch conjecture

Alex May, Sabrina Pasterski, Chris Waddell +1

In the AdS/CFT correspondence, a subregion of the CFT allows for the recovery of a corresponding subregion of the bulk known as its entanglement wedge. In some cases, an entangleme…

quant-ph2024★ 13 cited

Efficient unitary designs and pseudorandom unitaries from permutations

Chi-Fang Chen, Adam Bouland, Fernando G. S. L. Brandão +3

In this work we give an efficient construction of unitary -designs using quantum gates, as well as an efficient construction of a parallel-secure pse…

quant-ph2024★ 13 cited

Efficient Unitary T-designs from Random Sums

Chi-Fang Chen, Jordan Docter, Michelle Xu +2

Unitary -designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most…

hep-th2023★ 3 cited

Non-local computation and the black hole interior

Alex May, Michelle Xu

In a two sided black hole, systems falling in from opposite asymptotic regions can meet inside the black hole and interact. This is the case even while the two CFTs describing each…