Bio
Thomas Vidick is an Assistant Professor in the department of Computing and Mathematical Sciences at the California Institute of Technology, where he is also a member of the Institute for Quantum Information and Matter. He received his Ph.D. from UC Berkeley in 2011 and spent two years as a postdoc at the Massachusetts Institute of Technology.
His main works are in quantum complexity and cryptography, with a focus on employing techniques from computer science to tackle deep problems in quantum information.
research interest
Problems at the interface of theoretical computer science, quantum information and cryptography.
More info
position
Assistant professor of Computing and Mathematical Sciences, California Institute of Technology
degrees
PhD in Computer Science, University of California, Berkeley
MSc in Computer Science, University Paris 7, Paris
BSc in Computer Science, École Normale Supérieure, Paris
Publications
Recent publications:
- A simple proof of the detectability lemma and spectral gap amplification (Abstract), With Anurag Anshu, Itai Arad., Technical report arXiv:1602.0121.
- Anchoring games for parallel repetition (Abstract), With Mohammad Bavarian, Henry Yuen. To be presented at QIP'16, Technical report arXiv:1509.07466.
- Interactive proofs with approximately commuting provers (Abstract), With Matthew Coudron. To be presented at QIP'16. Proceedings of ICALP'15, Technical report arXiv:1510.00102.
- Non-signalling parallel repetition using de Finetti reductions (Abstract), With Rotem Arnon-Friedman, Renato Renner. IEEE Transactions on Information Theory, 2014, Technical report arXiv:1411.1582.
- A multiprover interactive proof system for the local Hamiltonian problem (Abstract), With Joseph Fitzsimons. Proceedings of ITCS'15, Technical report arXiv:1409.026.
