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.
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.
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.
If a generalized measurement is performed on a quantum system and we do not know the outcome, are we able to retrodict it with a second measurement? We obtain a necessary and sufficient condition for perfect retrodiction of the outcome of a known generalized measurement, given the final state, for an arbitrary initial state. From this, we deduce that, when the input and output Hilbert spaces have equal (finite) dimension, it is impossible to perfectly retrodict the outcome of any fine-grained measurement [where each positive, operator-valued measure (POVM) element corresponds to a single Kraus operator] for all initial states unless the measurement is unitarily equivalent to a projective measurement. It also enables us to show that every POVM can be realized in such a way that perfect outcome retrodiction is possible for an arbitrary initial state when the number of outcomes does not exceed the output Hilbert space dimension. We then consider the situation where the initial state is not arbitrary, though it may be entangled, and describe the conditions under which unambiguous outcome retrodiction is possible for a fine-grained generalized measurement. We find that this is possible for some state if the Kraus operators are linearly independent. This condition is also necessary when the Kraus operators are nonsingular. From this, we deduce that every trace-preserving quantum operation is associated with a generalized measurement whose outcome is unambiguously retrodictable for some initial state, and also that a set of unitary operators can be unambiguously discriminated iff they are linearly independent. We then examine the issue of unambiguous outcome retrodiction without entanglement. This has important connections with the theory of locally linearly dependent and locally linearly independent operators.
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().
To prepare quantum states and extract information, it is often assumed that one can perform a perfectly projective measurement. Such measurements can achieve an uncorrelated system and environment state. However, perfectly projective measurements can be difficult or impossible to perform in practice. We investigate the limitations of repeated nonprojective measurements in preparing a quantum system. For an n-qubit system initially entangled with its environment and subsequently prepared with measurements, using a sequence of weak measurements, we show that some entanglement remains unless one of the measurement operators becomes perfectly projective through an extreme limiting process. Removing initial (unentangled) correlations between a system and its environment and the scenario where measurement outcomes are not tracked are also discussed. We present results for n-qubit and n-dimensional input states.
We address the problem of choosing an initial state and final measurement that enable maximal retrodiction of the result of an unknown intermediate spin measurement of a spin-(1/2 particle, along any one of a given set of directions. Details are given of the derivation of the most general possible solution of the problem, which we reported recently. The maximal retrodiction is shown to be the determination of the result of the intermediate spin measurement, along any of four different directions that span three-dimensional space and satisfy a specific linear relation.
Measurements in quantum mechanics cannot perfectly distinguish all states and necessarily disturb the measured system. We present and analyze a proposal to demonstrate fundamental limits on quantum control of a single qubit arising from these properties of quantum measurements. We consider a qubit prepared in one of two nonorthogonal states and subsequently subjected to dephasing noise. The task is to use measurement and feedback control to attempt to correct the state of the qubit. We demonstrate that projective measurements are not optimal for this task, and that there exists a nonprojective measurement with an optimum measurement strength which achieves the best trade-off between gaining information about the system and disturbing it through measurement backaction. We study the performance of a quantum control scheme that makes use of this weak measurement followed by feedback control, and demonstrate that it realizes the optimal recovery from noise for this system. We contrast this approach with various classically inspired control schemes.