arXiv subjects

Todd A. Brun

Publications and source records attributed to Todd A. Brun.

At least 109 records · Page 6Linked to original sources

arXiv2007

Continuous quantum error correction for non-Markovian decoherence

We study the effect of continuous quantum error correction in the case where each qubit in a codeword is subject to a general Hamiltonian interaction with an independent bath. We first consider the scheme in the case of a trivial single-qubit code, which provides useful insights into the workings of continuous error correction and the difference between Markovian and non-Markovian decoherence. We then study the model of a bit-flip code with each qubit coupled to an independent bath qubit and subject to continuous correction, and find its solution. We show that for sufficiently large error-correction rates, the encoded state approximately follows an evolution of the type of a single decohering qubit, but with an effectively decreased coupling constant. The factor by which the coupling constant is decreased scales quadratically with the error-correction rate. This is compared to the case of Markovian noise, where the decoherence rate is effectively decreased by a factor which scales only linearly with the rate of error correction. The quadratic enhancement depends on the existence of a Zeno regime in the Hamiltonian evolution which is absent in purely Markovian dynamics. We analyze the range of validity of this result and identify two relevant time scales. Finally, we extend the result to more general codes and argue that the performance of continuous error correction will exhibit the same qualitative characteristics.

quant-ph↗

arXiv2007

Entanglement-Assisted Quantum Error Correction with Linear Optics

We construct a theory of continuous-variable entanglement-assisted quantum error correction. We present an example of a continuous-variable entanglement-assisted code that corrects for an arbitrary single-mode error. We also show how to implement encoding circuits using passive optical devices, homodyne measurements, feedforward classical communication, conditional displacements, and off-line squeezers.

quant-ph↗

arXiv2007

Coherent Communication with Continuous Quantum Variables

The coherent bit (cobit) channel is a resource intermediate between classical and quantum communication. It produces coherent versions of teleportation and superdense coding. We extend the cobit channel to continuous variables by providing a definition of the coherent nat (conat) channel. We construct several coherent protocols that use both a position-quadrature and a momentum-quadrature conat channel with finite squeezing. Finally, we show that the quality of squeezing diminishes through successive compositions of coherent teleportation and superdense coding.

quant-ph↗

arXiv2007

Decomposing generalized measurements into continuous stochastic processes

One of the broadest concepts of measurement in quantum theory is the generalized measurement. Another paradigm of measurement--arising naturally in quantum optics, among other fields--is that of continuous-time measurements, which can be seen as the limit of a consecutive sequence of weak measurements. They are naturally described in terms of stochastic processes, or time-dependent random variables. We show that any generalized measurement can be decomposed as a sequence of weak measurements with a mathematical limit as a continuous stochastic process. We give an explicit construction for any generalized measurement, and prove that the resulting continuous evolution, in the long-time limit, collapses the state of the quantum system to one of the final states generated by the generalized measurement, being decomposed, with the correct probabilities. A prominent feature of the construction is the presence of a feedback mechanism--the instantaneous choice weak measurement at a given time depends on the outcomes of earlier measurements. For a generalized measurement with $n$ outcomes, this information is captured by a real $n$-vector on an $n$-simplex, which obeys a simple classical stochastic evolution.

quant-ph↗

arXiv2007

Quantum walks on quotient graphs

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup used to construct it. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A {\bf 74}, 042334 (2006)] that the hitting time can be infinite. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with fast hitting times correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up.

quant-ph↗

arXiv2007

A Matrix Factorization of Extended Hamiltonian Leads to $N$-Particle Pauli Equation

In this paper the Levy-Leblond procedure for linearizing the Schrödinger equation to obtain the Pauli equation for one particle is generalized to obtain an $N$-particle equation with spin. This is achieved by using the more universal matrix factorization, $G\tilde{G} = |G| I = (-K)^l I$. Here the square matrix $G$ is linear in the total energy E and all momenta, $\tilde G$ is the matrix adjoint of $G$, $I$ is the identity matrix, $|G|$ is the determinant of $G$, $l$ is a positive integer and $K=H-E$ is Lanczos' extended Hamiltonian where $H$ is the classical Hamiltonian of the electro-mechanical system. $K$ is identically zero for all such systems, so that matrix $G$ is singular. As a consequence there always exists a vector function $\underlineθ$ with the property $G\underlineθ=0$. This factorization to obtain the matrix $G$ and vector function $\underlineθ$ is illustrated first for a one-dimensional particle in a simple potential well. This same technique, when applied to the classical nonrelativistic Hamiltonian for $N$ interacting particles in an electromagnetic field, is shown to yield for N=1 the Pauli wave equation with spin and its generalization to $N$ particles. Finally this nonrelativistic generalization of the Pauli equation is used to treat the simple Zeeman effect of a hydrogen-like atom as a two-particle problem with spin.

quant-ph↗

arXiv2006

Infinitesimal local operations and differential conditions for entanglement monotones

