497 citations · 1.6k across the 74 of their papers we have counts for
13 papers · 1 filter
Robust self-testing of many-qubit states
Anand Natarajan, Thomas Vidick
We introduce a simple two-player test which certifies that the players apply tensor products of Pauli and observables on the tensor product of EPR pairs. The test h…
Quantum Proofs
Thomas Vidick, John Watrous
Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational a…
QCMA hardness of ground space connectivity for commuting Hamiltonians
David Gosset, Jenish C. Mehta, Thomas Vidick
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (e…
Test for a large amount of entanglement, using few measurements
Rui Chao, Ben W. Reichardt, Chris Sutherland +1
Bell-inequality violations establish that two systems share some quantum entanglement. We give a simple test to certify that two systems share an asymptotically large amount of ent…
Entanglement of approximate quantum strategies in XOR games
Dimiter Ostrev, Thomas Vidick
We show that for any there is an XOR game with inputs for one player and inputs for the other pla…
A simple proof of Renner's exponential de Finetti theorem
Thomas Vidick, Henry Yuen
We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma,…