PIRSA:20100027

Video URL

https://pirsa.org/20100027

Quantum preparation games

Weilenmann, M. (2020). Quantum preparation games. Perimeter Institute for Theoretical Physics. https://pirsa.org/20100027

Weilenmann, Mirjam. Quantum preparation games. Perimeter Institute for Theoretical Physics, Oct. 09, 2020, https://pirsa.org/20100027 

          @misc{ scivideos_PIRSA:20100027,
            doi = {10.48660/20100027},
            url = {https://pirsa.org/20100027},
            author = {Weilenmann, Mirjam},
            keywords = {Quantum Foundations},
            language = {en},
            title = {Quantum preparation games},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2020},
            month = {oct},
            note = {PIRSA:20100027 see, \url{https://scivideos.org/pirsa/20100027}}
          }

Mirjam Weilenmann Institute for Quantum Optics and Quantum Information (IQOQI) - Vienna

Talk numberPIRSA:20100027
DOI10.48660/20100027
Source RepositoryPIRSA
Collection
Talk Type Scientific Series
Subject

Abstract

To analyze the performance of adaptive measurement protocols for the detection and quanti cation of state resources, we introduce the framework of quantum preparation games. A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting at each round, as well as the final score of the game, are decided by the referee based on the past history of settings and measurement outcomes. We show how to compute the maximum average score that a player can achieve under very general constraints on their preparation devices and provide practical methods to carry out optimizations over n-round preparation games. We apply our general results to devise new adaptive protocols for entanglement detection and quanti cation. Given a set of experimentally available local measurement settings, we provide an algorithm to derive, via convex optimization, optimal n-shot protocols for entanglement detection using these settings. We also present families of non-trivial adaptive protocols for multiple-target entanglement detection with arbitrarily many rounds. Surprisingly, we find that there exist instances of entanglement detection problems with just one target entangled state where the optimal adaptive protocol supersedes all non-adaptive alternatives.