Polynomial-time algorithm for simulation of weakly interacting quantum spin systems

Bravyi, Sergey and DiVincenzo, David and Loss, Daniel. (2008) Polynomial-time algorithm for simulation of weakly interacting quantum spin systems. Communications in mathematical physics, Vol. 284, H. 2. pp. 481-507.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/dok/A5254602

Downloads: Statistics Overview


We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial in n and delta(-1), where n is the number of qubits, and delta is the required precision. Specifically, we consider Hamiltonians of the form H = H-0 + epsilon V, where H-0 describes non-interacting qubits, V is a perturbation that involves arbitrary two-qubit interactions on a graph of bounded degree, and epsilon is a small parameter. The algorithm works if |epsilon| is below a certain threshold value epsilon(0) that depends only upon the spectral gap of H-0, the maximal degree of the graph, and the maximal norm of the two-qubit interactions. The main technical ingredient of the algorithm is a generalized Kirkwood-Thomas ansatz for the ground state. The parameters of the ansatz are computed using perturbative expansions in powers of epsilon. Our algorithm is closely related to the coupled cluster method used in quantum chemistry.
Faculties and Departments:05 Faculty of Science > Departement Physik > Physik > Theoretische Physik Mesoscopics (Loss)
UniBasel Contributors:Loss, Daniel
Item Type:Article, refereed
Article Subtype:Research Article
Note:Publication type according to Uni Basel Research Database: Journal article
Related URLs:
Identification Number:
Last Modified:22 Mar 2012 14:27
Deposited On:22 Mar 2012 13:57

Repository Staff Only: item control page