REVIEW 1 cited by
Efficient Quantum Cooling Algorithm for Fermionic Systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.
Forward citations
Cited by 1 Pith paper
-
Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
A classical-reservoir-derived variational circuit achieves at least 0.99 ground-state fidelity for 8- and 10-site 2D Fermi-Hubbard models at U/t=8, using fewer parameters and no fermionic swap network.
Discussion (0). Continue with ORCID to comment.