Searcharxiv⌕ Search

arXiv subjects

Frank Verstraete

Publications and source records attributed to Frank Verstraete.

At least 181 records · Page 10Linked to original sources

Quantum computation, quantum state engineering, and quantum phase transitions driven by dissipation

We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient universal quantum computation with the result of the computation encoded in the steady state. Due to the purely dissipative nature of the process, this way of doing quantum computation exhibits some inherent robustness and defies some of the DiVincenzo criteria for quantum computation. We show that there is a natural class of problems that can be solved with such a model - the preparation of ground states of frustration free quantum Hamiltonians. This allows for robust and efficient creation of exotic states that exhibit features like topological quantum order and the creation of PEPS and it proves the existence of novel dissipative phase transitions. In particular the latter can in principle be verified experimentally with present day technology such as with optical lattices.

quant-ph↗

Sequentially generated states for the study of two dimensional systems

Matrix Product States can be defined as the family of quantum states that can be sequentially generated in a one-dimensional system. We introduce a new family of states which extends this definition to two dimensions. Like in Matrix Product States, expectation values of few body observables can be efficiently evaluated and, for the case of translationally invariant systems, the correlation functions decay exponentially with the distance. We show that such states are a subclass of Projected Entangled Pair States and investigate their suitability for approximating the ground states of local Hamiltonians.

quant-ph↗

Entropy scaling and simulability by Matrix Product States

We investigate the relation between the scaling of block entropies and the efficient simulability by Matrix Product States (MPS), and clarify the connection both for von Neumann and Renyi entropies (see Table I). Most notably, even states obeying a strict area law for the von Neumann entropy are not necessarily approximable by MPS. We apply these results to illustrate that quantum computers might outperform classical computers in simulating the time evolution of quantum systems, even for completely translational invariant systems subject to a time independent Hamiltonian.

quant-ph↗

PEPS as unique ground states of local Hamiltonians

In this paper we consider projected entangled pair states (PEPS) on arbitrary lattices. We construct local parent Hamiltonians for each PEPS and isolate a condition under which the state is the unique ground state of the Hamiltonian. This condition, verified by generic PEPS and examples like the AKLT model, is an injective relation between the boundary and the bulk of any local region. While it implies the existence of an energy gap in the 1D case we will show that in certain cases (e.g., on a 2D hexagonal lattice) the parent Hamiltonian can be gapless with a critical ground state. To show this we invoke a mapping between classical and quantum models and prove that in these cases the injectivity relation between boundary and bulk solely depends on the lattice geometry.

quant-ph↗

The computational complexity of PEPS

We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamiltonians, and that creating them is easier than creating arbitrary PEPS. The main tool for our proofs is a duality between PEPS and postselection which allows to use existing results from quantum compexity.

quant-ph↗

Monogamy of Bell correlations and Tsirelson's bound

We consider three parties, A, B, and C, each performing one of two local measurements on a shared quantum state of arbitrary dimension. We characterize the trade-off between the nonlocality of the Bell correlations observed by AB and of those observed by AC. This generalizes Tsirelson's bound on the quantum value of the CHSH inequality, the latter being recovered when C is completely uncorrelated with AB. We also discuss the trade-off between Bell violations and local expectation values of observables that anticommute with the ones used in the Bell test.

quant-ph↗

General Monogamy Inequality for Bipartite Qubit Entanglement

We consider multipartite states of qubits and prove that their bipartite quantum entanglement, as quantified by the concurrence, satisfies a monogamy inequality conjectured by Coffman, Kundu, and Wootters. We relate this monogamy inequality to the concept of frustration of correlations in quantum spin systems.

quant-ph↗

Quantum phase transitions in matrix product systems

We investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties. While some of the characteristics of these transitions are familiar, like the appearance of singularities in the thermodynamic limit, diverging correlation length, and vanishing energy gap, others differ from the standard paradigm: In particular, the ground state energy remains analytic, and the entanglement entropy of a half-chain stays finite. Examples demonstrate that these kinds of transitions can occur at the triple point of `conventional' QPTs.

cond-mat.stat-mech↗

Entanglement of assistance and multipartite state distillation

We find that the asymptotic entanglement of assistance of a general bipartite mixed state is equal to the smaller of its two local entropies. Our protocol gives rise to the asymptotically optimal EPR pair distillation procedure for a given tripartite pure state, and we show that it actually yields EPR and GHZ states; in fact, under a restricted class of protocols, which we call "one-way broadcasting", the GHZ-rate is shown to be optimal. This result implies a capacity theorem for quantum channels where the environment helps transmission by broadcasting the outcome of an optimally chosen measurement. We discuss generalisations to m parties, and show (for m=4) that the maximal amount of entanglement that can be localised between two parties is given by the smallest entropy of a group of parties of which the one party is a member, but not the other. This gives an explicit expression for the asymptotic localisable entanglement, and shows that any nontrivial ground state of a spin system can be used as a perfect quantum repeater if many copies are available in parallel. Finally, we provide evidence that any unital channel is asymptotically equivalent to a mixture of unitaries, and any general channel to a mixture of partial isometries.

quant-ph↗

Interpolation of recurrence and hashing entanglement distillation protocols

We construct new entanglement distillation protocols by interpolating between the recurrence and hashing protocols. This leads to asymptotic two-way distillation protocols, resulting in an improvement of the distillation rate for all mixed Bell diagonal entangled states, even for the ones with very high fidelity. We also present a method how entanglement-assisted distillation protocols can be converted into non-entanglement-assisted protocols with the same yield.

quant-ph↗

Quantum entanglement theory in the presence of superselection rules

Superselection rules severly constrain the operations which can be implemented on a distributed quantum system. While the restriction to local operations and classical communication gives rise to entanglement as a nonlocal resource, particle number conservation additionally confines the possible operations and should give rise to a new resource. In [Phys. Rev. Lett. 92, 087904 (2004), quant-ph/0310124] we showed that this resource can be quantified by a single additional number, the superselection induced variance (SiV) without changing the concept of entanglement. In this paper, we give the results on pure states in greater detail; additionally, we provide a discussion of mixed state nonlocality with superselection rules where we consider both formation and distillation. Finally, we demonstrate that SiV is indeed a resource, i.e., that it captures how well a state can be used to overcome the restrictions imposed by the superselection rule.

quant-ph↗

Multipartite entanglement in 2 x 2 x n quantum systems

We classify multipartite entangled states in the 2 x 2 x n (n >= 4) quantum system, for example the 4-qubit system distributed over 3 parties, under local filtering operations. We show that there exist nine essentially different classes of states, and they give rise to a five-graded partially ordered structure, including the celebrated Greenberger-Horne-Zeilinger (GHZ) and W classes of 3 qubits. In particular, all 2 x 2 x n-states can be deterministically prepared from one maximally entangled state, and some applications like entanglement swapping are discussed.

quant-ph↗

Normal forms and entanglement measures for multipartite quantum states

A general mathematical framework is presented to describe local equivalence classes of multipartite quantum states under the action of local unitary and local filtering operations. This yields multipartite generalizations of the singular value decomposition. The analysis naturally leads to the introduction of entanglement measures quantifying the multipartite entanglement (as generalizations of the concurrence and the 3-tangle), and the optimal local filtering operations maximizing these entanglement monotones are obtained. Moreover a natural extension of the definition of GHZ-states to e.g. $2\times 2\times N$ systems is obtained.

quant-ph↗

On the fidelity of mixed states of two qubits

We consider a single copy of a mixed state of two qubits and show how its fidelity or maximal singlet fraction is related to the entanglement measures concurrence and negativity. We characterize the extreme points of the convex set of states with constant fidelity, and use this to prove tight lower and upper bounds on the fidelity for a given amount of entanglement.

quant-ph↗

On quantum channels

One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a quantum channel or completely positive map (CP-map) is the dual state associated to it. The present paper is a collection of well-known, less known and new results on quantum channels, presented in a unified way. We will show how this dual state induces nice characterizations of the extremal maps of the convex set of CP-maps, and how normal forms for states defined on a Hilbert space with a tensor product structure lead to interesting parameterizations of quantum channels.

quant-ph↗

Maximal entanglement versus entropy for mixed quantum states

Maximally entangled mixed states are those states that, for a given mixedness, achieve the greatest possible entanglement. For two-qubit systems and for various combinations of entanglement and mixedness measures, the form of the corresponding maximally entangled mixed states is determined primarily analytically. As measures of entanglement, we consider entanglement of formation, relative entropy of entanglement, and negativity; as measures of mixedness, we consider linear and von Neumann entropies. We show that the forms of the maximally entangled mixed states can vary with the combination of (entanglement and mixedness) measures chosen. Moreover, for certain combinations, the forms of the maximally entangled mixed states can change discontinuously at a specific value of the entropy.

quant-ph↗

Local permutations of products of Bell states and entanglement distillation

We present new algorithms for mixed-state multi-copy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best known algorithms. Better algorithms can be derived that are tuned for specific initial states. The new algorithms are based on a characterization of the group of all locally realizable permutations of the 4^n possible tensor products of n Bell states.

quant-ph↗

Maximally entangled mixed states of two qubits

We consider mixed states of two qubits and show under which global unitary operations their entanglement is maximized. This leads to a class of states that is a generalization of the Bell states. Three measures of entanglement are considered: entanglement of formation, negativity and relative entropy of entanglement. Surprisingly all states that maximize one measure also maximize the others. We will give a complete characterization of these generalized Bell states and prove that these states for fixed eigenvalues are all equivalent under local unitary transformations. We will furthermore characterize all nearly entangled states closest to the maximally mixed state and derive a new lower bound on the volume of separable mixed states.

quant-ph↗