SearcharxivSearch

arXiv subjects

N. Linden

Publications and source records attributed to N. Linden.

At least 19 recordsLinked to original sources

Speeding Up Quantum Measurement Using Space-Time Trade-Off

We present a scheme for speeding up quantum measurement. The scheme builds on previous protocols that entangle the system to be measured with ancillary systems. In the idealised situation of perfect entangling operations and no decoherence, it gives an exact space-time trade-off meaning the readout speed increases linearly with the number of ancilla. We verify this scheme is robust against experimental imperfections through numerical modelling of gate noise and readout errors, and under certain circumstances our scheme can even lead to better than linear improvement in the speed of measurement with the number of systems measured. This hardware-agnostic approach is broadly applicable to a range of quantum technology platforms and offers a route to accelerate mid-circuit measurement as required for effective quantum error correction.

quant-ph

Spectra and eigenstates of spin chain Hamiltonians

We prove that translationally invariant Hamiltonians of a chain of $n$ qubits with nearest-neighbour interactions have two seemingly contradictory features. Firstly in the limit $n\rightarrow\infty$ we show that any translationally invariant Hamiltonian of a chain of $n$ qubits has an eigenbasis such that almost all eigenstates have maximal entanglement between fixed-size sub-blocks of qubits and the rest of the system; in this sense these eigenstates are like those of completely general Hamiltonians (i.e. Hamiltonians with interactions of all orders between arbitrary groups of qubits). Secondly in the limit $n\rightarrow\infty$ we show that any nearest-neighbour Hamiltonian of a chain of $n$ qubits has a Gaussian density of states; thus as far as the eigenvalues are concerned the system is like a non-interacting one. The comparison applies to chains of qubits with translationally invariant nearest-neighbour interactions, but we show that it is extendible to much more general systems (both in terms of the local dimension and the geometry of interaction). Numerical evidence is also presented which suggests that the translational invariance condition may be dropped in the case of nearest-neighbour chains.

math-ph

Random matrices and quantum spin chains

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the density of states when $n \rightarrow\infty$, giving explicit bounds on the rate of approach to the limit. Universality within a class of probability measures and the extension to more general interaction geometries are established. The level spacing distributions of the Gaussian Orthogonal, Unitary and Symplectic Ensembles are observed numerically for the energy levels in these ensembles.

math-ph

Localization and its consequences for quantum walk algorithms and quantum communication

The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that quantum mechanics can also lead, through the phenomenon of localization, to exponential suppression of motion on these graphs (even in the absence of decoherence). In fact, for physical embodiments of graphs, this will be the generic behaviour. It also has implications for proposals for using spin networks, including spin chains, as quantum communication channels.

quant-ph

Error Filtration and Entanglement Purification for Quantum Communication

The key realisation which lead to the emergence of the new field of quantum information processing is that quantum mechanics, the theory that describes microscopic particles, allows the processing of information in fundamentally new ways. But just as in classical information processing, errors occur in quantum information processing, and these have to be corrected. A fundamental breakthrough was the realisation that quantum error correction is in fact possible. However most work so far has not been concerned with technological feasibility, but rather with proving that quantum error correction is possible in principle. Here we describe a method for filtering out errors and entanglement purification which is particularly suitable for quantum communication. Our method is conceptually new, and, crucially, it is easy to implement in a wide variety of physical systems with present day technology and should therefore be of wide applicability.

quant-ph

Measuring Polynomial Invariants of Multi-Party Quantum States

We present networks for directly estimating the polynomial invariants of multi-party quantum states under local transformations. The structure of these networks is closely related to the structure of the invariants themselves and this lends a physical interpretation to these otherwise abstract mathematical quantities. Specifically, our networks estimate the invariants under local unitary (LU) transformations and under stochastic local operations and classical communication (SLOCC). Our networks can estimate the LU invariants for multi-party states, where each party can have a Hilbert space of arbitrary dimension and the SLOCC invariants for multi-qubit states. We analyze the statistical efficiency of our networks compared to methods based on estimating the state coefficients and calculating the invariants.

quant-ph

Random matrix theory, the exceptional Lie groups, and L-functions

There has recently been interest in relating properties of matrices drawn at random from the classical compact groups to statistical characteristics of number-theoretical L-functions. One example is the relationship conjectured to hold between the value distributions of the characteristic polynomials of such matrices and value distributions within families of L-functions. These connections are here extended to non-classical groups. We focus on an explicit example: the exceptional Lie group G_2. The value distributions for characteristic polynomials associated with the 7- and 14-dimensional representations of G_2, defined with respect to the uniform invariant (Haar) measure, are calculated using two of the Macdonald constant term identities. A one parameter family of L-functions over a finite field is described whose value distribution in the limit as the size of the finite field grows is related to that of the characteristic polynomials associated with the 7-dimensional representation of G_2. The random matrix calculations extend to all exceptional Lie groups

