Speaker
Description
Quantum guessing games provide a framework for analyzing how information encoded in quantum states can be optimally extracted through measurement. Beyond the standard role of side information, we introduce the concept of metainformation: knowledge that further side information of a certain type will later become available, even if it is not yet revealed. This distinction uncovers a finer structure in the interplay between timing, information, and strategy, and shows that metainformation can, in some scenarios, raise success probabilities to match those achievable with prior side information. Metainformation connects directly to two applications: the detection of quantum incompatibility and parallel hybrid computation. This talk outlines the basic framework of metainformation and reviews these applications.
