In the Mean King's Problem a ship-wrecked physicist is challenged to infer the outcome of an intermediate spin measurement by a suitable preparation in conjunction with an appropriate control measurement -- the 1987 spin retrodiction puzzle of Vaidman, Aharonov, and Albert. We report the experimental realization of a quantum-optical version in which the outcome of an intermediate polarization projection is inferred by exploiting single-photon two-qubit states. The experimental success probability is consistently above the 90.2% threshold of the optimal one-qubit strategy, with an average success probability of 95.6%.
In the Mean King's Problem a ship-wrecked physicist is challenged to infer the outcome of an intermediate spin measurement by a suitable preparation in conjunction with an appropriate control measurement -- the 1987 spin retrodiction puzzle of Vaidman, Aharonov, and Albert. We report the experimental realization of a quantum-optical version in which the outcome of an intermediate polarization projection is inferred by exploiting single-photon two-qubit states. The experimental success probability is consistently above the 90.2% threshold of the optimal one-qubit strategy, with an average success probability of 95.6%.
In the 1987 spin-retrodiction puzzle of Vaidman, Aharonov, and Albert one is challenged to ascertain the values of sigma(x), sigma(y), and sigma(z) of a spin-1/2 particle by utilizing entanglement. We report the experimental realization of a quantum-optical version in which the outcome of an intermediate polarization projection is inferred by exploiting single-photon two-qubit quantum gates. The experimental success probability is consistently above the 90.2% threshold of the optimal one-qubit strategy, with an average success probability of 95.6%.
The mean king problem is a conditional retrodiction problem. In this problem Alice prepares a two prime-dimensional particles state and avails one of the particles to the king who measures its state in one of mutually unbiased bases of his choice. The king tells Alice his choice of basis after she completes a control measurement on his particle. Conditioned on this knowledge, she now infers the state observed by the king by utilizing the outcome of her control measurement. In the extended mean king problem, studied in this paper, the king does not tell Alice his measurement basis, but instead both the king and Alice repeat their measurements. Proper ordering of these allows Alice to deduce both the basis used by the king and the outcome of his first measurement, with the king reticent throughout, i.e., this protocol effects a (almost) complete retrodiction of the king's first measurement.
In quantum theory, the retrodiction problem is not as clear as its classical counterpart because of the uncertainty principle of quantum mechanics. In classical physics, the measurement outcomes of the present state can be used directly for predicting the future events and inferring the past events which is known as retrodiction. However, as a probabilistic theory, quantum-mechanical retrodiction is a nontrivial problem that has been investigated for a long time, of which the Mean King Problem is one of the most extensively studied issues. Here, we present the first experimental test of a variant of the Mean King Problem, which has a more stringent regulation and is termed "Tracking the King." We demonstrate that Alice, by harnessing the shared entanglement and controlled-not gate, can successfully retrodict the choice of King's measurement without knowing any measurement outcome. Our results also provide a counterintuitive quantum communication to deliver information hidden in the choice of measurement.
The mean King problem is a conditional retrodiction problem. In this problem Alice prepares a two prime-dimensional particles state and avails one of the particles to the King who measures its state in one of mutually unbiased bases of his choice. The King tells Alice his choice of basis after she completes a control measurement on his particle. Conditioned on this knowledge, she now infers the state observed by the King by utilizing the outcome of her control measurement. In the extended mean King problem, studied in this paper, the King does not tell Alice his measurement basis, but instead both the King and Alice repeat their measurements. Proper ordering of these allows Alice to deduce both the basis used by the King and the outcome of his first measurement, with the King reticent throughout, i.e., this protocol effects a complete (almost) retrodiction of the King's first measurement.
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.
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.