Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2412.19599 · Communications in Theoretical Physics

Ground-State Preparation of Physical Systems via Super-Bath Simulation

Tianren Wang, Zongkang Zhang, Bingnan Lu, Mauro Cirio, Ying Li

Published Sep 22, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1572-9494/aeaad6

Related papers

Ground State Preparation via Dynamical Cooling

Danial Motlagh, Modjtaba Shokrian Zini, Juan Miguel Arrazola +1 more

Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which can be challenging for large, strongly-correlated systems. This issue has motivated the study of physically-inspired dynamical approaches such as thermodynamic cooling. In this work, we introduce a ground-state preparation algorithm based on the simulation of quantum dynamics. Our main insight is to transform the Hamiltonian by a shifted sign function via quantum signal processing, effectively mapping eigenvalues into positive and negative subspaces separated by a large gap. This automatically ensures that all states within each subspace conserve energy with respect to the transformed Hamiltonian. Subsequent time-evolution with a perturbed Hamiltonian induces transitions to lower-energy states while preventing unwanted jumps to higher energy states. The approach does not rely on a priori knowledge of energy gaps and requires no additional qubits to model a bath. Furthermore, it makes $\tilde{\mathcal{O}}(d^{\,3/2}/ε)$ queries to the time-evolution operator of the system and $\tilde{\mathcal{O}}(d^{\,3/2})$ queries to a block-encoding of the perturbation, for $d$ cooling steps and an $ε$-accurate energy resolution. Our results provide a framework for combining quantum signal processing and Hamiltonian simulation to design heuristic quantum algorithms for ground-state preparation.

arXiv:2404.05810•Apr 8, 2024•26 citations

Quantum algorithm for preparing the ground state of a system via resonance transition

Hefeng Wang

Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.

arXiv:1706.08644•Scientific Reports•Nov 21, 2017•13 citations

Polynomial-time classical and quantum simulation of quantum impurity models

Jiaqing Jiang, Nathan Ju, Ojas Parekh +2 more

Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision $δ$ in time $\mathrm{poly}(n,δ^{-1})$, and (2) estimate the partition function at inverse temperature $β$ to relative precision $δ$ in time $\mathrm{poly}(n,β,δ^{-1})$, where $n$ is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.

quant-pharXiv:2610.02167•Oct 2, 2026•2 citations

Rapid Quantum Ground State Preparation via Dissipative Dynamics

Yongtao Zhan, Zhiyan Ding, Jakob Huhn +4 more

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

arXiv:2503.15827•Physical Review X•Nov 7, 2025•81 citations

Efficient learning of quantum interactions from thermal metastable states

Bingrun Wang, Qi Ye, Chi-Fang Chen

Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intractable to prepare and may not faithfully represent generic finite-temperature quantum systems. In contrast, a system coupled to a heat bath can be stuck at an approximate stationary state (metastable state) long before it truly equilibrates. Here, we formulate a physically and algorithmically consistent alternative: learning from such metastable states of detailed-balanced master equations (Lindbladians) arising from system-bath interactions. We distill the algorithmic mechanism and structural condition underlying Gibbs-state learning and extend it in full to metastable states, attaining nearly optimal sample and computational complexity (in the system size and the precision). More broadly, we sharpen notions of metastability and develop a unified framework for finite-temperature learning.

quant-pharXiv:2610.01538•Oct 2, 2026•2 citations

Sublinear thermal state and ground state preparation for free fermions via system-bath interaction

Zhiyan Ding, Lin Lin, Ke Wang

