Talks

General-audience talks

• A public lecture (in French) delivered at the Institut Henri Poincare in Paris, as part of the special semester on Analysis in Quantum Information Theory.
• An introductory talk presenting some of my research in quantum cryptography at the Caltech Computes conference in November 2016.

All talks

• MIP* = RE and Tsirelson's problem. ICMP (invited Plenary). Geneva, 2021-08-04.
• Classical proofs of Quantum Knowledge. Dagstuhl seminar on quantum complexity. Dagstuhl, 2021-06-29.
• Cryptographic tests of quantumness. Seminaire du DI. Ecole Normale Superieure (online), 2021-03-17. (video)
• Testing quantum systems in the high-complexity regime. Max Planck distinguished speaker series on quantum computing. Max Planck Institute, Germany (online), 2021-02-11.
• Connes embedding problem, Tsirelson's problem, and MIP* = RE. Math Colloquium. Caltech (online), 2021-02-02.
• MIP* = RE and Tsirelson's problem. QIP 2021. Munich, Germany (online), 2021-02-01. (video)
• MIP* = RE. IQFA conference. Grenoble, France (online), 2020-12-03.
• MIP* = RE. Operator Algebras Seminar. Universite Paris 6, France (online), 2020-11-26.
• MIP* = RE: Verifying the halting problem with quantum provers. CCC 2020 conference (invited). Saarbrucken, Germany (online), 2020-07-28.
• Tsirelson's problem in quantum information and connections with operator algebras and quantum complexity theory. Math Colloquium. Tel-Aviv University (online), 2020-05-04.
• The complexity-theoretic approach to Connes’ Embedding Problem. Functional Analysis Seminar. UCLA, 2020-01-08.
• Quantum Protocols. Three lectures given at the 4th Winter School in Computer Science and Engineering. Hebrew Univerity, Jerusalem, 2019-12-15.
• Secure Computation with Quantum Devices: From Device-Independent Cryptography to Verificationof Quantum Computers. Invited talk at US-Israel Blavatnik Scientific Forum on computer science and its impact on our future. Jerusalem, 2019-09-17.
• A complexity-theoretic approach to disproving Connes' Embedding Problem. Workshop on The Many Faceted Connes Embedding Problem. Banff, 2019-07-15.
• Topics in quantum complexity and cryptography. Invited survey at It for Qubit summer school. Kyoto, 2019-06-18.
• Survey on quantum program checking and quantum multiprover interactive proof systems. Invited talk at HALG 2019. Copenhagen, 2019-06-15.
• Computationally-secure and composable remote state preparation. Bay area crypto day. Stanford, 2019-05-10.
• Classical Zero Knowledge Arguments for Quantum Computations. Blockchains, Micropayments and Zero Knowledge (ZK Day 2019). Simons Institute, Berkeley, 2019-04-13. (video)
• Cryptographic tests of quantumness. Invited distinguished lecture, Hebrew University. Jerusalem, 2019-04-03.
• Quantum PCPs. Hebrew University theory seminar. Jerusalem, 2019-03-27.
• Unitary correlation sets. ACO seminar. UC Irvine, 2019-01-31.
• Classical verification of quantum computations. Invited talk at the JMM 2019. Baltimore, 2019-01-18.
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Contributed talk at QIP'19. Boulder, 2019-01-15.
• Verification of quantum computations. Invited tutorial at QIP'19. Boulder, 2019-01-13. (video)
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Contributed talk at FOCS'18. Paris, 2018-10-08.
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Stanford Institute for Theoretical Physics seminar. Stanford, 2018-09-27.
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Invited talk at AQIS 2018. Nagoya, Japan, 2018-09-11.
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Invited talk at QCRYPT 2018. Shanghai, China, 2018-08-27. (video)
• Tutorial - Quantum PCPs. BIRS workshop on analytic techniques in theoretical computer science. Oaxaca, Mexico, 2018-08-15. (video)
• Quantum-proof extractors: definition, constructions, applications, and open questions. STOC 2018 Theory Fest workshop on Randomness Extractors: Constructions and Applications. Los Angeles, 2018-06-29.
• Unitary correlation sets. Workshop on Approximation Properties in Operator Algebras and Ergodic Theory. IPAM, Los Angeles, 2018-05-02. (video)
• Entanglement requirements for non-local games. Plenary talk at QIP 2018. Delft, Netherlands, 2018-01-18. (video)
• Tests for n qubits. KITP conference on Frontiers of Quantum Information Physics. KITP, Santa Barbara, 2017-10-10. (video)
• Entanglement Tests from Group Representations. Theory seminar. CQT Singapore, 2017-08-23.
• Entanglement Tests from Group Representations. Workshop on Probabilistic and Algebraic Methods in Quantum Information Theory. Texas A&M University, 2017-07-17.
• Robust and/or efficient tests for high-dimensional entanglement. TYQI 2017, Paris. Paris, 2017-06-19.
• Rigorous RG algorithms and area laws for low energy eigenstates in 1D. IQC, Waterloo. Waterloo, 2017-03-27.
• Rigorous RG algorithms and area laws for low energy eigenstates in 1D. QIP'17. Seattle, 2017-01-19. (video)
• Overlapping Qubits. Theory Colloquium. UT Austin, 2016-12-02.
• Overlapping Qubits. Workshop on Subfactor Theory, Quantum Field Theory, and Quantum Information. Harvard University, Cambridge, 2016-10-09.
• Overlapping Qubits. QuPa seminar day. Institut Henri Poincare, Paris, 2016-07-07.
• Device independent quantum cryptography. MIT CIS seminar. MIT, 2016-03-16.
• Anchoring games for parallel repetition. UCSD theory seminar. UCSD, 2016-02-08.
• Interactive proofs for local Hamiltonians. Workshop on the Frontiers of Quantum Information and Computer Science. QUICS, University of Maryland, 2015-10-01. (video)
• A multiprover interactive proof system for the local Hamiltonian problem. Quantum Hamiltonian Complexity Reunion at the Simons Institute. Berkeley, 2015-05-04.
• Non-Signalling Parallel Repetition Via de Finetti Reductions. UCLA theory seminar. UCLA, 2015-04-28.
• Non-Signalling Parallel Repetition Via de Finetti Reductions. Simons Institute workshop on Information Theory in Complexity Theory and Combinatorics. Berkeley, 2015-04-22.
• Noncommutative Grothendieck inequalities and quantum two-player games. BMC Mini-Symposia on Quantum Information. Cambridge, UK, 2015-04-01.
• Quantum XOR Games. Banff workshop on Hypercontractivity and Log Sobolev Inequalities in Quantum Information Theory. Banff, 2015-02-24.
• A multiprover interactive proof system for the local Hamiltonian problem. QIP 2015. Sydney, 2015-01-16.
• The quantum PCP conjecture. PCQC inauguration workshop. Paris, 2014-08-28.
• Tutorial on the quantum PCP conjecture. AQIS. Kyoto, 2014-08-20.
• Parallel repetition of entangled projection games. ELC Workshop at the University of Tokyo on Quantum Complexity Theory. Tokyo, 2014-08-18.
• A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians. PiQuDos seminar at Perimeter Institute. Waterloo, 2014-05-14. (video)
• A Polynomial-time Algorithm for Finding Ground States of Gapped Local Hamiltonians in 1D. Workshop on Tensor Networks and Simulations, Simons Institute. Berkeley, 2014-04-23. (video)
• A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians. SQUINT. Santa Fe, 2014-02-20.
• Simulating quantum mechanics: the complexity of the local Hamiltonian problem. 32nd Annual Western States Mathematical Physics Meeting. Pasadena, 2014-02-18.
• A parallel repetition theorem for entangled projection games. QIP'14. Barcelona, 2014-02-03.
• The quantum PCP conjecture. Quantum Hamiltonian Complexity boot camp at the Simons Institute. Berkeley, 2014-01-17. (video)
• Mini Crash Course on Quantum Games and Semidefinite Programming. Quantum Hamiltonian Complexity boot camp at the Simons Institute. Berkeley, 2014-01-15. (video)
• A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians. ITCS'14. Princeton,, 2014-01-13.
• Fully device independent quantum key distribution. ITCS'14. Princeton, 2014-01-12.
• Parallel repetition via a relaxation. IMS workshop on quantum moment problems. Singapore, 2013-12-11.
• The complexity of entangled games. invited talk at the "UCL-Paris Quantum Connection" workshop at UCL. London, 2013-11-5.
• The complexity of entangled games. NYU Theory seminar. New York, 2013-11-01.
• Three-player entangled XOR games are NP-hard to approximate. FOCS 2013. Berkeley, 2013-10-29.
• Entanglement in XOR games. introductory talk given in the workshop on "New Mathematical Directions for Quantum Information" at the Newton Institute. Cambridge, 2013-09-03. (video)
• The complexity of entangled games. QSTART conference, Hebrew University. Jerusalem, 2013-06-25. (video)
• Fully device-independent quantum key distribution. invited talk at the March meeting of the APS. Baltimore, 2013-03-18.
• The complexity of entangled games. Workshop on Hamiltonian complexity, Simons institute. Berkeley, 2013-03-23.
• Fully device-independent quantum key distribution. Plenary talk at QIP'13. Beijing, 2013-03-23. (video)
• MIP* contains NEXP. Invited talk at QIP'13. Beijing, 2013-01-22. (video)
• Fully device-independent quantum key distribution. Invited talk at the CIFAR Workshop on quantum information theory. Ottawa, 2012-11-25.
• On the complexity of multi-prover interactive proofs with entangled provers. Berkeley theory seminar. Berkeley, 2012-11-05.
• Efficient rounding for the noncommutative Grothendieck inequality. Theory lunch. Berkeley, 2012-10-31.
• MIP* contains NEXP. FOCS 2012. New Brunswick, 2012-10-21.
• Certifiable Quantum Dice. QCRYPT 2012. Singapore, 2012-09-09.