Biomedical subjects

Guifré Vidal

Publications and source records attributed to Guifré Vidal.

3 recordsLinked to original sources

PubMed2004

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 evolution 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 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 on the system size. We present simulations involving quantum spins and fermions in one spatial dimension.

Journal Article↗

PubMed2004

Efficient simulation of one-dimensional quantum many-body systems.

We present a numerical method to simulate the time evolution, according to a generic Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of entanglement involved in the simulated evolution. Numerical analysis indicates that this method can be used, for instance, to efficiently compute time-dependent properties of low-energy dynamics in sufficiently regular but otherwise arbitrary one-dimensional quantum many-body systems. As by-products, we describe two alternatives to the density matrix renormalization group method.

Journal Article↗

PubMed2003

Efficient classical simulation of slightly entangled quantum computations.

We present a classical protocol to efficiently simulate any pure-state quantum computation that involves only a restricted amount of entanglement. More generally, we show how to classically simulate pure-state quantum computations on n qubits by using computational resources that grow linearly in n and exponentially in the amount of entanglement in the quantum computer. Our results imply that a necessary condition for an exponential computational speedup (with respect to classical computations) is that the amount of entanglement increases with the size n of the computation, and provide an explicit lower bound on the required growth.

Journal Article↗