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

Preprint arXiv:2605.25089 Submitted on 24 May 2026

D. Baruah, Georgios Styliaris, J. Cirac, R. Trivedi

Published May 26, 2026• 0 citations
OpenAlex

Abstract

The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a powerful alternative since it can be robust to noise and initialization errors. In this paper, we construct both continuous-time and discrete-time geometrically local dissipative processes whose unique steady state is a given injective tensor network state. Our method prepares all injective matrix product states on $N$ sites to an error $\varepsilon$ in $O(\log (N/\varepsilon))$ time, yielding an exponential improvement over previously known dissipative preparation schemes. For two and higher-dimensional tensor network states, we prove that when the tensors of the state are \emph{highly injective}, the constructed dissipative processes are rapid-mixing i.e., they prepare a state $\varepsilon$-close to the $N$-site target state in $O( \log (N/\varepsilon))$ time. For these states, our approach provides a polynomial speedup over known unitary methods for states defined on lattices and an exponential speedup for states on general bounded-degree graphs. We corroborate our theoretical results with numerical studies that indicate that the dissipative protocol can rapidly prepares states outside the high-injectivity assumption.

Related papers

Dissipative preparation of injective tensor network states

Drishti Baruah, Georgios Styliaris, J. Ignacio Cirac +1 more

The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a powerful alternative since it can be robust to noise and initialization errors. In this paper, we construct both continuous-time and discrete-time geometrically local dissipative processes whose unique steady state is a given injective tensor network state. Our method prepares all injective matrix product states on $N$ sites to an error $\varepsilon$ in $O(\log (N/\varepsilon))$ time, yielding an exponential improvement over previously known dissipative preparation schemes. For two and higher-dimensional tensor network states, we prove that when the tensors of the state are \emph{highly injective}, the constructed dissipative processes are rapid-mixing i.e., they prepare a state $\varepsilon$-close to the $N$-site target state in $O( \log (N/\varepsilon))$ time. For these states, our approach provides a polynomial speedup over known unitary methods for states defined on lattices and an exponential speedup for states on general bounded-degree graphs. We corroborate our theoretical results with numerical studies that indicate that the dissipative protocol can rapidly prepares states outside the high-injectivity assumption.

quant-pharXiv:2605.25089•May 26, 2026•5 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

Symmetry-protected dissipative preparation of matrix product states

Leo Zhou, Soonwon Choi, Mikhail D. Lukin

We propose and analyze a method for efficient dissipative preparation of matrix product states that exploits their symmetry properties. Specifically, we construct an explicit protocol that makes use of driven-dissipative dynamics to prepare a many-body quantum state that features symmetry-protected topological order and nontrivial edge excitations. The preparation protocol is protected from errors that respect the symmetry, allowing for robust experimental implementation without fine-tuned control. Numerical simulations show that the preparation time scales polynomially in system size $n$. Furthermore, we demonstrate that this scaling can be improved to $O({log}^{2}n)$ by using parallel preparation of individual segments and fusing them via quantum feedback. A concrete scheme using excitation of trapped neutral atoms into the Rydberg state via electromagnetically induced transparency is proposed and generalizations to a broader class of matrix product states are discussed.

arXiv:1706.01995•Physical Review A•Sep 22, 2021•33 citations

Constructing networks of quantum channels for state preparation

Dmytro Bondarenko