Much of the theory of entanglement concerns the transformations that are possible to a state under local operations with classical communication (LOCC); however, this set of operations is complicated and difficult to describe mathematically. An idea which has proven very useful is that of the {\it entanglement monotone}: a function of the state which is invariant under local unitary transformations and always decreases (or increases) on average after any local operation. In this paper we look on LOCC as the set of operations generated by {\it infinitesimal local operations}, operations which can be performed locally and which leave the state little changed. We show that a necessary and sufficient condition for a function of the state to be an entanglement monotone under local operations that do not involve information loss is that the function be a monotone under infinitesimal local operations. We then derive necessary and sufficient differential conditions for a function of the state to be an entanglement monotone. We first derive two conditions for local operations without information loss, and then show that they can be extended to more general operations by adding the requirement of {\it convexity}. We then demonstrate that a number of known entanglement monotones satisfy these differential criteria. Finally, as an application, we use the differential conditions to construct a new polynomial entanglement monotone for three-qubit pure states. It is our hope that this approach will avoid some of the difficulties in the theory of multipartite and mixed-state entanglement.

quant-ph↗

arXiv2006

Hypersensitivity and chaos signatures in the quantum baker's maps

Classical chaotic systems are distinguished by their sensitive dependence on initial conditions. The absence of this property in quantum systems has lead to a number of proposals for perturbation-based characterizations of quantum chaos, including linear growth of entropy, exponential decay of fidelity, and hypersensitivity to perturbation. All of these accurately predict chaos in the classical limit, but it is not clear that they behave the same far from the classical realm. We investigate the dynamics of a family of quantizations of the baker's map, which range from a highly entangling unitary transformation to an essentially trivial shift map. Linear entropy growth and fidelity decay are exhibited by this entire family of maps, but hypersensitivity distinguishes between the simple dynamics of the trivial shift map and the more complicated dynamics of the other quantizations. This conclusion is supported by an analytical argument for short times and numerical evidence at later times.

quant-ph↗

arXiv2006

Quantum walks with infinite hitting times

Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition, which for discrete time quantum walks is that the degeneracy of the evolution operator be greater than the degree of the graph. The set of initial states which give an infinite hitting time form a subspace. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. In the case of the discrete walk, if this condition is satisfied the walk will have infinite hitting times for any choice of a coin operator, and we give a class of graphs with infinite hitting times for any choice of coin. Hitting times are not very well-defined for continuous time quantum walks, but we show that the idea of infinite hitting-time walks naturally extends to the continuous time case as well.

quant-ph↗

arXiv2005

Hitting time for quantum walks on the hypercube

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.

quant-ph↗

arXiv2004

Measuring polynomial functions of states

In this paper I show that any $m$th-degree polynomial function of the elements of the density matrix $ρ$ can be determined by finding the expectation value of an observable on $m$ copies of $ρ$, without performing state tomography. Since a circuit exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. I construct some simple examples and compare these results to existing procedures.

quant-ph↗

arXiv2003

Quantum random walks with decoherent coins

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.

quant-ph↗

arXiv2003

Realistic simulations of single-spin nondemolition measurement by magnetic resonance force microscopy

A requirement for many quantum computation schemes is the ability to measure single spins. This paper examines one proposed scheme: magnetic resonance force microscopy, including the effects of thermal noise and back-action from monitoring. We derive a simplified equation using the adiabatic approximation, and produce a stochastic pure state unraveling which is useful for numerical simulations.

quant-ph↗

arXiv2003

Probability in decoherent histories

The decoherent (consistent) histories formalism has been proposed as a means of eliminating measurements as a fundamental concept in quantum mechanics. In this formalism, probabilities can be assigned to any description which satisfies a particular consistency condition. The formalism, however, admits incompatible descriptions which cannot be combined, unlike classical physics. This seems to leave an ambiguity in the choice of the description. I argue that this ambiguity is removed by considering the observer as a physical system.

quant-ph↗

arXiv2003

Decoherence and quantum trajectories

Decoherence is the process by which quantum systems interact and become correlated with their external environments; quantum trajectories are a powerful technique by which decohering systems can be resolved into stochastic evolutions, conditioned on different possible ``measurements'' of the environment. By calling on recently-developed tools from quantum information theory, we can analyze simplified models of decoherence, explicitly quantifying the flow of information and randomness between the system, the environment, and potential observers.

quant-ph↗

arXiv2002

Quantum Walks driven by many coins

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.

quant-ph↗

arXiv2002

The quantum to classical transition for random walks

We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional 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.

quant-ph↗

arXiv2002

Computers with closed timelike curves can solve hard problems

A computer which has access to a closed timelike curve, and can thereby send the results of calculations into its own past, can exploit this to solve difficult computational problems efficiently. I give a specific demonstration of this for the problem of factoring large numbers, and argue that a similar approach can solve NP-complete and PSPACE-complete problems. I discuss the potential impact of quantum effects on this result.

gr-qc↗