#### Filter Results:

- Full text PDF available (69)

#### Publication Year

2008

2018

- This year (6)
- Last 5 years (57)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Phong Q. Nguyen, Thomas Vidick
- J. Mathematical Cryptology
- 2008

The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutineâ€¦ (More)

- Tsuyoshi Ito, Thomas Vidick
- 2012 IEEE 53rd Annual Symposium on Foundations ofâ€¦
- 2012

We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages havingâ€¦ (More)

- Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner
- SIAM J. Comput.
- 2012

Randomness extraction involves the processing of purely classical information and is therefore usually studied in the framework of classical probability theory. However, such a classical treatment isâ€¦ (More)

- Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
- 2008 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

We establish the first hardness results for the problem of computing the value of one-round games played by a referee and a team of players who can share quantum entanglement. In particular, we showâ€¦ (More)

- Rotem Arnon Friedman, Renato Renner, Thomas Vidick
- ArXiv
- 2016

Proving security of device-independent (DI) cryptographic protocols has been regarded to be a complex and tedious task. In this work we show that a newly developed tool, the â€œentropy accumulationâ€¦ (More)

- Thomas Vidick
- 2013 IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

We show that for any Îµ > 0 the problem of finding a factor (2 - Îµ) approximation to the entangled value of a three-player XOR game is NP-hard. Equivalently, the problem of approximating the largestâ€¦ (More)

Computing ground states of local Hamiltonians is a fundamen tal problem in condensed matter physics. We give the first randomized polynomial-time algorithm for fi nding ground states of gappedâ€¦ (More)

- Umesh Vazirani, Thomas Vidick
- Physical review letters
- 2014

Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies areâ€¦ (More)

- Umesh Vazirani, Thomas Vidick
- Philosophical transactions. Series Aâ€¦
- 2012

We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n random bits that are Îµ-close in statistical distance from n uniformly distributed bits, startingâ€¦ (More)

- Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
- computational complexity
- 2008

The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared among provers affects the verification power of the proof system. We study for the firstâ€¦ (More)