2019/10/31 by Dean Lee, Joey Bonitati, Gabriel Given +7
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computation #Computer science #Excited state #Hamiltonian (control theory) #Mathematical optimization #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum chaos and dynamical systems #Quantum computer #Quantum mechanics #Statistical physics #Wave function #cond-mat.quant-gas #hep-lat #nucl-th #quant-ph
paper · pdf · doi:10.1016/j.physletb.2020.135536
published as Phys. Lett. B 807, 135536 (2020) · 12 pages and 3 figures in the main text, 7 pages in the supplemental materials, final version to appear Physics Letters B
arxiv created 2020/06/01 · openalex publication_date 2020/06/04 · arxiv updated 2020/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling algorithm is able to construct the localized ground state of any Hamiltonian with a translationally-invariant kinetic energy and interactions that vanish at large distances. The term “localized” refers to localization in position space. The method can be viewed as the quantum analog of evaporative cooling. We start with an initial state with support over a compact region of a large volume. We then drive the excited quantum states to disperse and measure the remaining portion of the wave function left behind. For the nontrivial examples we consider here, the improvement over other methods is substantial. The only additional resource required is performing the operations in a volume significantly larger than the size of the localized state. These characteristics make the projected cooling algorithm a promising tool for calculations of self-bound systems such as atomic nuclei.