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

Quantum state retrodiction

Adam Nicholas. Hegarty, Seth Merkel

Published Jan 1, 2003• 0 citations
OpenAlex

Abstract

This project studies problem of quantum state retrodiction, which is concerned with determining the state of a quantum system at some time in the past on the basis of measurements made on it later. The problem is studied for quantum systems of two and four degrees of freedom, and an application of the latter solution is made to a modified version of the game Mastermind.

Related papers

Quantum Retrodiction

Stephen Mark Barnett, John Jeffers, David Thomas Pegg +2 more

Prediction, of course, is the making of statements about the likelihood of future events. retrodiction (or postdiction) is the making of statement about past events. In these lectures we shall study the rules governing retrodictive probabilities both in the quantum and classical domains. In doing so we develop a powerful tool with which to interpret physical phenomena and both analyse and interpret experiments. We use retrodictive methods to analyze a number of phenomena in quantum optics including the familiar photon antibunching, entanglement and ghost imaging and the perhaps less familiar ideas of quantum scissors, quantum computation in the past a single-particle analysis of two-particle interference. Quantum retrodiction is a quantitative theory and the familiar techniques for evolving quantum states and modelling open systems are applicable to retrodictive problems, but only with the introduction of some novel features. We conclude with a few remarks on more philosophical issues related to the arrow of time and wavefunction "collapse" in the measurement process. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Springer eBooks•Aug 29, 2005•7 citations

Playing Mastermind on quantum computers

Lvzhou Li, Jingquan Luo, Yongzhen Xu

From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community as a scientific issue. Mastermind with n positions and k colors is formally described as: the codemaker privately chooses a secret $s\in [k]^n$, and the coderbreaker want to determine $s$ in as few queries like $f_s(x)$ as possible to the codemaker, where $f_s(x)$ indicates how x is close to s. The complexity of a strategy is measured by the number of queries used. In this work we study playing Mastermind on quantum computers in both non-adaptive and adaptive settings, obtaining efficient quantum algorithms which are all exact (i.e., return the correct result with certainty) and show huge quantum speedups. Technically, we develop a three-step framework for designing quantum algorithms for the general string learning problem, which not only allows huge quantum speedups on playing Mastermind, but also may shed light on exploring quantum speedups for other string learning problems.

arXiv:2207.09356•Jul 19, 2022•4 citations

Quantum Pasts and the Utility of History

James B. Hartle

From data in the present we can predict the future and retrodict the past. These predictions and retrodictions are for histories — most simply time sequences of events. Quantum mechanics gives probabilities for individual histories in a decoherent set of alternative histories. This paper discusses several issues connected with the distinction between prediction and retrodiction in quantum cosmology: the difference between classical and quantum retrodiction, the permanence of the past, why we predict the future but remember the past, the nature and utility of reconstructing the past(s), and information theoretic measures of the utility of history.

WORLD SCIENTIFIC eBooks•Dec 9, 2020•4 citations

Quantum-mechanical retrodiction through an extended mean king problem

Amir Kalev, A. Mann, M. Revzen

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.

arXiv:1310.2543•Europhysics Letters (EPL)•Dec 1, 2013•7 citations

Experimental retrodiction of trajectories of single photons in double interferometers

Yuan Yuan, Zhibo Hou, Kang‐Da Wu +3 more

When a photon passes through an interferometer, quantum mechanics does not provide a clear answer as to its past. Quantum retrodiction is a quantitative theory, which endeavors to make statements about the past of a system based on present knowledge. Quantum retrodiction may be used to analyze the past of a photon, that is, its trajectory. Here we experimentally retrodict the trajectories of single photons in double interferometers by measuring the final state of the photon. A sequence of measurements is made on a photon to determine which path the photon followed, so a series of retrodiction of measurement results can be regarded as a photon trajectory. We obtain information about the partial trajectory and the entire trajectory of the photon. Furthermore, we also observe the effect of different measurements in the extraction of trajectory information. Our experiment highlights the application of retrodiction theory to the study of the photon's past, and provides potential application in quantum communications.

Physical Review A•Jun 15, 2018•3 citations

Quantum algorithm for Mastermind game

Xiaoming Sun

Science China Physics Mechanics and Astronomy•Oct 16, 2025•0 citations
This project studies problem of quantum state retrodiction, which is concerned with determining the state of a quantum system at some time in the past on the basis of measurements made on it later. The problem is studied for quantum systems of two and four degrees of freedom, and an application of the latter solution is made to a modified version of the game Mastermind.
Prediction, of course, is the making of statements about the likelihood of future events. retrodiction (or postdiction) is the making of statement about past events. In these lectures we shall study the rules governing retrodictive probabilities both in the quantum and classical domains. In doing so we develop a powerful tool with which to interpret physical phenomena and both analyse and interpret experiments. We use retrodictive methods to analyze a number of phenomena in quantum optics including the familiar photon antibunching, entanglement and ghost imaging and the perhaps less familiar ideas of quantum scissors, quantum computation in the past a single-particle analysis of two-particle interference. Quantum retrodiction is a quantitative theory and the familiar techniques for evolving quantum states and modelling open systems are applicable to retrodictive problems, but only with the introduction of some novel features. We conclude with a few remarks on more philosophical issues related to the arrow of time and wavefunction "collapse" in the measurement process. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community as a scientific issue. Mastermind with n positions and k colors is formally described as: the codemaker privately chooses a secret s∈[k]ns\in [k]^ns∈[k]n, and the coderbreaker want to determine sss in as few queries like fs(x)f_s(x)fs​(x) as possible to the codemaker, where fs(x)f_s(x)fs​(x) indicates how x is close to s. The complexity of a strategy is measured by the number of queries used. In this work we study playing Mastermind on quantum computers in both non-adaptive and adaptive settings, obtaining efficient quantum algorithms which are all exact (i.e., return the correct result with certainty) and show huge quantum speedups. Technically, we develop a three-step framework for designing quantum algorithms for the general string learning problem, which not only allows huge quantum speedups on playing Mastermind, but also may shed light on exploring quantum speedups for other string learning problems.
From data in the present we can predict the future and retrodict the past. These predictions and retrodictions are for histories — most simply time sequences of events. Quantum mechanics gives probabilities for individual histories in a decoherent set of alternative histories. This paper discusses several issues connected with the distinction between prediction and retrodiction in quantum cosmology: the difference between classical and quantum retrodiction, the permanence of the past, why we predict the future but remember the past, the nature and utility of reconstructing the past(s), and information theoretic measures of the utility of history.
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.
When a photon passes through an interferometer, quantum mechanics does not provide a clear answer as to its past. Quantum retrodiction is a quantitative theory, which endeavors to make statements about the past of a system based on present knowledge. Quantum retrodiction may be used to analyze the past of a photon, that is, its trajectory. Here we experimentally retrodict the trajectories of single photons in double interferometers by measuring the final state of the photon. A sequence of measurements is made on a photon to determine which path the photon followed, so a series of retrodiction of measurement results can be regarded as a photon trajectory. We obtain information about the partial trajectory and the entire trajectory of the photon. Furthermore, we also observe the effect of different measurements in the extraction of trajectory information. Our experiment highlights the application of retrodiction theory to the study of the photon's past, and provides potential application in quantum communications.