arXiv subjects

H. Barnum

Publications and source records attributed to H. Barnum.

12 recordsLinked to original sources

arXiv2010

Local Quantum Measurement and No-Signaling Imply Quantum Correlations

We show that, assuming that quantum mechanics holds locally, the finite speed of information is the principle that limits all possible correlations between distant parties to be quantum mechanical as well. Local quantum mechanics means that a Hilbert space is assigned to each party, and then all local positive-operator-valued measurements are (in principle) available; however, the joint system is not necessarily described by a Hilbert space. In particular, we do not assume the tensor product formalism between the joint systems. Our result shows that if any experiment would give nonlocal correlations beyond quantum mechanics, quantum theory would be invalidated even locally.

quant-ph↗

arXiv2008

Quantum Simulations of Classical Annealing Processes

We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution randomization. It requires order $1/\sqrtδ$ steps to find an optimal solution with bounded error probability, where $δ$ is the minimum spectral gap of the stochastic matrices used in the classical annealing process. This is a quadratic improvement over the order $1/δ$ steps required by the latter.

quant-ph↗

arXiv2007

Quantum Simulated Annealing

We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation scales with the inverse of the square root of the minimum spectral gap of the stochastic matrix used in the classical simulation. The quantum algorithm outperforms the classical one, which scales with the inverse of the gap.

quant-ph↗

arXiv2002

Introduction to Quantum Error Correction

In this introduction we motivate and explain the ``decoding'' and ``subsystems'' view of quantum error correction. We explain how quantum noise in QIP can be described and classified, and summarize the requirements that need to be satisfied for fault tolerance. Considering the capabilities of currently available quantum technology, the requirements appear daunting. But the idea of ``subsystems'' shows that these requirements can be met in many different, and often unexpected ways.

quant-ph↗

arXiv2002

Introduction to Quantum Information Processing

As a result of the capabilities of quantum information, the science of quantum information processing is now a prospering, interdisciplinary field focused on better understanding the possibilities and limitations of the underlying theory, on developing new applications of quantum information and on physically realizing controllable quantum devices. The purpose of this primer is to provide an elementary introduction to quantum information processing, and then to briefly explain how we hope to exploit the advantages of quantum information. These two sections can be read independently. For reference, we have included a glossary of the main terms of quantum information.

quant-ph↗

arXiv2002

Generalizations of entanglement based on coherent states and convex sets

Unentangled pure states on a bipartite system are exactly the coherent states with respect to the group of local transformations. What aspects of the study of entanglement are applicable to generalized coherent states? Conversely, what can be learned about entanglement from the well-studied theory of coherent states? With these questions in mind, we characterize unentangled pure states as extremal states when considered as linear functionals on the local Lie algebra. As a result, a relativized notion of purity emerges, showing that there is a close relationship between purity, coherence and (non-)entanglement. To a large extent, these concepts can be defined and studied in the even more general setting of convex cones of states. Based on the idea that entanglement is relative, we suggest considering these notions in the context of partially ordered families of Lie algebras or convex cones, such as those that arise naturally for multipartite systems. The study of entanglement includes notions of local operations and, for information-theoretic purposes, entanglement measures and ways of scaling systems to enable asymptotic developments. We propose ways in which these may be generalized to the Lie-algebraic setting, and to a lesser extent to the convex-cones setting. One of our original motivations for this program is to understand the role of entanglement-like concepts in condensed matter. We discuss how our work provides tools for analyzing the correlations involved in quantum phase transitions and other aspects of condensed-matter systems.

quant-ph↗

arXiv2001

Monotones and invariants for multi-particle quantum states

We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on deterministic and probabilistic conversion between multipartite states via local actions and classical communication. These include restrictions which do not follow from any bipartite considerations. We derive supermultiplicativity relations between each state's monotones and the monotones for collective processing when the parties share several states. We also investigate polynomial invariants under local unitary transformations, and show that a large class of these are invariant under collective unitary processing and also multiplicative, putting restrictions, for example, on the exact conversion of multiple copies of one state to multiple copies of another.

quant-ph↗

arXiv2000

Reversing quantum dynamics with near-optimal quantum and classical fidelity

We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state's quantum entanglement or classical correlation with a reference system. We exhibit an approximate reversal operation, adapted to the initial density operator and the ``noise'' dynamics to be reversed. We show that its error in preserving either quantum or classical information is no more than twice that of the optimal reversal operation. Applications to quantum algorithms and information transmission are discussed.

quant-ph↗

arXiv1999

Quantum Probability from Decision Theory?

In a recent paper (quant-ph/9906015), Deutsch claims to derive the "probabilistic predictions of quantum theory" from the "non-probabilistic axioms of quantum theory" and the "non-probabilistic part of classical decision theory." We show that his derivation fails because it includes hidden probabilistic assumptions.

quant-ph↗

arXiv1998

On Quantum Fidelities and Channel Capacities

We show the equivalence of two different notions of quantum channel capacity: that which uses the entanglement fidelity as its criterion of success in transmission, and that which uses the minimum fidelity of pure states in a subspace of the input Hilbert space as its criterion. As a corollary, any source with entropy rate less than the capacity may be transmitted with high entanglement fidelity. We also show that a restricted class of encodings is sufficient to transmit any quantum source which may be transmitted on a given channel. This enables us to simplify a known upper bound for the channel capacity. It also enables us to show that the availability of an auxiliary classical channel from encoder to decoder does not increase the quantum capacity.

quant-ph↗

arXiv1998

The quantum capacity is properly defined without encodings

We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all sources and and block sizes, but not encodings, to bound the quantum capacity. We perform an explicit calculation of this maximum coherent information for the quantum erasure channel and apply the bound in order find the erasure channel's capacity without relying on an unproven assumption as in an earlier paper.

quant-ph↗

arXiv1995

Noncommuting mixed states cannot be broadcast

We show that, given a general mixed state for a quantum system, there are no physical means for {\it broadcasting\/} that state onto two separate quantum systems, even when the state need only be reproduced marginally on the separate systems. This result generalizes and extends the standard no-cloning theorem for pure states.

quant-ph↗