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

Physical Review A

Experimental retrodiction of trajectories of single photons in double interferometers

Yuan Yuan, Zhibo Hou, Kang‐Da Wu, Guo‐Yong Xiang, Chuan‐Feng Li, Guang‐Can Guo

Published Jun 15, 2018• 3 citations
Publisher

Abstract

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.

DOI
10.1103/physreva.97.062115

Related papers

Asking Photons Where They Have Been

Ariel Danan, Demitry Farfurnik, Shimshon Bar-Ad +1 more

We present surprising experimental evidence regarding the past of photons passing through an interferometer. The information about the positions through which the photons pass in the interferometer is retrieved from modulations of the detected signal at the vibration frequencies of mirrors the photons bounce off. From the analysis we conclude that the past of the photons is not represented by continuous trajectories, although a "common sense" analysis adopted in various welcher weg measurements, delayed-choice which-path experiments, and counterfactual communication demonstrations yields a single trajectory. The experimental results have a simple explanation in the framework of the two-state vector formalism of quantum theory.

arXiv:1304.7469•Physical Review Letters•Dec 9, 2013•198 citations

Retrodiction of a sequence of measurement results in qubit interferometers

Mark S. Hillery, Daniel Koch

We study how well we can retrodict results of measurements made on a quantum system if we can make measurements on its final state. We know what measurements were made, but not their results. An initial examination shows that we can gain anywhere from no information to perfect information about the results of previous measurements, depending on the measurements and the initial state of the system. The case of two two-outcome measurements, the second of which is a projective measurement, is examined in some detail. We then look at a model of a qubit interferometer in which measurements are made in order to determine the path the qubit followed. The measurement made on the final state of the qubit depends on the information about previous measurement results that we are trying to determine. One can attempt to find the result of just one of the measurements or all of them or to find a measurement sequence that was not realized. We study all three possibilities.

arXiv:1609.06135•Physical Review A•Sep 19, 2016•4 citations

Asking Photons "Where Have They Been?"

Lev Vaidman A

Quantum mechanics does not provide a clear answer to the question: What was the past of a photon which went through an interferometer? Various welcher weg measurements, delayed-choice which-path experiments and weak-measurements of photons in interferometers presented the past of a photon as a trajectory or a set of trajectories. We have carried out experimental weak measurements of the paths of photons going through a nested Mach-Zehnder interferometer which show a different picture: the past of a photon is not a set of continuous trajectories. The photons tell us that they have been in the parts of the interferometer which they could not have possibly reached! Our results lead to rejection of a ``common sense'' approach to the past of a quantum particle. On the other hand, they have a simple explanation within the framework of the two-state vector formalism of quantum theory.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2013•6 citations

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

Observing the Average Trajectories of Single Photons in a Two-Slit Interferometer

Sacha Kocsis, Boris Braverman, Sylvain Ravets +4 more

A consequence of the quantum mechanical uncertainty principle is that one may not discuss the path or "trajectory" that a quantum particle takes, because any measurement of position irrevocably disturbs the momentum, and vice versa. Using weak measurements, however, it is possible to operationally define a set of trajectories for an ensemble of quantum particles. We sent single photons emitted by a quantum dot through a double-slit interferometer and reconstructed these trajectories by performing a weak measurement of the photon momentum, postselected according to the result of a strong measurement of photon position in a series of planes. The results provide an observationally grounded description of the propagation of subensembles of quantum particles in a two-slit interferometer.

Science•Jun 3, 2011•659 citations

Finding Paths via Quantum Systems and its Application for Quantum Algorithms

Daniel Koch

