Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
An occupation number quantum subspace expansion approach to compute the single-particle Green function: an opportunity for noise filtering
arXiv
Authors: B. Gauthier, P. Rosenberg, A. Foley, M. Charlebois
Year
2023
Paper ID
53234
Status
Preprint
Abstract Read
~2 min
Abstract Words
180
Citations
N/A
Abstract
We introduce a hybrid quantum-classical algorithm to compute the Green function for strongly correlated electrons on noisy intermediate-scale quantum (NISQ) devices. The technique consists in the construction of a non-orthogonal excitation basis composed of a set of single-particle excitations generated by occupation number operators. The excited sectors of the Hamiltonian in this basis can then be measured on the quantum device and a classical post-processing procedure yields the Green function in the Lehmann representation. The technique allows for noise filtering, a useful feature for NISQ devices. To validate the approach, we carry out a set of proof-of-principle calculations on the single-band Hubbard model on IBM quantum hardware. For a 2 site system we find good agreement between the results of quantum simulations and the exact result for the local spectral function. This proof-of-principle also shows that the noise filtering provides a reliable way to get rid of satellite peaks present in the spectral weight obtained from a NISQ device. A simulation of a 4 site system carried out on classical hardware suggests that the approach can achieve similar accuracy for larger systems.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- We introduce a hybrid quantum-classical algorithm to compute the Green function for strongly correlated electrons on noisy intermediate-scale quantum (NISQ) devices.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.