It is shown how to ascertain the values of a complete set of mutually complementary observables of a prime power degree of freedom by generalizing the solution in prime dimensions given by Englert and Aharonov [Phys. Lett. A284, 1 - 5 (2001)].
We investigate the king's problem of the measurement of operators ${\stackrel{P\vec}{n}}_{k}∙\stackrel{P\vec}{\ensuremath{\sigma}}$ (k=1, 2, 3) instead of the three Cartesian components ${\ensuremath{\sigma}}_{x},{\ensuremath{\sigma}}_{y}$, and ${\ensuremath{\sigma}}_{z}$ of the spin operator $\stackrel{P\vec}{\ensuremath{\sigma}}$. Here, ${\stackrel{P\vec}{n}}_{k}$ are three-dimensional real unit vectors. We show the condition over three vectors ${\stackrel{P\vec}{n}}_{k}$ to ascertain the result for measurement of any one of these operators.
In the King’s Problem, a physicist is asked to prepare a d-state quantum system in any state of her choosing and give it to a king who measures one of (d+1) sets of mutually unbiased observables on it. The physicist is then allowed to make a control measurement on the system, following which the king reveals which set of observables he measured and challenges the physicist to predict correctly all the eigenvalues he found. This paper obtains an upper bound on the physicist’s probability of success at this task if she is allowed to make measurements only on the system itself (the “conventional” solution) and not on the system as well as any ancillary systems it may have been coupled to in the preparation phase, as in the perfect solutions proposed recently. An optimal conventional solution, with a success probability of 0.7, is constructed in d = 4; this is to be contrasted with the success probability of 0.902 for the optimal conventional solution in d = 2. The gap between the best conventional solution and the perfect solution grows quite rapidly with increasing d.
Vaidman, Aharanov, and Albert [ Phys. Rev. Lett. 58 ( 14 ), 1385 ( 1987 ) 10.1103/PhysRevLett.58.1385 ] put forward a puzzle called the mean king’s problem (MKP) that can be solved only by harnessing quantum entanglement. Prime-powered solutions to the problem have been shown to exist, but they have not yet been experimentally realized for any dimension beyond two. We propose a general first-of-its-kind experimental scheme for solving the MKP in prime dimensions ( D ). Our search is guided by the digital discovery framework Pytheus , which finds highly interpretable graph-based representations of quantum optical experimental setups; using it, we find specific solutions and generalize to higher dimensions through human insight. As proof of principle, we present a detailed investigation of our solution for the three-, five-, and seven-dimensional cases. We obtain maximum success probabilities of 82.3%, 56.2%, and 35.5%, respectively. We therefore posit that our computer-inspired scheme yields solutions that implement Alice’s strategy with quantum advantage, demonstrating its promise for experimental implementation in quantum communication tasks.