arXiv subjects

Noah Linden

Publications and source records attributed to Noah Linden.

71 records · Page 4Linked to original sources

arXiv2005

On the entanglement concentration of three-partite states

We investigate the concentration of multi-party entanglement by focusing on simple family of three-partite pure states, superpositions of Greenberger-Horne-Zeilinger states and singlets. Despite the simplicity of the states, we show that they cannot be reversibly concentrated by the standard entanglement concentration procedure, to which they seem ideally suited. Our results cast doubt on the idea that for each N there might be a finite set of N-party states into which any pure state can be reversibly transformed. We further relate our results to the concept of locking of entanglement of formation.

quant-ph↗

arXiv2005

The Extent of Multi-particle Quantum Non-locality

It is well known that entangled quantum states can be nonlocal: the correlations between local measurements carried out on these states cannot always be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are even more nonlocal than bipartite ones in the sense that nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalises work of Svetlichny and others in which it was shown that a particular class of classical nonlocal models, the ``separable'' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition.

quant-ph↗

arXiv2005

The Entanglement of Superpositions

Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed. In the case that the two states being superposed are bi-orthogonal, the answer is simple, and, for example, the entanglement of the superposition cannot be more than one e-bit more than the average of the entanglement of the two states being superposed. However for more general states, the situation is very different.

quant-ph↗

arXiv2004

Parts of Quantum States

It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is in the set of reduced states of just over half the parties. For N even, the reduced states in fewer than N/2 parties are shown to be an insufficient description of almost all states (similar results hold when N is odd). It is noted that Real Algebraic Geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.

quant-ph↗

arXiv2004

A new inequality for the von Neumann entropy

Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality for the von Neumann entropy which we prove is independent of strong subadditivity: it is an inequality which is true for any four party quantum state, provided that it satisfies three linear relations (constraints) on the entropies of certain reduced states.

quant-ph↗

arXiv2004

Non-local correlations as an information theoretic resource

It is well known that measurements performed on spatially separated entangled quantum systems can give rise to correlations that are non-local, in the sense that a Bell inequality is violated. They cannot, however, be used for super-luminal signalling. It is also known that it is possible to write down sets of ``super-quantum'' correlations that are more non-local than is allowed by quantum mechanics, yet are still non-signalling. Viewed as an information theoretic resource, super-quantum correlations are very powerful at reducing the amount of communication needed for distributed computational tasks. An intriguing question is why quantum mechanics does not allow these more powerful correlations. We aim to shed light on the range of quantum possibilities by placing them within a wider context. With this in mind, we investigate the set of correlations that are constrained only by the no-signalling principle. These correlations form a polytope, which contains the quantum correlations as a (proper) subset. We determine the vertices of the no-signalling polytope in the case that two observers each choose from two possible measurements with d outcomes. We then consider how interconversions between different sorts of correlations may be achieved. Finally, we consider some multipartite examples.

quant-ph↗

arXiv2003

The Propagation of Quantum Information Through a Spin System

It has been recently suggested that the dynamics of a quantum spin system may provide a natural mechanism for transporting quantum information. We show that one dimensional rings of qubits with fixed (time-independent) interactions, constant around the ring, allow high fidelity communication of quantum states. We show that the problem of maximising the fidelity of the quantum communication is related to a classical problem in fourier wave analysis. By making use of this observation we find that if both communicating parties have access to limited numbers of qubits in the ring (a fraction that vanishes in the limit of large rings) it is possible to make the communication arbitrarily good.

quant-ph↗

arXiv2003

Entanglement cost of generalised measurements

Bipartite entanglement is one of the fundamental quantifiable resources of quantum information theory. We propose a new application of this resource to the theory of quantum measurements. According to Naimark's theorem any rank 1 generalised measurement (POVM) M may be represented as a von Neumann measurement in an extended (tensor product) space of the system plus ancilla. By considering a suitable average of the entanglements of these measurement directions and minimising over all Naimark extensions, we define a notion of entanglement cost E_min(M) of M. We give a constructive means of characterising all Naimark extensions of a given POVM. We identify various classes of POVMs with zero and non-zero cost and explicitly characterise all POVMs in 2 dimensions having zero cost. We prove a constant upper bound on the entanglement cost of any POVM in any dimension. Hence the asymptotic entanglement cost (i.e. the large n limit of the cost of n applications of M, divided by n) is zero for all POVMs. The trine measurement is defined by three rank 1 elements, with directions symmetrically placed around a great circle on the Bloch sphere. We give an analytic expression for its entanglement cost. Defining a normalised cost of any d-dimensional POVM by E_min(M)/log(d), we show (using a combination of analytic and numerical techniques) that the trine measurement is more costly than any other POVM with d>2, or with d=2 and ancilla dimension 2. This strongly suggests that the trine measurement is the most costly of all POVMs.