Entangled possibly mixed states are an essential resource for quantum computation, communication, metrology, and the simulation of many-body systems. It is important to develop and improve preparation protocols for such states. One possible way to prepare states of interest is to design an open system that evolves only towards the desired states. A Markovian evolution of a quantum system can be generally described by a Lindbladian. Tensor networks provide a framework to construct physically relevant entangled states. In particular, matrix product density operators (MPDOs) form an important variational class of states. MPDOs generalize matrix product states to mixed states, can represent thermal states of local one-dimensional Hamiltonians at sufficiently large temperatures, describe systems that satisfy the area law of entanglement, and form the basis of powerful numerical methods. In this work we develop an algorithm that determines for a given linear subspace of MPDOs whether this subspace can be the stable space of some frustration free k-local Lindbladian and, if so, outputs an appropriate Lindbladian. We proceed by using machine learning with networks of quantum channels, also known as quantum neural networks (QNNs), to train denoising post-processing devices for quantum sources. First, we show that QNNs can be trained on imperfect devices even when part of the training data is corrupted. Second, we show that QNNs can be trained to extrapolate quantum states to, e.g., lower temperatures. Third, we show how to denoise quantum states in an unsupervised manner. We develop a novel quantum autoencoder that successfully denoises Greenberger-Horne-Zeilinger, W, Dicke, and cluster states subject to spin-flip, dephasing errors, and random unitary noise. Finally, we develop recurrent QNNs (RQNNs) for denoising that requires memory, such as combating drifts. RQNNs can be thought of as matrix product quantum channels with a quantum algorithm for training and are closely related to MPDOs. The proposed preparation and denoising protocols can be beneficial for various emergent quantum technologies and are within reach of present-day experiments.

•Jan 1, 2021•1 citation

Dissipative preparation of many-body states

Josias Langbehn

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.

•Jan 1, 2025•0 citations

Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems

Štěpán Šmíd, Meister, Richard, Mario Berta +1 more

Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic, detailed-balance Lindbladians enable the efficient simulation of open-system dynamics converging towards desired target states. However, the overall complexity of such schemes is governed by system-size dependent mixing times. In this work, we analyse algorithmic Lindbladians for Gibbs state preparation and prove that they exhibit rapid mixing, i.e., convergence in time poly-logarithmic in the system size. We first establish this for non-interacting spin systems, free fermions, and free bosons, and then show that these rapid mixing results are stable under perturbations, covering weakly interacting qudits and perturbed non-hopping fermions. Further, we adapt the techniques from separable qudits to the fermionic setting and prove rapid mixing of the strongly-interacting regime of the Fermi-Hubbard model, for which we also explicitly evaluate the guaranteed parameter regimes. Our results constitute the first efficient mixing bounds for non-commuting qudit models and bosonic systems at arbitrary temperatures. Compared to prior spectral-gap-based results for fermions, we achieve exponentially faster mixing, further featuring explicit constants on the maximal allowed interaction strength. This not only improves the overall polynomial runtime for quantum Gibbs state preparation, but also enhances robustness against noise. Our analysis relies on oscillator norm techniques from mathematical physics, where we introduce tailored variants adapted to specific Lindbladians $\unicode{x2014}$ an innovation that we expect to significantly broaden the scope of these methods.

