While dissipation has traditionally been viewed as an obstacle to quantum coherence, it is increasingly recognized as a powerful computational resource. Dissipative protocols can prepare complex many-body quantum states by leveraging engineered system–environment interactions. This essay focuses on a class of algorithms that utilize algorithmically constructed Lindblad generators and highlight recent advances enabling the preparation of ground and thermal states for certain non-commuting Hamiltonians with rigorous performance guarantees. We also propose extensions of these protocols to prepare excited and resonance states, which may offer new pathways toward realizing practical quantum advantage on early fault-tolerant quantum computing platforms.
While dissipation has traditionally been viewed as an obstacle to quantum coherence, it is increasingly recognized as a powerful computational resource. Dissipative protocols can prepare complex many-body quantum states by leveraging engineered system–environment interactions. This essay focuses on a class of algorithms that utilize algorithmically constructed Lindblad generators and highlight recent advances enabling the preparation of ground and thermal states for certain non-commuting Hamiltonians with rigorous performance guarantees. We also propose extensions of these protocols to prepare excited and resonance states, which may offer new pathways toward realizing practical quantum advantage on early fault-tolerant quantum computing platforms.
Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tuned in time-dependent fashion -- while still admitting rigorous fixed-point error bounds. Existing rigorous approaches, however, do not exploit the fact that these constructions generically implement not only the desired Lindblad dynamics, but also an additional unitary evolution generated by the system Hamiltonian which may aid convergence to the thermal state [Lloyd and Abanin arXiv:2506.21318 (2025)]. Here, we show that this unitary contribution does indeed tighten the fixed-point error bound and demonstrate that it is rigorously controlled by the system-bath coupling strength J, scaling as J2. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning J. We clarify the role, previously observed, of a randomized implementation in suppressing possible resonances of the drive with the many-body spectrum, and bound the additional variance that this randomization imposes on observables. Finally, we numerically study aspects of the protocol which are relevant for its practical realization, such as the mixing time.
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.
Quantum simulation is widely regarded as one of the most promising routes to genuine quantum advantage, yet most existing approaches to quantum chemistry are formulated in terms of closed-system, unitary dynamics and ground-state preparation within the Born--Oppenheimer approximation. In this review, we discuss a broader perspective motivated by the observation that naturally occurring quantum systems are rarely isolated and often reach physically relevant states only through relaxation, decoherence, and thermalization. We first examine what is and is not known about exponential quantum advantage in chemistry, emphasizing that coherent Hamiltonian simulation provides the clearest formal case for speed-up, while many open questions remain for realistic problems. We then discuss how dissipation might ideally be integrated into quantum chemistry on a fault-tolerant quantum computer, using recent proposals for chemically motivated dynamical simulation as a guiding vision. More generally, we highlight the practical appeal of this approach to enhancing the robustness of quantum algorithms.
Quantum information processing holds immense promise, but its practical implementation is fundamentally challenged by dissipation, the irreversible loss of information and energy to the environment. The conventional approach treats dissipation as an obstacle to overcome, typically through resource-intensive quantum error correction. Such schemes impose overheads of orders of magnitude in terms of both qubits and operations. This creates significant space, control and time costs, making near-term practical implementation highly challenging. This thesis adopts a different viewpoint, harnessing dissipation for quantum algorithms. We explore the design, application, and conceptual advantages of dissipative quantum algorithms. We establish the foundational tools for this approach by demonstrating how to engineer a universal set of nonunitary operations using intrinsic, controllable dissipation. We present a hardware-efficient method, experimentally realized in a trapped-ion system, for implementing any two-qubit Markovian quantum channel without requiring ancilla qubits or measurements. This provides a practical and versatile toolbox for constructing dissipative algorithms on near-term quantum devices. Building on this, we apply these tools to an inherently dissipative task: the preparation of thermal states. We introduce a variational quantum-classical algorithm that integrates engineered nonunitary operations with unitary gates. By leveraging weak symmetries of the target Hamiltonian, we design efficient ansätze that significantly improve the fidelity of state preparation. Finally, we address one of the most significant barriers to scaling variational quantum algorithms: the prevalence of barren plateaus, where optimization gradients vanish exponentially with system size. We prove that dissipative algorithms, by incorporating periodic qubit resets, can mitigate both noise-induced and unitary barren plateaus. This mechanism allows for a class of scalable computations that are intractable for purely unitary approaches in the presence of noise. Together, these results demonstrate that dissipation is not just a source of error, but a powerful resource. By systematically developing the necessary operations, applying them to relevant problems, and identifying fundamental scalability advantages, this work showcases dissipative quantum computing as a compelling avenue in quantum information processing.
Building upon recent progress in Lindblad engineering for quantum Gibbs state preparation algorithms, we propose a simplified protocol that is shown to be efficient under the eigenstate thermalization hypothesis (ETH). The ETH reduces circuit overheads of the Lindblad simulation algorithm and ensures a fast convergence toward the target Gibbs state. Moreover, we show that the realized Lindblad dynamics exhibits an inherent resilience against stochastic noise, opening up the path to a first demonstration on quantum computers. We complement our claims with numerical studies of the algorithm's convergence in various regimes of the mixed-field Ising model. In line with our predictions, we observe a mixing time scaling polynomially with system size when the ETH is satisfied. In addition, we assess the impact of algorithmic and hardware-induced errors on the algorithm's performance by carrying out quantum circuit simulations of our Lindblad simulation protocol with a local depolarizing noise model. This work bridges the gap between recent theoretical advances in dissipative Gibbs state preparation algorithms and their eventual quantum hardware implementation.
The controlled preparation of quantum many-body states is a central challenge for quantum technologies. While preparing target states coherently is possible in principle, it is often fragile and experimentally demanding. Dissipative state preparation, where engineered environments drive the system toward desired steady states, provides a complementary and powerful paradigm. This thesis explores dissipative methods for preparing complex many-body states along three distinct directions. First, we investigate the dissipative stabilization of injective matrix product states (MPS). Injective MPS are particularly well suited for dissipative preparation because they arise as ground states of frustration-free parent Hamiltonians, allowing for tailored jump operators to steer the system directly into the target state. We showcase the surprising result that such state preparation works even in the dilute limit where steering only acts on a single link. Moreover, we introduce a formalism for engineering additional coherent interactions, extending the set of accessible states. Second, and complementary to steering, we develop and analyze a universal cooling scheme capable of preparing ground states even in frustrated quantum systems. In contrast to steering methods, universal cooling can overcome the glass floor that forbids steering methods to prepare such frustrated ground states. A key insight here is that the presented cooling scheme is completely system-agnostic making it extremely robust. Finally, we pursue dressing of the system eigenstates by means of either classical drives or coherent interactions as a means to influence the action of dissipation on the system. Focusing first on time-dependent systems, we propose a generalized numerical implementation of non-adiabatic master equations suitable for the use of optimal control tools. Additionally, we investigate how the collective coupling between a spin ensemble and a cavity can steer the system into a spin-squeezed steady state. Together, these three avenues illustrate how tailored dissipative dynamics can extend the frontier of many-body state preparation, from stabilizing injective MPS to cooling complex frustrated systems and generating non-classical steady states in the dressed framework.