An approximate diagonalization method for large scale Hamiltonians
arXiv:1202.2817 · doi:10.1103/PhysRevA.86.052314
Abstract
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian for each eigenvalue to be calculated, using perturbation expansion, and extracting the eigenvalue from the diagonalization of the effective Hamiltonian. The size of the effective Hamiltonian can be significantly smaller than that of the original Hamiltonian, hence the diagonalization can be done much faster. We compare the results of our method with those obtained using exact diagonalization and quantum Monte Carlo calculation for random problem instances with up to 128 qubits.
arXiv comment5 pages, 3 figures
References in corpus (6)
- The density-matrix renormalization group
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Stochastic series expansion method with operator-loop update
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- First order phase transition in the Quantum Adiabatic Algorithm
- Low temperature magnetization and the excitation spectrum of antiferromagnetic Heisenberg spin rings