The field of Quantum Information Theory provides the theoretical foundation for the pursuit of quantum computers. The ongoing questions of how quantum computers will be realized and what they will achieve, are both very uncertain. However, worldwide efforts are beginning to converge on some answers, and the future of quantum computers is looking brighter than ever. In contribution to the grand goal that is quantum computing, this thesis serves as a demonstration to the usefulness of quantum over classical computing. The central theme of my work, and my collaborators, is the exploration of using quantum systems as a tool for path finding and search algorithms. First, we explore a specific problem of sequential measurements in Quantum Information Theory, namely quantum retrodiction. In experiments involving quantum systems with numerous intermediate interactions, often times the only thing that matters to the experimenters is the final measurement. However, quantum retrodiction is the problem of extrapolating information about the past of a quantum system, by studying the present state. The case studied in this dissertation is the retrodiction of a series of two-outcome measurements, the double and triple qubit-interferometers. In both cases, we are presented with the problem of inferring the results of the two-outcome measurements, using only the final state of the system. Specifically, all of the possible outcomes from the measurements result in a different final state, and we are tasked with distinguishing which final state we have. One version of this problem can be seen as light traversing a series of half-silver mirrors, and we would like to know the path the light took. To distinguish which final state we are given, we employ the use of POVMs (Positive-Operator Valued Measurements) that reflect the symmetry of the system. The effectiveness of these POVMs in solving the retrodiction problem are then presented, along with a few comments as to other types of information that can be extracted. Second, we examine a different type of path finding via a quantum system. For a given graph G that can be expressed by connections and nodes, the same graph can be mapped onto a quantum system with a Hilbert space H. All of the connections in the graph can be represented as states in H, and the nodes act as sites for local unitary operations. The sum of all these local operations give rise to U, which is the unitary operator that acts on H, and describes the behavior of the system. Using this formalism, we explore a particular type of U called a scattering quantum random walk. The quantum random walk is the quantum mechanical analogy to the classical random walk, and serves as a powerful tool for searching on a graph. In this dissertation, we present the case of searching for a marked final node, on a graph that consists of a series of stars. The initial state of the system has an equal probability distribution among all states, reflecting no a priori knowledge about the location of the final node. But by applying the quantum random walk, the final state of the system reaches a superposition where nearly all of the probability is concentrated along the path leading to the marked final node. Lastly, we extend this idea of using a quantum random walk to reveal a path even further. We examine a specific type of graph G, called an “N-tree” graph, and apply our quantum random walk scheme. An N-tree graph can be described as a maze where the solver is presented with a junction consisting of N choices. Beyond each choice, is an identical junction of N choices, and so on. The depth of the maze is categorized by a parameter M, thus, to correctly solve the maze one must make M correct choices in succession. Labeling the marked final nodes as F, we present a quantum algorithm that uses a quantum random walk to locate F faster than any classical algorithm. Specifically, the quantum random walk results in a final state of the system with a high probability concentration on all the states leading to F. Two methods for searching for F are then presented. The first approach mimics the ideology of a Grover Search, relying on repetitive searches until F is found. The second approach presents a novel use of past measurements to dictates how the algorithm proceeds next. Specifically, we take advantage of the fact that states along the path leading to F hold most of the probability in the system. In the end, the second quantum algorithm approach provides an speedup over the classical algorithm of the order O().

