Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1310.2543 · Europhysics Letters (EPL)

Quantum-mechanical retrodiction through an extended mean king problem

Amir Kalev, A. Mann, M. Revzen

Published Dec 1, 2013• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1209/0295-5075/104/50008

Related papers

Meaner king uses biased bases

Michael Reimpell, Reinhard F. Werner

The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement made in one of several different orthonormal bases. Alice is allowed to prepare the state of the system and to do a final measurement, possibly including an entangled copy. However, Alice gains knowledge about which basis was measured only after she no longer has access to the quantum system or its copy. We give a necessary and sufficient condition on the bases, for Alice to have a strategy to solve this problem, without assuming that the bases are mutually unbiased. The condition requires the existence of an overall joint probability distribution for random variables, whose marginal pair distributions are fixed as the transition probability matrices of the given bases. In particular, in the qubit case the problem is decided by Bell's original three variable inequality. In the standard setting of mutually unbiased bases, when they do exist, Alice can always succeed. However, for randomly chosen bases her success probability rapidly goes to zero with increasing dimension.

arXiv:quant-ph/0612035•Physical Review A•Jun 28, 2007•16 citations

Experimental Test of Tracking the King Problem

Cheng-Qiu Hu, Jun Gao, Lu-Feng Qiao +7 more

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.

arXiv:1812.07601•Research•Jan 1, 2019•4 citations

The Mean King's Problem: Experimental Realization

O. Schulz, Ruprecht Steinhübl, Markus Weber +3 more

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%.

•Sep 24, 2002•1 citation

Solution to the mean king's problem using quantum error-correcting codes

M. Yoshida, Gen Kimura, Takayuki Miyadera +2 more

We discuss the so-called mean king's problem, a retrodiction problem among noncommutative 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:1507.07072•Physical Review A•May 26, 2015•5 citations

Best Conventional Solutions to the King’s Problem

P. K. Aravind

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.

arXiv:quant-ph/0306119•Zeitschrift für Naturforschung A•Dec 1, 2003•12 citations

Quantum key distribution using Mean King problem with modified measurement schemes

M. Yoshida, Takayuki Miyadera, Hideki Imai

In 2001, Jefferey Bub proposed a quantum key distribution protocol using the Mean King problem. In the protocol, King chooses one of the observables σ x or σ z , while Alice is required to measure an observable that solves the Mean King problem for three observables σ x , σ y and σ z . The observable employed by Alice is thus rather complicated. In this paper, we give other simple solutions of the Mean King problem for two observables and examine the quantum key distribution protocols using them. Our result shows that not all the solutions of the Mean King problem are available to construct a secure protocol. In addition, we consider a protocol that is tolerant with three attack scenarios and derive a trade-off inequality between Eve's information gain and error probability observed by the legitimate users.

International Symposium on Information Theory and its Applications•Oct 1, 2012•4 citations
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.
The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement made in one of several different orthonormal bases. Alice is allowed to prepare the state of the system and to do a final measurement, possibly including an entangled copy. However, Alice gains knowledge about which basis was measured only after she no longer has access to the quantum system or its copy. We give a necessary and sufficient condition on the bases, for Alice to have a strategy to solve this problem, without assuming that the bases are mutually unbiased. The condition requires the existence of an overall joint probability distribution for random variables, whose marginal pair distributions are fixed as the transition probability matrices of the given bases. In particular, in the qubit case the problem is decided by Bell's original three variable inequality. In the standard setting of mutually unbiased bases, when they do exist, Alice can always succeed. However, for randomly chosen bases her success probability rapidly goes to zero with increasing dimension.
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.
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 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.
In 2001, Jefferey Bub proposed a quantum key distribution protocol using the Mean King problem. In the protocol, King chooses one of the observables σ x or σ z , while Alice is required to measure an observable that solves the Mean King problem for three observables σ x , σ y and σ z . The observable employed by Alice is thus rather complicated. In this paper, we give other simple solutions of the Mean King problem for two observables and examine the quantum key distribution protocols using them. Our result shows that not all the solutions of the Mean King problem are available to construct a secure protocol. In addition, we consider a protocol that is tolerant with three attack scenarios and derive a trade-off inequality between Eve's information gain and error probability observed by the legitimate users.