We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error correcting codes, thus allowing us to "quantize" all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.

Quantum trajectory theory, developed largely in the quantum optics community to describe open quantum systems subjected to continuous monitoring, has applications in many areas of quantum physics. In this paper I present a simple model, using two-level quantum systems (q-bits), to illustrate the essential physics of quantum trajectories and how different monitoring schemes correspond to different ``unravelings'' of a mixed state master equation. I also comment briefly on the relationship of the theory to the Consistent Histories formalism and to spontaneous collapse models.Comment: 42 pages RevTeX including four figures in encapsulated postscript. Submitted to special issue of American Journal of Physic

The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence in the quantum "coin" which drives the walk. We find exact analytical expressions for the time dependence of the first two moments of position, and show that in the long-time limit the variance grows linearly with time, unlike the unitary walk. We compare this to the results of direct numerical simulation, and see how the form of the position distribution changes from the unitary to the usual classical result as we increase the strength of the decoherence.

We look at two possible routes to classical behavior for the discrete quantum random walk on the integers: decoherence in the quantum "coin" which drives the walk, or the use of higher-dimensional (or multiple) coins to dilute the effects of interference. We use the position variance as an indicator of classical behavior and find analytical expressions for this in the long-time limit; we see that the multicoin walk retains the "quantum" quadratic growth of the variance except in the limit of a new coin for every step, while the walk with decoherence exhibits "classical" linear growth of the variance even for weak decoherence.

Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as well as unitary evolution. We derive an expression for hitting time using superoperators, and numerically evaluate it for the discrete walk on the hypercube. The values found are compared to other analogues of hitting time suggested in earlier work. The dependence of hitting times on the type of unitary "coin" is examined, and we give an example of an initial state and coin which gives an infinite hitting time for a quantum walk. Such infinite hitting times require destructive interference, and are not observed classically. Finally, we look at distortions of the hypercube, and observe that a loss of symmetry in the hypercube increases the hitting time. Symmetry seems to play an important role in both dramatic speed-ups and slow-downs of quantum walks.

Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple quantum "coins" in order to diminish the effects of interference between paths. We find solutions to this system in terms of the single coin random walk, and compare the asymptotic limit of these solutions to numerical simulations. We find exact analytical expressions for the time-dependence of the first two moments, and show that in the long time limit the "quantum mechanical" behavior of the one-coin walk persists. We further show that this is generic for a very broad class of possible walks, and that this behavior disappears only in the limit of a new coin for every step of the walk.

It is well known that any projective measurement can be decomposed into a sequence of weak measurements, which cause only small changes to the state. Similar constructions for generalized measurements, however, have relied on the use of an ancilla system. We show that any generalized measurement can be decomposed into a sequence of weak measurements without the use of an ancilla, and give an explicit construction for these weak measurements. The measurement procedure has the structure of a random walk along a curve in state space, with the measurement ending when one of the end points is reached. This shows that any measurement can be generated by weak measurements, and hence that weak measurements are universal. This may have important applications to the theory of entanglement.

Quantum metrology enhances the sensitivity of parameter estimation using the distinctive resources of quantum mechanics such as entanglement. It has been shown that the precision of estimating an overall multiplicative factor of a Hamiltonian can be increased to exceed the classical limit, yet little is known about estimating a general Hamiltonian parameter. In this paper, we study this problem in detail. We find that the scaling of the estimation precision with the number of systems can always be optimized to the Heisenberg limit, while the time scaling can be quite different from that of estimating an overall multiplicative factor. We derive the generator of local parameter translation on the unitary evolution operator of the Hamiltonian, and use it to evaluate the estimation precision of the parameter and establish a general upper bound on the quantum Fisher information. The results indicate that the quantum Fisher information generally can be divided into two parts: one is quadratic in time, while the other oscillates with time. When the eigenvalues of the Hamiltonian do not depend on the parameter, the quadratic term vanishes, and the quantum Fisher information will be bounded in this case. To illustrate the results, we give an example of estimating a parameter of a magnetic field by measuring a spin-1 2 particle and compare the results for estimating the amplitude and the direction of the magnetic field.