Back to search

Virginia Tech

Four Variants of the Mean King Problem

Abstract

dc:description.abstract

In this thesis, we study several variants of the Mean King problem from the perspective of quantum information and optimization. The Mean King problem is a quantum guessing task, where one party prepares a quantum state, another party performs a measurement chosen from a given set of bases, and the first party tries to guess the measurement outcome. We consider four variants of this problem, including both non-interactive and interactive settings. We analyze their optimal guessing performance in both the average-case and the worst-case settings. We formulate the success probabilities of these Mean King games as optimization problems over quantum states and measurement strategies. This approach gives a unified way to study the different variants. For the non-interactive games, we derive the winning operators and show that some of the optimization problems can be reduced to eigenvalue computations. For the interactive games, we formulate them as semidefinite programs. These programs include extra constraints that come from returned information and partial trace conditions. These formulations support both theoretical analysis and numerical computation. We use MATLAB and CVX to compute optimal success probabilities for several choices of measurement bases. These bases include mutually unbiased bases and rotated bases. The results show how the choice of measurement bases affects the guessing probability. The results also show the difference between average-case and worst-case performance across different Mean King variants. In particular, in one variant, the numerical results for two and three mutually unbiased bases are close to the known success probabilities of the 2 → 1 and 3 → 1 quantum random access code tasks. These numerical similarities suggest that Mean King problems and random access codes may share a deeper connection. This observation gives a possible direction for future work.

Degree

thesis:*
Name thesis:degree_name
Master of Science
Level thesis:degree_level
masters
Discipline thesis:degree_discipline
Computer Science & Applications
Department dc:contributor.department
Computer Science and#38; Applications
Grantor dc:publisher
Virginia Tech
Year dc:date.issued
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zhu, Xinbei
Chair dc:contributor.committeechair
  • Sikora, Jamie
Committee members dc:contributor.committeemember
  • Mantri, Atul
  • Khatri, Sumeet

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Other
vt_gsexam:47063

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Zhu, Xinbei. Four Variants of the Mean King Problem. masters thesis, Virginia Tech, 2026. https://hdl.handle.net/10919/143372