Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
From MaRDI portal
Abstract: 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 the number of qubits and the required precision. Specifically, we consider Hamiltonians of the form , where H_0 describes non-interacting qubits, V is a perturbation that involves arbitrary two-qubit interactions on a graph of bounded degree, and is a small parameter. The algorithm works if is below a certain threshold value 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 . Our algorithm is closely related to the coupled cluster method used in quantum chemistry.
Recommendations
- Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
- scientific article; zbMATH DE number 1303028
- Deterministic polynomial-time quantum algorithms for Simon's problem
- Polynomial-Time Approximation Algorithms for the Ising Model
- An algorithm for simulating the Ising model on a type-II quantum computer
- Approximation algorithms for quantum many-body problems
- Computing the degenerate ground space of gapped spin chains in polynomial time
- Randomized algorithms for Hamiltonian simulation
- scientific article; zbMATH DE number 177833
- Fast approximate simulation of finite long-range spin systems
Cites work
- scientific article; zbMATH DE number 5360947 (Why is no real title available?)
- scientific article; zbMATH DE number 3895331 (Why is no real title available?)
- scientific article; zbMATH DE number 3220290 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
- Expansions for one quasiparticle states in spin 1/2 systems
- Ground state entanglement in quantum spin chains
- Low temperature phase diagrams for quantum perturbations of classical spin systems
- Low-temperature phase diagrams of quantum lattice systems. I: Stability for quantum perturbations of classical systems with finitely-many ground states.
- Perturbations of ground states in weakly interacting quantum spin systems
- Spectral gap and exponential decay of correlations
- The Complexity of the Local Hamiltonian Problem
- The complexity of quantum spin systems on a two-dimensional square lattice
- Time dependent theory of scattering of nucleons by nuclei
Cited in
(7)- A short proof of stability of topological order under local perturbations
- scientific article; zbMATH DE number 1303028 (Why is no real title available?)
- Quantum algorithm for preparing thermal Gibbs states -- detailed analysis
- Deterministic polynomial-time quantum algorithms for Simon's problem
- Computing the degenerate ground space of gapped spin chains in polynomial time
- A fast algorithm for approximating the ground state energy on a quantum computer
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
This page was built for publication: Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006295)
