235 citations · 405 across the 36 of their papers we have counts for
52 papers
All Unitaries Have Constant Depth Quantum Circuits
Barak Nehoran, Henry Yuen, Joseph Slote
It is well-known that every -qubit unitary can be implemented by a -depth quantum circuit using single- and two-qubit gates. It has been open whether exponential depth…
Prove2Me: An Open Collaborative Platform for Scaling Math Formalization
Shuze Chen, Kunal Marwaha, Xiaoyang Lu +2
Proof assistants such as Lean 4 promise the paradigm of formally verified mathematics, but large-scale formalization projects have faced major barriers to entry, including the need…
New bounds on private simultaneous quantum message passing
Uma Girish, Alex May, Natalie Parham +1
In the private simultaneous message (PSM) setting, players obtain inputs and then each send messages to a referee, who should learn but no ot…
How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
James Bartusek, Zikuan Huang, Leo Orshansky +1
While quantum position verification aims to certify a prover's location using quantum information, existing security definitions only guarantee that part of the successful adversar…
On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem
Zvika Brakerski, Henry Yuen
We consider the task of constructing pseudorandom unitaries (PRUs) with scalable security, i.e. families in which the security parameter may vary independently of the dimension (or…
A complexity theory for non-local quantum computation
Andreas Bluhm, Simon Höfer, Alex May +3
Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it…