- Watch an introductory talk presenting some of my research in quantum cryptography at the Caltech Computes conference in November 2016.
- Postdoctoral positions at Caltech are available through the IQIM (deadline: December 2nd) and the CMI (deadline TBA). Apply!
- In Winter 2016 I am teaching CMS 139, advanced algorithms.
- I organize the CMS Theory seminar.
- I help organize TCS+, an online seminar series in theoretical computer science, accessible to the widest possible audience, and ensuring a carbon-free dissemination of ideas across the globe. See our website for more information.
My research is centered around problems at the interface of theoretical computer science, quantum information and cryptography. I like to use complexity theory as a tool to study problems in quantum computing, and quantum mechanical phenomena as a way to gain a new perspective on classical concepts from theoretical computer science.
- Fall 2016: CS/Ph 120, Quantum Cryptography. Also offered as an EdX course!
- Spring 2016: CS 101, Introduction to modern cryptography.
- Winter 2016: CS/CMS 139, Advanced Algorithms.
- Spring 2015: CS/CMS 139, Advanced Algorithms.
- Fall 2014: CS286, Seminar in Computer Science. Topic: around the Quantum PCP conjecture.
- Overlapping Qubits
With Rui Chao, Ben Reichardt, Chris Sutherland.
Technical report arXiv:1701.01062.
- Focus on device independent quantum information
With Stefano Pironio, Valerio Scarani. Closing editorial for New Journal of Physics special issue on device independence.
- Robust self-testing of many-qubit states
With Anand Natarajan.
Technical report arXiv:1610.03574.
- QCMA hardness of ground space connectivity for commuting Hamiltonians
With David Gosset, Jenish Mehta.
Technical report arXiv:1610.03582.
- Quantum Proofs
With John Watrous. NOW Foundations and Trends in Theoretical Computer Science, Vol. 11, No. 1-2 (2015) 1-215 (journal link).
Technical report arXiv:1610.01664.
- Test for a large amount of entanglement, using few measurements
With Rui Chao, Ben Reichardt, Chris Sutherland.
Technical report arXiv:1610.00771.
- Entanglement of approximate quantum strategies in XOR games
With Dimiter Ostrev.
Technical report arXiv:1609.01652.
- Privacy Amplification Against Active Quantum Adversaries
With Gil Cohen.
Technical report arXiv:1608.06318.
- A simple proof of Renner's exponential de Finetti theorem
With Henry Yuen.
Technical report arXiv:1608.04814.
- Simple and tight device-independent security proofs
With Rotem Arnon-Friedman, Renato Renner. Appeared in Qcrypt'16.
Technical report arXiv:1607.01797.
- Overlapping Qubits, Theory Colloquium, UT Austin, 02 Dec 2016.
- Overlapping Qubits, Workshop on Subfactor Theory, Quantum Field Theory, and Quantum Information, Harvard University, Cambridge, 09 Oct 2016.
- Overlapping Qubits, QuPa seminar day, Institut Henri Poincare, Paris, 07 Jul 2016.
- Device independent quantum cryptography, MIT CIS seminar, MIT, 16 Mar 2016.
- Anchoring games for parallel repetition, UCSD theory seminar, UCSD, 08 Feb 2016.
- Interactive proofs for local Hamiltonians, Workshop on the Frontiers of Quantum Information and Computer Science, QUICS, University of Maryland, 01 Oct 2015 (video).
- A multiprover interactive proof system for the local Hamiltonian problem, Quantum Hamiltonian Complexity Reunion at the Simons Institute, Berkeley, 04 May 2015.
- Non-Signalling Parallel Repetition Via de Finetti Reductions, UCLA theory seminar, UCLA, 28 Apr 2015.
- Non-Signalling Parallel Repetition Via de Finetti Reductions, Simons Institute workshop on Information Theory in Complexity Theory and Combinatorics, Berkeley, 22 Apr 2015.
- Noncommutative Grothendieck inequalities and quantum two-player games, BMC Mini-Symposia on Quantum Information, Cambridge, UK, 01 Apr 2015.
- Quantum XOR Games, Banff workshop on Hypercontractivity and Log Sobolev Inequalities in Quantum Information Theory, Banff, 24 Feb 2015.
- A multiprover interactive proof system for the local Hamiltonian problem, QIP 2015, Sydney, 16 Jan 2015.
- The quantum PCP conjecture, PCQC inauguration workshop, Paris, 28 Aug 2014.
- Tutorial on the quantum PCP conjecture, AQIS, Kyoto, 20 Aug 2014.
- Parallel repetition of entangled projection games, ELC Workshop at the University of Tokyo on Quantum Complexity Theory, Tokyo, 18 Aug 2014.
- Managing Editor for Theory of Computing.
- Editor for Quantum.
- Member of the Steering Committee of the ITCS (Innovations in Theoretical Computer Science) series of conferences.
- Program Committee member for QIP 2012, QCRYPT 2012, FSTTCS 2013, QIP 2014, STOC 2014, RANDOM 2014, QCRYPT 2014, ITCS 2015, TQC 2015, ITCS 2016, QIP 2016, CCC 2016, FOCS 2016.
- Refereed for journals SICOMP, JACM, TOC, Nature, Complexity, QIC, PRL, PRA, PRX and conferences STOC, FOCS, ITCS, CCC, APPROX/RANDOM, Crypto, QIP.
- I organized the at Caltech, on November 11th 2016.
- In October 2015, together with Artur Ekert, Renato Renner, Miklos Santha and Umesh Vazirani I organized a small workshop on foundations of randomness at the Stellenbosch Institute for Advanced Study (STIAS) in South Africa. See the webpage or this blog post and follow-up posts (first talk, day 1, day 2, day 3) for information on the workshop.
- In February 2014 I co-organized (with Dorit Aharonov and John Watrous) a one-week workshop on Quantum Games and Protocols at the Simons Institute in Berkeley. This was the first out of three workshops in the special semester on Quantum Hamiltonian Complexity at the institute. See the Simons website for videos of all talks, this blog post for a summary of the workshop, this one describing a (personal) scientific outcome of the workshop.