Sparse-Hamiltonian approach to the time evolution of molecules on quantum computers
arXiv:2009.12679 · doi:10.1140/epjs/s11734-021-00098-w
Abstract
Quantum chemistry has been viewed as one of the potential early applications of quantum computing. Two techniques have been proposed for electronic structure calculations: (i) the variational quantum eigensolver and (ii) the phase-estimation algorithm. In both cases, the complexity of the problem increases for basis sets where either the Hamiltonian is not sparse, or it is sparse, but many orbitals are required to accurately describe the molecule of interest. In this work, we explore the possibility of mapping the molecular problem onto a sparse Hubbard-like Hamiltonian, which allows a Green's-function-based approach to electronic structure via a hybrid quantum-classical algorithm. We illustrate the time-evolution aspect of this methodology with a simple four-site hydrogen ring.
References in corpus (7)
- A variational eigenvalue solver on a quantum processor
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Algorithms for Fermionic Simulations
- Solving strongly correlated electron models on a quantum computer
- Calculation of the Green's function on near-term quantum computers
- Local Hamiltonians for quantitative Green's function embedding methods
- Test of the unitary coupled-cluster variational quantum eigensolver for a simple strongly correlated condensed-matter system