One-particle Green's functions from the quantum equation of motion algorithm
arXiv:2201.01826 · doi:10.1103/PhysRevResearch.4.043011
Abstract
Many-body Green's functions encode all the properties and excitations of interacting electrons. While these are challenging to be evaluated accurately on a classical computer, recent efforts have been directed towards finding quantum algorithms that may provide a quantum advantage for this task, exploiting architectures that will become available in the near future. In this work we introduce a novel near-term quantum algorithm for computing one-particle Green's functions via their Lehmann representation. The method is based on a generalization of the quantum equation of motion algorithm that gives access to the charged excitations of the system. We demonstrate the validity of the present proposal by computing the Green's function of a two-site Fermi-Hubbard model on a IBM quantum processor.
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Error mitigation for short-depth quantum circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Quantum algorithms: an overview
- Extending the computational reach of a noisy superconducting quantum processor
- Efficient variational quantum simulator incorporating active error minimisation
- Quantum Simulators: Architectures and Opportunities
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Variational Quantum Computation of Excited States
- Theory of variational quantum simulation
- Training variational quantum algorithms is NP-hard
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- Mitigating measurement errors in multi-qubit experiments
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Subspace-search variational quantum eigensolver for excited states
- Information Scrambling in Computationally Complex Quantum Circuits
- Average-case complexity versus approximate simulation of commuting quantum computations
- Variational quantum algorithms for discovering Hamiltonian spectra
- Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Doubling the size of quantum simulators by entanglement forging
- Quantum computers as universal quantum simulators: state-of-art and perspectives
- Decoding quantum errors with subspace expansions
- Quantum hardware simulating four-dimensional inelastic neutron scattering
- Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
- Calculation of the Green's function on near-term quantum computers
- Precise measurement of quantum observables with neural-network estimators
- Quantum HF/DFT-Embedding Algorithms for Electronic Structure Calculations: Scaling up to Complex Molecular Systems
- From Spin Glass to Quantum Spin Liquid Ground States in Molybdate Pyrochlores
- A variational quantum eigensolver for dynamic correlation functions
- Algorithmic Error Mitigation Scheme for Current Quantum Processors
- Solving singular generalized eigenvalue problems by a rank-completing perturbation