math-ph

High order correlations of generic pure states of finite-dimensional quantum systems are determined by lower order correlations

We show that almost every pure state of multi-party quantum systems (each of whose local Hilbert space has the same dimension) is completely determined by the state's reduced density matrices of a fraction of the parties; this fraction is less than about two-thirds of the parties for states of large numbers of parties. In other words once the reduced states of this fraction of the parties have been specified, there is no further freedom in the state.

quant-ph

The power of reduced quantum states

In a system of n quantum particles, we define a measure of the degree of irreducible n-way correlation, by which we mean the correlation that cannot be accounted for by looking at the states of (n-1) particles. In the case of almost all pure states of three qubits we show that there is no such correlation: almost every pure state of three qubits is completely determined by its two-particle reduced density matrices.

quant-ph

Optimal Entanglement Generation from Quantum Operations

We consider how much entanglement can be produced by a non-local two-qubit unitary operation, $U_{AB}$ - the entangling capacity of $U_{AB}$. For a single application of $U_{AB}$, with no ancillas, we find the entangling capacity and show that it generally helps to act with $U_{AB}$ on an entangled state. Allowing ancillas, we present numerical results from which we can conclude, quite generally, that allowing initial entanglement typically increases the optimal capacity in this case as well. Next, we show that allowing collective processing does not increase the entangling capacity if initial entanglement is allowed.

quant-ph

Optimal simulation of two-qubit Hamiltonians using general local operations

We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on deterministic simulation involving one copy of the system. More specifically, two otherwise isolated systems $A$ and $B$ interact by a nonlocal Hamiltonian $H \neq H_A+H_B$. We consider the achievable space of Hamiltonians $H'$ such that the evolution $e^{-iH't}$ can be simulated by the interaction $H$ interspersed with local operations. For any dimensions of $A$ and $B$, and any nonlocal Hamiltonians $H$ and $H'$, there exists a scale factor $s$ such that for all times $t$ the evolution $e^{-iH'st}$ can be simulated by $H$ acting for time $t$ interspersed with local operations. For 2-qubit Hamiltonians $H$ and $H'$, we calculate the optimal $s$ and give protocols achieving it. The optimal protocols do not require local ancillas, and can be understood geometrically in terms of a polyhedron defined by a partial order on the set of 2-qubit Hamiltonians.

quant-ph

Entanglement capabilities of non-local Hamiltonians

We quantify the capability of creating entanglement for a general physical interaction acting on two qubits. We give a procedure for optimizing the generation of entanglement. We also show that a Hamiltonian can create more entanglement if one uses auxiliary systems.

quant-ph

Bell inequalities for arbitrarily high dimensional systems

We develop a novel approach to Bell inequalities based on a constraint that the correlations exhibited by local realistic theories must satisfy. This is used to construct a family of Bell inequalities for bipartite quantum systems of arbitrarily high dimensionality which are strongly resistant to noise. In particular our work gives an analytic description of numerical results of D. Kaszlikowski, P. Gnacinski, M. Zukowski, W. Miklaszewski, A. Zeilinger, Phys. Rev. Lett. {\bf 85}, 4418 (2000) and T. Durt, D. Kaszlikowski, M. Zukowski, quant-ph/0101084, and generalises them to arbitrarily high dimensionality.

quant-ph

Are all noisy quantum states obtained from pure ones?

We ask what type of mixed quantum states can arise when a number of separated parties start by sharing a pure quantum state and then this pure state becomes contaminated by noise. We show that not all mixed states arise in this way. This is even the case if the separated parties actively try to degrade their initial pure state by arbitrary local actions and classical communication.

quant-ph

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

Reversibility of local transformations of multiparticle entanglement

We consider the transformation of multisystem entangled states by local quantum operations and classical communication. We show that, for any reversible transformation, the relative entropy of entanglement for two parties must remain constant. This shows, for example, that it is not possible to convert 2N three party GHZ states into 3N singlets, even in an asymptotic sense. Thus there is true three-party non-locality (i.e., not all three-party entanglement is equivalent to two-party entanglement). Our results also allow us to make {\em quantitative} statements about concentrating multi-particle entanglement. Finally, we show that there is true n-party entanglement for all n.

quant-ph

Separability of very noisy mixed states and implications for NMR quantum computing

We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. We also discuss the implications of the bounds for NMR quantum computing.

quant-ph

Purifying noisy entanglement requires collective measurements

Known entanglement purification protocols for mixed states use collective measurements on several copies of the state in order to increase the entanglement of some of them. We address the question of whether it is possible to purify the entanglement of a state by processing each copy separately. While this is possible for pure states, we show that this is impossible, in general, for mixed states. The importance of this result both conceptually and for experimental realization of purification is discussed. We also give explicit invariants of an entangled state of two qubits under local actions and classical communication.

quant-ph