arXiv subjects
Publications and source records attributed to Todd A. Brun.
This is a comment on a recent publication claiming to have found a ``quantum optimization'' algorithm which outperforms known algorithms for minimizing some ``cost function''. Unfortunately, this algorithm is no better than choosing a state at random and checking whether it has low cost.
The state that an observer attributes to a quantum system depends on the information available to that observer. If two or more observers have different information about a single system, they will in general assign different states. Is there any restriction on what states can be assigned, given reasonable assumptions about how the observers use their information? We derive necessary and sufficient conditions for a group of general density matrices to characterize what different people may know about one and the same physical system. These conditions are summarized by a single criterion, which we term compatibility.
We derive necessary and sufficient conditions for a group of density matrices to characterize what different people may know about one and the same physical system.
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.
In quantum teleportation, an unknown quantum state is transmitted from one party to another using only local operations and classical communication, at the cost of shared entanglement. Is it possible similarly, using an $N$ party entangled state, to have the state retrievable by {\it any} of the $N-1$ possible receivers? If the receivers cooperate, and share a suitable state, this can be done reliably. The $N$ party GHZ is one such state; I derive a large class of such states, and show that they are in general not equivalent to the GHZ. I also briefly discuss the problem where the parties do not cooperate, and the relationship to multipartite entanglement quantification. I define a new set of entanglement monotones, the entanglements of preparation.
A number of authors have proposed stochastic versions of the Schrödinger equation, either as effective evolution equations for open quantum systems or as alternative theories with an intrinsic collapse mechanism. We discuss here two directions for generalization of these equations. First, we study a general class of norm preserving stochastic evolution equations, and show that even after making several specializations, there is an infinity of possible stochastic Schrödinger equations for which state vector collapse is provable. Second, we explore the problem of formulating a relativistic stochastic Schrödinger equation, using a manifestly covariant equation for a quantum field system based on the interaction picture of Tomonaga and Schwinger. The stochastic noise term in this equation can couple to any local scalar density that commutes with the interaction energy density, and leads to collapse onto spatially localized eigenstates. However, as found in a similar model by Pearle, the equation predicts an infinite rate of energy nonconservation proportional to $δ^3(\vec 0)$, arising from the local double commutator in the drift term.
There is an ongoing effort to quantify entanglement of quantum pure states for systems with more than two subsystems. We consider three approaches to this problem for three-qubit states: choosing a basis which puts the state into a standard form, enumerating ``local invariants,'' and using operational quantities such as the number of maximally entangled states which can be distilled. In this paper we evaluate a particular standard form, the {\it Schmidt form}, which is a generalization of the Schmidt decomposition for bipartite pure states. We show how the coefficients in this case can be parametrized in terms of five physically meaningful local invariants; we use this form to prove the efficacy of a particular distillation technique for GHZ triplets; and we relate the yield of GHZs to classes of states with unusual entanglement properties, showing that these states represent extremes of distillability as functions of two local invariants.
A concern has been expressed that ``the Jaynes principle can produce fake entanglement'' [R. Horodecki et al., Phys. Rev. A {\bf 59}, 1799 (1999)]. In this paper we discuss the general problem of distilling maximally entangled states from $N$ copies of a bipartite quantum system about which only partial information is known, for instance in the form of a given expectation value. We point out that there is indeed a problem with applying the Jaynes principle of maximum entropy to more than one copy of a system, but the nature of this problem is classical and was discussed extensively by Jaynes. Under the additional assumption that the state $ρ^{(N)}$ of the $N$ copies of the quantum system is exchangeable, one can write down a simple general expression for $ρ^{(N)}$. We show how to modify two standard entanglement purification protocols, one-way hashing and recurrence, so that they can be applied to exchangeable states. We thus give an explicit algorithm for distilling entanglement from an unknown or partially known quantum state.
We state a quantum version of Bayes's rule for statistical inference and give a simple general derivation within the framework of generalized measurements. The rule can be applied to measurements on N copies of a system if the initial state of the N copies is exchangeable. As an illustration, we apply the rule to N qubits. Finally, we show that quantum state estimates derived via the principle of maximum entropy are fundamentally different from those obtained via the quantum Bayes rule.
Methods for distilling maximally entangled tripartite (GHZ) states from arbitrary entangled tripartite pure states are described. These techniques work for virtually any input state. Each technique has two stages which we call primary and secondary distillation. Primary distillation produces a GHZ state with some probability, so that when applied to an ensemble of systems, a certain percentage is discarded. Secondary distillation produces further GHZs from the discarded systems. These protocols are developed with the help of an approach to quantum information theory based on absolutely selective information, which has other potential applications.
The origin of classical predictability is investigated for the one dimensional harmonic chain considered as a closed quantum mechanical system. By comparing the properties of a family of coarse-grained descriptions of the chain, we conclude that local coarse-grainings in this family are more useful for prediction than nonlocal ones. A quantum mechanical system exhibits classical behavior when the probability is high for histories having the correlations in time implied by classical deterministic laws. But approximate classical determinism holds only for certain coarse-grainings and then only if the initial state of the system is suitably restricted. Coarse-grainings by the values of the hydrodynamic variables (integrals over suitable volumes of densities of approximately conserved quantities) define the histories usually used in classical physics. But what distinguishes this coarse-graining from others? This paper approaches this question by analyzing a family of coarse-grainings for the linear harmonic chain. At one extreme in the family the chain is divided into local groups of $N$ atoms. At the other extreme the $N$ atoms are distributed nonlocally over the whole chain. Each coarse-graining follows the average (center of mass) positions of the groups and ignores the ``internal'' coordinates within each group, these constituting a different environment for each coarse-graining. We conclude that noise, decoherence, and computational complexity favor locality over nonlocality for deterministic predictability.
Quantum open systems are described in the Markovian limit by master equations in Lindblad form. I argue that common ``quantum trajectory'' techniques corresponding to continuous measurement schemes, which solve the master equation by unraveling its evolution into stochastic trajectories in Hilbert space, correspond closely to particular sets of decoherent (or consistent) histories. This is illustrated by a simple model of photon counting. An equivalence is shown for these models between standard quantum jumps and the orthogonal jumps of Diósi, which have already been shown to correspond to decoherent histories. This correspondence is compared to simple treatments of trajectories based on repeated or continuous measurements.
Coupling nanocrystals (quantum dots) to a high-$Q$ whispering gallery mode (WGM) of a silica microsphere, can produce a strong coherent interaction between the WGM and the electronic states of the dots. Shifting the resonance frequencies of the dots, for instance by placing the entire system in an electric potential, then allows this interaction to be controlled, permitting entangling interactions between different dots. Thus, this system could potentially be used to implement a quantum computer.
We consider a number of proposals for the entropy of sets of classical coarse-grained histories based on the procedures of Jaynes, and prove a series of inequalities relating these measures. We then examine these as a function of the coarse-graining for various classical systems, and show explicitly that the entropy is minimized by the finest-grained description of a set of histories. We propose an extension of the second law of thermodynamics to the entropy of histories. We briefly discuss the implications for decoherent or consistent history formulations of quantum mechanics.
By numerically simulating an implementation of the quantum baker's map on a 3-qubit NMR quantum computer based on the molecule trichloroethylene, we demonstrate the feasibility of quantum chaos experiments on present-day quantum computers. We give detailed descriptions of proposed experiments that investigate (a) the rate of entropy increase due to decoherence and (b) the phenomenon of hypersensitivity to perturbation.
Quantum open systems are described in the Markovian limit by master equations in Lindblad form. I argue that common ``quantum jumps'' techniques, which solve the master equation by unraveling its evolution into stochastic trajectories in Hilbert space, correspond closely to a particular set of decoherent histories. This is illustrated by a simple model of a photon counting experiment.
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation, however, are limited by decoherence, in which the effect of an external environment causes random errors in the quantum calculation. To combat this problem, quantum error correction schemes have been proposed, in which a single quantum bit (qubit) is ``encoded'' as a state of some larger number of qubits, chosen to resist particular types of errors. Most such schemes are vulnerable, however, to errors in the encoding and decoding itself. We examine two such schemes, in which a single qubit is encoded in a state of $n$ qubits while subject to dephasing or to arbitrary isotropic noise. Using both analytical and numerical calculations, we argue that error correction remains beneficial in the presence of weak noise, and that there is an optimal time between error correction steps, determined by the strength of the interaction with the environment and the parameters set by the encoding.
Inserting a lossy dielectric into one arm of an interference experiment acts in many ways like a measurement. If two entangled photons are passed through the interferometer, a certain amount of information is gained about which path they took, and the interference pattern in a coincidence count measurement is suppressed. However, by inserting a second dielectric into the other arm of the interferometer, one can restore the interference pattern. Two of these pseudo-measurements can thus cancel each other out. This is somewhat analogous to the proposed quantum eraser experiments.