arXiv:2510.04954•Oct 6, 2025•29 citations
The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a powerful alternative since it can be robust to noise and initialization errors. In this paper, we construct both continuous-time and discrete-time geometrically local dissipative processes whose unique steady state is a given injective tensor network state. Our method prepares all injective matrix product states on NNN sites to an error ε\varepsilonε in O(log⁡(N/ε))O(\log (N/\varepsilon))O(log(N/ε)) time, yielding an exponential improvement over previously known dissipative preparation schemes. For two and higher-dimensional tensor network states, we prove that when the tensors of the state are \emph{highly injective}, the constructed dissipative processes are rapid-mixing i.e., they prepare a state ε\varepsilonε-close to the NNN-site target state in O(log⁡(N/ε))O( \log (N/\varepsilon))O(log(N/ε)) time. For these states, our approach provides a polynomial speedup over known unitary methods for states defined on lattices and an exponential speedup for states on general bounded-degree graphs. We corroborate our theoretical results with numerical studies that indicate that the dissipative protocol can rapidly prepares states outside the high-injectivity assumption.
The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a powerful alternative since it can be robust to noise and initialization errors. In this paper, we construct both continuous-time and discrete-time geometrically local dissipative processes whose unique steady state is a given injective tensor network state. Our method prepares all injective matrix product states on NNN sites to an error ε\varepsilonε in O(log⁡(N/ε))O(\log (N/\varepsilon))O(log(N/ε)) time, yielding an exponential improvement over previously known dissipative preparation schemes. For two and higher-dimensional tensor network states, we prove that when the tensors of the state are \emph{highly injective}, the constructed dissipative processes are rapid-mixing i.e., they prepare a state ε\varepsilonε-close to the NNN-site target state in O(log⁡(N/ε))O( \log (N/\varepsilon))O(log(N/ε)) time. For these states, our approach provides a polynomial speedup over known unitary methods for states defined on lattices and an exponential speedup for states on general bounded-degree graphs. We corroborate our theoretical results with numerical studies that indicate that the dissipative protocol can rapidly prepares states outside the high-injectivity assumption.
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.
We propose and analyze a method for efficient dissipative preparation of matrix product states that exploits their symmetry properties. Specifically, we construct an explicit protocol that makes use of driven-dissipative dynamics to prepare a many-body quantum state that features symmetry-protected topological order and nontrivial edge excitations. The preparation protocol is protected from errors that respect the symmetry, allowing for robust experimental implementation without fine-tuned control. Numerical simulations show that the preparation time scales polynomially in system size nnn. Furthermore, we demonstrate that this scaling can be improved to O(log2n)O({log}^{2}n)O(log2n) by using parallel preparation of individual segments and fusing them via quantum feedback. A concrete scheme using excitation of trapped neutral atoms into the Rydberg state via electromagnetically induced transparency is proposed and generalizations to a broader class of matrix product states are discussed.
Entangled possibly mixed states are an essential resource for quantum computation, communication, metrology, and the simulation of many-body systems. It is important to develop and improve preparation protocols for such states. One possible way to prepare states of interest is to design an open system that evolves only towards the desired states. A Markovian evolution of a quantum system can be generally described by a Lindbladian. Tensor networks provide a framework to construct physically relevant entangled states. In particular, matrix product density operators (MPDOs) form an important variational class of states. MPDOs generalize matrix product states to mixed states, can represent thermal states of local one-dimensional Hamiltonians at sufficiently large temperatures, describe systems that satisfy the area law of entanglement, and form the basis of powerful numerical methods. In this work we develop an algorithm that determines for a given linear subspace of MPDOs whether this subspace can be the stable space of some frustration free k-local Lindbladian and, if so, outputs an appropriate Lindbladian. We proceed by using machine learning with networks of quantum channels, also known as quantum neural networks (QNNs), to train denoising post-processing devices for quantum sources. First, we show that QNNs can be trained on imperfect devices even when part of the training data is corrupted. Second, we show that QNNs can be trained to extrapolate quantum states to, e.g., lower temperatures. Third, we show how to denoise quantum states in an unsupervised manner. We develop a novel quantum autoencoder that successfully denoises Greenberger-Horne-Zeilinger, W, Dicke, and cluster states subject to spin-flip, dephasing errors, and random unitary noise. Finally, we develop recurrent QNNs (RQNNs) for denoising that requires memory, such as combating drifts. RQNNs can be thought of as matrix product quantum channels with a quantum algorithm for training and are closely related to MPDOs. The proposed preparation and denoising protocols can be beneficial for various emergent quantum technologies and are within reach of present-day experiments.
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.
Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic, detailed-balance Lindbladians enable the efficient simulation of open-system dynamics converging towards desired target states. However, the overall complexity of such schemes is governed by system-size dependent mixing times. In this work, we analyse algorithmic Lindbladians for Gibbs state preparation and prove that they exhibit rapid mixing, i.e., convergence in time poly-logarithmic in the system size. We first establish this for non-interacting spin systems, free fermions, and free bosons, and then show that these rapid mixing results are stable under perturbations, covering weakly interacting qudits and perturbed non-hopping fermions. Further, we adapt the techniques from separable qudits to the fermionic setting and prove rapid mixing of the strongly-interacting regime of the Fermi-Hubbard model, for which we also explicitly evaluate the guaranteed parameter regimes. Our results constitute the first efficient mixing bounds for non-commuting qudit models and bosonic systems at arbitrary temperatures. Compared to prior spectral-gap-based results for fermions, we achieve exponentially faster mixing, further featuring explicit constants on the maximal allowed interaction strength. This not only improves the overall polynomial runtime for quantum Gibbs state preparation, but also enhances robustness against noise. Our analysis relies on oscillator norm techniques from mathematical physics, where we introduce tailored variants adapted to specific Lindbladians $\unicode{x2014}$ an innovation that we expect to significantly broaden the scope of these methods.