arXiv subjects

Guifre Vidal

Publications and source records attributed to Guifre Vidal.

101 records · Page 6Linked to original sources

arXiv2006

Classical simulation of quantum many-body systems with a tree tensor network

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation} simulation algorithm for time evolution from a one dimensional lattice to a tree graph, while replacing a {\em matrix product state} with a {\em tree tensor network}. As an application, we show that any one-way quantum computation on a tree graph can be efficiently simulated with a classical computer.

quant-ph↗

arXiv2004

Mixed-state dynamics in one-dimensional quantum lattice systems: a time-dependent superoperator renormalization algorithm

We present an algorithm to study mixed-state dynamics in one-dimensional quantum lattice systems. The algorithm can be used, e.g., to construct thermal states or to simulate real time evolutions given by a generic master equation. Its two main ingredients are (i) a superoperator renormalization scheme to efficiently describe the state of the system and (ii) the time evolving block decimation (TEBD) technique to efficiently update the state during a time evolution. The computational cost of a simulation increases significantly with the amount of correlations between subsystems but it otherwise depends only linearly in the system size. We present simulations involving quantum spins and fermions in one spatial dimension.

cond-mat.str-el↗

arXiv2003

Reversible simulation of bipartite product Hamiltonians

Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local unitary operations and local ancillas. Accordingly, all non-local features of a product Hamiltonian -- including the rate at which it can be used to produce entanglement, transmit classical or quantum information, or simulate other Hamiltonians -- depend only upon a single parameter. We identify this parameter and use it to obtain an explicit expression for the entanglement capacity of all product Hamiltonians. Finally, we show how the notion of simulation leads to a natural formulation of measures of the strength of a nonlocal Hamiltonian.

quant-ph↗

arXiv2003

Efficient classical simulation of slightly entangled quantum computations

We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.

quant-ph↗

arXiv1999

Approximate transformations and robust manipulation of bipartite pure state entanglement

We analyze approximate transformations of pure entangled quantum states by local operations and classical communication, finding explicit conversion strategies which optimize the fidelity of transformation. These results allow us to determine the most faithful teleportation strategy via an initially shared partially entangled pure state. They also show that procedures for entanglement manipulation such as entanglement catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are robust against perturbation of the states involved, and motivate the notion of non-local fidelity, which quantifies the difference in the entangled properties of two quantum states.

quant-ph↗

arXiv1999

Universality of optimal measurements

We present optimal and minimal measurements on identical copies of an unknown state of a qubit when the quality of measuring strategies is quantified with the gain of information (Kullback of probability distributions). We also show that the maximal gain of information occurs, among isotropic priors, when the state is known to be pure. Universality of optimal measurements follows from our results: using the fidelity or the gain of information, two different figures of merits, leads to exactly the same conclusions. We finally investigate the optimal capacity of $N$ copies of an unknown state as a quantum channel of information.

quant-ph↗

arXiv1999

Entanglement of pure states for a single copy

An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate classically, are only allowed to act locally on it. The study of optimal local conversions sheds some light on the entanglement of a single copy of a pure state. We propose a quantification of such an entanglement by means of a finite minimal set of new measures from which the optimal probability of conversion follows.

quant-ph↗

arXiv1999

Entanglement monotones

In the context of quantifying entanglement we study those functions of a multipartite state which do not increase under the set of local transformations. A mathematical characterization of these monotone magnitudes is presented. They are then related to optimal strategies of conversion of shared states. More detailed results are presented for pure states of bipartite systems. It is show that more than one measure are required simultaneously in order to quantify completely the non-local resources contained in a bipartite pure state, while examining how this fact does not hold in the so-called asymptotic limit. Finally, monotonicity under local transformations is proposed as the only natural requirement for measures of entanglement.

quant-ph↗

arXiv1998

Robustness of entanglement

In the quest of completely describing entanglement in the general case of a finite number of parties sharing a physical system of finite dimensional Hilbert space a new entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurence of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of binary systems, and analytical bounds for mixed states of binary systems. Specific results are obtained mainly for the qubit-qubit system. As byproducts local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced and arguments for considering convexity a necessary condition of any entanglement magnitude are put forward.

quant-ph↗

arXiv1998

Quantum inseparability as local pseudomixture

We show how to decompose any density matrix of the simplest binary composite systems, whether separable or not, in terms of only product vectors. We determine for all cases the minimal number of product vectors needed for such a decomposition. Separable states correspond to mixing from one to four pure product states. Inseparable states can be described as pseudomixtures of four or five pure product states, and can be made separable by mixing them with one or two pure product states.

quant-ph↗

arXiv1997

Quantum separability, time reversal and canonical decompositions

We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary composite systems and which thereby is complete for low dimensions. We then describe a constructive algorithm for finding the canonical decomposition of separable and non separable mixed states of dimensions 2x2 and 2x3.

quant-ph↗