Solution to the mean king's problem using quantum error-correcting codes
arXiv:1507.07072 · doi:10.1103/PhysRevA.91.052326
Abstract
We discuss the so-called mean king's problem, a retrodiction problem among non-commutative observables, in the context of error detection. Describing the king's measurement effectively by a single error operation, we give a solution of the mean king's problem using quantum error-correcting codes. The existence of a quantum error-correcting code from a solution is also presented.
arXiv comment7 pages, 2 tables
References in corpus (10)
- The mean king's problem: Prime degrees of freedom
- Mean king's problem with mutually unbiased bases and orthogonal Latin squares
- The mean king's problem: Spin 1
- Solution to the Mean King's problem with mutually unbiased bases for arbitrary levels
- Solution to the King's Problem in prime power dimensions
- A Meaner King uses Biased Bases
- Maximal Entanglement, Collective Coordinates and Tracking the King
- Best conventional solutions to the King's Problem
- Solution to the King's problem with observables being not mutually complementary
- Comments on "Best conventional solutions to the King's problem"
Cited by in corpus (5)
- Generalized Pauli channels and a class of non-Markovian quantum evolution
- Uncertainty relations for general unitary operators
- Entanglement witnesses from mutually unbiased bases
- Experimental Solutions to the High-Dimensional Mean King's Problem
- Solutions to the mean king's problem: higher-dimensional quantum error-correcting codes