•Jan 1, 2018•0 citations
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.
We present surprising experimental evidence regarding the past of photons passing through an interferometer. The information about the positions through which the photons pass in the interferometer is retrieved from modulations of the detected signal at the vibration frequencies of mirrors the photons bounce off. From the analysis we conclude that the past of the photons is not represented by continuous trajectories, although a "common sense" analysis adopted in various welcher weg measurements, delayed-choice which-path experiments, and counterfactual communication demonstrations yields a single trajectory. The experimental results have a simple explanation in the framework of the two-state vector formalism of quantum theory.
We study how well we can retrodict results of measurements made on a quantum system if we can make measurements on its final state. We know what measurements were made, but not their results. An initial examination shows that we can gain anywhere from no information to perfect information about the results of previous measurements, depending on the measurements and the initial state of the system. The case of two two-outcome measurements, the second of which is a projective measurement, is examined in some detail. We then look at a model of a qubit interferometer in which measurements are made in order to determine the path the qubit followed. The measurement made on the final state of the qubit depends on the information about previous measurement results that we are trying to determine. One can attempt to find the result of just one of the measurements or all of them or to find a measurement sequence that was not realized. We study all three possibilities.
Quantum mechanics does not provide a clear answer to the question: What was the past of a photon which went through an interferometer? Various welcher weg measurements, delayed-choice which-path experiments and weak-measurements of photons in interferometers presented the past of a photon as a trajectory or a set of trajectories. We have carried out experimental weak measurements of the paths of photons going through a nested Mach-Zehnder interferometer which show a different picture: the past of a photon is not a set of continuous trajectories. The photons tell us that they have been in the parts of the interferometer which they could not have possibly reached! Our results lead to rejection of a ``common sense'' approach to the past of a quantum particle. On the other hand, they have a simple explanation within the framework of the two-state vector formalism of quantum theory.
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.
A consequence of the quantum mechanical uncertainty principle is that one may not discuss the path or "trajectory" that a quantum particle takes, because any measurement of position irrevocably disturbs the momentum, and vice versa. Using weak measurements, however, it is possible to operationally define a set of trajectories for an ensemble of quantum particles. We sent single photons emitted by a quantum dot through a double-slit interferometer and reconstructed these trajectories by performing a weak measurement of the photon momentum, postselected according to the result of a strong measurement of photon position in a series of planes. The results provide an observationally grounded description of the propagation of subensembles of quantum particles in a two-slit interferometer.
The field of Quantum Information Theory provides the theoretical foundation for the pursuit of quantum computers. The ongoing questions of how quantum computers will be realized and what they will achieve, are both very uncertain. However, worldwide efforts are beginning to converge on some answers, and the future of quantum computers is looking brighter than ever. In contribution to the grand goal that is quantum computing, this thesis serves as a demonstration to the usefulness of quantum over classical computing. The central theme of my work, and my collaborators, is the exploration of using quantum systems as a tool for path finding and search algorithms. First, we explore a specific problem of sequential measurements in Quantum Information Theory, namely quantum retrodiction. In experiments involving quantum systems with numerous intermediate interactions, often times the only thing that matters to the experimenters is the final measurement. However, quantum retrodiction is the problem of extrapolating information about the past of a quantum system, by studying the present state. The case studied in this dissertation is the retrodiction of a series of two-outcome measurements, the double and triple qubit-interferometers. In both cases, we are presented with the problem of inferring the results of the two-outcome measurements, using only the final state of the system. Specifically, all of the possible outcomes from the measurements result in a different final state, and we are tasked with distinguishing which final state we have. One version of this problem can be seen as light traversing a series of half-silver mirrors, and we would like to know the path the light took. To distinguish which final state we are given, we employ the use of POVMs (Positive-Operator Valued Measurements) that reflect the symmetry of the system. The effectiveness of these POVMs in solving the retrodiction problem are then presented, along with a few comments as to other types of information that can be extracted. Second, we examine a different type of path finding via a quantum system. For a given graph G that can be expressed by connections and nodes, the same graph can be mapped onto a quantum system with a Hilbert space H. All of the connections in the graph can be represented as states in H, and the nodes act as sites for local unitary operations. The sum of all these local operations give rise to U, which is the unitary operator that acts on H, and describes the behavior of the system. Using this formalism, we explore a particular type of U called a scattering quantum random walk. The quantum random walk is the quantum mechanical analogy to the classical random walk, and serves as a powerful tool for searching on a graph. In this dissertation, we present the case of searching for a marked final node, on a graph that consists of a series of stars. The initial state of the system has an equal probability distribution among all states, reflecting no a priori knowledge about the location of the final node. But by applying the quantum random walk, the final state of the system reaches a superposition where nearly all of the probability is concentrated along the path leading to the marked final node. Lastly, we extend this idea of using a quantum random walk to reveal a path even further. We examine a specific type of graph G, called an “N-tree” graph, and apply our quantum random walk scheme. An N-tree graph can be described as a maze where the solver is presented with a junction consisting of N choices. Beyond each choice, is an identical junction of N choices, and so on. The depth of the maze is categorized by a parameter M, thus, to correctly solve the maze one must make M correct choices in succession. Labeling the marked final nodes as F, we present a quantum algorithm that uses a quantum random walk to locate F faster than any classical algorithm. Specifically, the quantum random walk results in a final state of the system with a high probability concentration on all the states leading to F. Two methods for searching for F are then presented. The first approach mimics the ideology of a Grover Search, relying on repetitive searches until F is found. The second approach presents a novel use of past measurements to dictates how the algorithm proceeds next. Specifically, we take advantage of the fact that states along the path leading to F hold most of the probability in the system. In the end, the second quantum algorithm approach provides an speedup over the classical algorithm of the order O().