9 papers
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…
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…
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…
Private Proofs of When and Where
Uma Girish, Greg Gluch, Shafi Goldwasser +3
Position verification schemes are interactive protocols where entities prove their physical location to others; this enables interactive proofs for statements of the form "I am at…
Computer Science Challenges in Quantum Computing: Early Fault-Tolerance and Beyond
Jens Palsberg, Jason Cong, Yufei Ding +7
Quantum computing is entering a period in which progress will be shaped as much by advances in computer science as by improvements in hardware. The central thesis of this report is…