Andrea Coladangelo: A simple two-player dimension witness based on embezzlement

Channel:
United States QuICS
Subscribers:
2,470
Published on ● Video Link: https://www.youtube.com/watch?v=WP2dzRlTdz0


Duration: 58:05
471 views
0

This talk is about certifying high-dimensional entanglement in the setting of non-local games. In a non-local game, two or more non-communicating, but entangled, players cooperatively try to win a game consisting of a one-round interaction with a classical referee. In this talk, I will describe a strikingly simple two-player non-local game with the property that an epsilon-close to optimal strategy requires the two players to share an entangled state of dimension 2^{1/poly(epsilon)}. In particular, a successful strategy in this game requires the two players to be able to "embezzle" an EPR pair into a product state, a task that is known to be impossible to perform exactly, and that requires an exponentially increasing amount of entanglement to perform to increasing precision. The design of such a non-local game is inspired by techniques from device-independent self-testing. As a corollary, our game provides a new and (arguably) elementary proof of the non-closure of the set of quantum correlations, a celebrated recent result in quantum information theory. Previous proofs employed representation theoretic machinery for finitely-presented groups and C^* algebras.



Other Videos By QuICS


2020-07-23Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem
2020-06-19William Slofstra: Arkhipov's theorem, games, groups, and graphs
2020-06-10Ramis Movassagh:Cayley path & quantum supremacy:Average case # P-Hardness of random circuit sampling
2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?
2020-02-05Giacomo Torlai: Enhancing Quantum Simulators with Neural Networks
2019-11-21Felix Leditzky: Playing Games with Multiple Access Channels
2019-11-14Anand Natarajan: NEEXP ⊆ MIP*
2019-11-14Alex B. Grilo: Recent advances in Zero-knowledge proofs in the quantum setting
2019-10-03Andrea Coladangelo: A simple two-player dimension witness based on embezzlement
2019-09-06John Preskill: Quantum speedups in the NISQ era
2019-09-06Aditya Nema: Unitary Designs and quantum channels with super additive classical capacity
2019-09-06Krysta Svore: Programming for quantum solutions today and tomorrow
2019-09-06R. Teal Witter: Applications of the quantum algorithm for st-connectivity
2019-09-06Ashley Montanaro: Applying quantum algorithms to constraint satisfaction problems
2019-09-06Ken Brown: Error Reduction, Fault Tolerance, and Scalability
2019-09-06Bryan O'Gorman: Parametrization of tensor network contraction
2019-09-06David Gosset: Simulation of quantum circuits by low-rank stabilizer decompositions
2019-09-06Elizabeth Crosson: De-signing Hamiltonians for Quantum Annealing
2019-09-06Paul Boes: Catalytic Quantum Randomness and Von Neumann entropy from unitarity