Dissipative algorithms for preparing thermal and ground states typically require a total Hamiltonian simulation time that grows at least linearly with system size $N$, even when their mixing time grows only polylogarithmically. We achieve sublinear simulation time for free fermions by engineering local interactions with a bath whose size grows in proportion to the system size. Starting from arbitrary initial states, our thermal state preparation algorithm achieves trace-norm error $ε$ in total simulation time $\widetilde{O}(\sqrt{N}/ε)$ at fixed inverse temperature and bounded single-particle bandwidth, while ground state preparation of gapped systems requires only $\mathrm{polylog}(N/ε)$ time. We further establish lower bounds for thermal state preparation within the bath protocols considered, identifying two obstacles to faster preparation, namely fourth-order deviations from the target thermal state and fluctuations induced by a random frequency shared by all bath qubits. Our results demonstrate that the linear simulation time barrier in dissipative state preparation can be overcome and clarify the bath and filter-design constraints that govern further complexity improvements.

quant-pharXiv:2610.35370•Oct 27, 2026•0 citations
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.
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which can be challenging for large, strongly-correlated systems. This issue has motivated the study of physically-inspired dynamical approaches such as thermodynamic cooling. In this work, we introduce a ground-state preparation algorithm based on the simulation of quantum dynamics. Our main insight is to transform the Hamiltonian by a shifted sign function via quantum signal processing, effectively mapping eigenvalues into positive and negative subspaces separated by a large gap. This automatically ensures that all states within each subspace conserve energy with respect to the transformed Hamiltonian. Subsequent time-evolution with a perturbed Hamiltonian induces transitions to lower-energy states while preventing unwanted jumps to higher energy states. The approach does not rely on a priori knowledge of energy gaps and requires no additional qubits to model a bath. Furthermore, it makes O~(d 3/2/ε)\tilde{\mathcal{O}}(d^{\,3/2}/ε)O~(d3/2/ε) queries to the time-evolution operator of the system and O~(d 3/2)\tilde{\mathcal{O}}(d^{\,3/2})O~(d3/2) queries to a block-encoding of the perturbation, for ddd cooling steps and an εεε-accurate energy resolution. Our results provide a framework for combining quantum signal processing and Hamiltonian simulation to design heuristic quantum algorithms for ground-state preparation.
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.
Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision δδδ in time poly(n,δ−1)\mathrm{poly}(n,δ^{-1})poly(n,δ−1), and (2) estimate the partition function at inverse temperature βββ to relative precision δδδ in time poly(n,β,δ−1)\mathrm{poly}(n,β,δ^{-1})poly(n,β,δ−1), where nnn is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.
Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.
Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intractable to prepare and may not faithfully represent generic finite-temperature quantum systems. In contrast, a system coupled to a heat bath can be stuck at an approximate stationary state (metastable state) long before it truly equilibrates. Here, we formulate a physically and algorithmically consistent alternative: learning from such metastable states of detailed-balanced master equations (Lindbladians) arising from system-bath interactions. We distill the algorithmic mechanism and structural condition underlying Gibbs-state learning and extend it in full to metastable states, attaining nearly optimal sample and computational complexity (in the system size and the precision). More broadly, we sharpen notions of metastability and develop a unified framework for finite-temperature learning.
Dissipative algorithms for preparing thermal and ground states typically require a total Hamiltonian simulation time that grows at least linearly with system size NNN, even when their mixing time grows only polylogarithmically. We achieve sublinear simulation time for free fermions by engineering local interactions with a bath whose size grows in proportion to the system size. Starting from arbitrary initial states, our thermal state preparation algorithm achieves trace-norm error εεε in total simulation time O~(N/ε)\widetilde{O}(\sqrt{N}/ε)O(N​/ε) at fixed inverse temperature and bounded single-particle bandwidth, while ground state preparation of gapped systems requires only polylog(N/ε)\mathrm{polylog}(N/ε)polylog(N/ε) time. We further establish lower bounds for thermal state preparation within the bath protocols considered, identifying two obstacles to faster preparation, namely fourth-order deviations from the target thermal state and fluctuations induced by a random frequency shared by all bath qubits. Our results demonstrate that the linear simulation time barrier in dissipative state preparation can be overcome and clarify the bath and filter-design constraints that govern further complexity improvements.