Super-bath Quantum Eigensolver
Abstract
The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the existence of an environment that allows the system to dissipate energy and evolve to its ground state, but also the detailed knowledge of the properties of the bath. In this paper, we propose a polynomial-time algorithm for ground state preparation which only relies on the existence of a physical bath which achieves the same task, while a detailed description of the environment may remain unknown. In particular, we show that this ``super-bath quantum eigensolver algorithm'' prepares the ground state of the system by combining a Gaussian stabilization dephasing procedure with the simulation of the interaction between the system and a super-bath which only requires minimal knowledge of the physical environment. Based on our algorithmic framework, we establish a partial order relation among environments. Supported by experimental lifetime data of nuclear metastable states, we suggest that our algorithm is applicable to determine nuclear ground states in polynomial time. These results highlight the potential advantage of quantum computing in addressing ground state problems in real-world physical systems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.