quant-ph↗

arXiv2002

On the role of entanglement in quantum computational speed-up

For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up over classical computation. Furthermore we prove that the algorithm can be classically efficiently simulated to within a prescribed tolerance ηeven if a suitably small amount of global entanglement (depending on η) is present. We explicitly identify the occurrence of increasing multi-partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed-up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum computational power.

quant-ph↗

arXiv2000

The non-local content of quantum operations

We show that quantum operations on multi-particle systems have a non-local content; this mirrors the non-local content of quantum states. We introduce a general framework for discussing the non-local content of quantum operations, and give a number of examples. Quantitative relations between quantum actions and the entanglement and classical communication resources needed to implement these actions are also described. We also show how entanglement can catalyse classical communication from a quantum action.

quant-ph↗

arXiv1999

Optimal Entanglement Enhancement for Mixed States

We consider the actions of protocols involving local quantum operations and classical communication (LQCC) on a single system consisting of two separated qubits. We give a complete description of the orbits of the space of states under LQCC and characterise the representatives with maximal entanglement of formation. We thus obtain a LQCC entanglement concentration protocol for a single given state (pure or mixed) of two qubits which is optimal in the sense that the protocol produces, with non-zero probability, a state of maximal possible entanglement of formation. This defines a new entanglement measure, the maximum extractable entanglement.

quant-ph↗

arXiv1999

NMR Quantum Logic Gates for Homonuclear Spin Systems

If NMR systems are to be used as practical quantum computers, the number of coupled spins will need to be so large that it is not feasible to rely on purely heteronuclear spin systems. The implementation of a quantum logic gate imposes certain constraints on the motion of those spins not directly involved in that gate, the so-called "spectator" spins; they must be returned to their initial states at the end of the sequence. As a result, a homonuclear spin system where there is appreciable coupling between every pair of spins would seem to require a refocusing scheme that doubles in complexity and duration for every additional spectator spin. Fortunately, for the more realistic practical case where long-range spin-spin couplings can be neglected, simpler refocusing schemes can be devised where the overall duration of the sequence remains constant and the number of soft pulses increases only linearly with the number of spectator spins. These ideas are tested experimentally on a six qubit system: the six coupled protons of inosine.

quant-ph↗

arXiv1999

Good dynamics versus bad kinematics. Is entanglement needed for quantum computation?

We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with polynomial resources and ask whether or not entanglement of the pseudo-pure states is needed to achieve this aim. We show that for a large class of such protocols, including Shor's factorization, entanglement is necessary. We also show that achieving entanglement is not sufficient: if the noise in the state is sufficiently large, exponential resources are needed even if entanglement is present.

quant-ph↗

arXiv1998

The Halting Problem for Quantum Computers

We argue that the halting problem for quantum computers which was first raised by Myers, is by no means solved, as has been claimed recently. We explicitly demonstrate the difficulties that arise in a quantum computer when different branches of the computation halt at different, unknown, times.

quant-ph↗

arXiv1994

The Classification of Decoherence Functionals: An Analogue of Gleason's Theorem

Gell-Mann and Hartle have proposed a significant generalisation of quantum theory with a scheme whose basic ingredients are `histories' and decoherence functionals. Within this scheme it is natural to identify the space $\UP$ of propositions about histories with an orthoalgebra or lattice. This raises the important problem of classifying the decoherence functionals in the case where $\UP$ is the lattice of projectors $\PV$ in some Hilbert space $\V$; in effect we seek the history analogue of Gleason's famous theorem in standard quantum theory. In the present paper we present the solution to this problem for the case where $\V$ is finite-dimensional. In particular, we show that every decoherence functional $d(\a,\b)$, $\a,\b\in\PV$ can be written in the form $d(\a,\b)=\tr_{\V\otimes\V}(\a\otimes\b X)$ for some operator $X$ on the tensor product space $\V\otimes\V$.

gr-qc↗

arXiv1994

Quantum temporal logic and decoherence functionals in the histories approach to generalised quantum theory

We analyse and develop the recent suggestion that a temporal form of quantum logic provides the natural mathematical framework within which to discuss the proposal by Gell-Mann and Hartle for a generalised form of quantum theory based on the ideas of histories and decoherence functionals. Particular stress is placed on properties of the space of decoherence functionals, including one way in which certain global and topological properties of a classical system are reflected in a quantum history theory.

gr-qc↗

arXiv1992

Path Intergals and Perturbative Expansions for Non-Compact Symmetric Spaces

We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global structure of the system. This perturbation expansion is evaluated for a simple example and leads to a new exactly soluble model. This work is a step towards the construction of a strong coupling perturbation theory for quantum gravity.

hep-th↗