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:2609.31266

Locality and filter design for dissipative ground-state preparation

Samuel J. Elman

quant-phSubmitted Sep 25, 2026• Announced Sep 28, 2026• 2 citations
arXivHTMLPDF

Abstract

Ground-state preparation is a fundamental challenge in quantum many-body physics, chemistry and materials science. Dissipative state-preparation techniques engineer a Lindbladian coupling to a bath that drives the system to its ground state, needing no initial overlap. Their cost is dominated by the Hamiltonian simulations inside the filtered jump operators, since each jump is a weighted sum of Heisenberg-evolved copies, or branches, of a coupling operator. We reduce this cost by following three simple observations to their logical end. First, on a fixed time grid, linear programming optimises the branch weights, trading the heating response against the circuit cost. Second, Lieb--Robinson bounds let each branch evolve on a patch whose radius grows with its duration. Third, if the dynamics converges quickly and truncation changes the jumps only slightly, the stationary state stays near the ground state even on patches smaller than the light cone. We validate our approach numerically. On a grid of $81$ evolution times, the optimised filter reduces the worst-case heating response, or leakage, more than $116$-fold at equal cost. Across fifteen molecules and six chains, the cost falls by 27 to 56\% at matched design-grid leakage; at matched cost, the molecular leakage falls by a factor of $2.9$ to $2\times10^{3}$. Density-matrix simulations show high ground-state fidelity for both filters, and on Ising and Hubbard chains the cheaper filter keeps a ground-state population of at least $0.89$ on patches of three or four sites. The same patches fail on a Heisenberg chain whose truncation error falls more slowly with patch size and whose Lindbladian gap is 12 times smaller than the Ising chain's, pointing to a role for the gap in how far patches can be truncated. At fixed radius the per-branch cost becomes independent of system size, reducing the cost of dissipative state preparation.

AI Summary

Dissipative ground-state preparation implements energy-selective jump operators as weighted sums of Heisenberg-evolved couplings. This paper asks how filter design and spatial locality can reduce their Hamiltonian-simulation cost without compromising cooling. On a fixed symmetric time grid, paired coefficient reweighting makes sampled heating-leakage minimisation a linear program. A second stage shortens the support at fixed leakage. Lieb–Robinson bounds assign each branch a time-dependent patch; a shared-evolution ladder grades its constituent evolutions by cumulative elapsed time. Conditional perturbation bounds transfer mixing guarantees and control stationary-state displacement: for global mixing pair $(\lambda,\kappa)$ and generator perturbation $\delta$, mixing survives if $\kappa\delta<\lambda$, with stationary-state shift at most $\kappa\delta/\lambda$ in trace norm. An 81-node example certifies over $116$-fold lower whole-band heating leakage at unchanged maximum time and coefficient-norm budget. Across fifteen molecular instances and six chains, matched-design-grid-leakage filters reduce modelled per-jump costs by 27–56%. Density-matrix simulations find ground-state populations at least $0.89$ with three- or four-site patches on Ising and Hubbard chains. Comparable patches fail on a Heisenberg chain with slower truncation-error decay and a Lindbladian gap twelve times smaller than the Ising example’s. The guarantees require a mixing pair that is not established for the tested models. Small-patch successes lie outside the useful regime of the global bounds, and some support-optimised filters also exceed the mixing-transfer displacement budget. Numerical systems are classically tractable and small. Resource estimates price jump block encodings, excluding end-to-end Lindblad simulation and certification; matched worst-case leakage need not yield matched stationary fidelity.

No sign of AI-generated textStrong assumptions

Error found: The abstract's statement that fixed-radius per-branch cost is independent of system size needs an additional fixed-filter qualification: the stated cost model includes a logarithmic dependence on the node count N, which grows with system size under the paper's normalised-gap prescription.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21+7 pages 4 figures

Related papers

Lattice Lindbladian simulation by patching and merging

Kaoru Mizuta

Simulating the dynamics of dissipative quantum many-body systems governed by local Lindbladians is a fundamental task in quantum computation. While the near-optimal gate count has been achieved for Hamiltonian simulation, comparable results for Lindbladian simulation remain elusive. In this work, we develop quantum algorithms for lattice Lindbladians by exploiting their locality. First, we consider sparsely dissipative systems, in which the dissipation is sparsely located, including boundary-driven systems. We establish a near-optimal quantum algorithm for their dynamics with gate count $O(Nt \, \mathrm{polylog}(Nt/\varepsilon))$, where $N$ is the system size, $t$ is the evolution time, and $\varepsilon$ is the allowable error. We then consider generic lattice Lindbladians with finite-range interactions and dissipation, and develop an algorithm for simulating time-evolved observables with gate count $O((Nt)^{4/3} \, \mathrm{polylog}(Nt/\varepsilon))$ per sample with the sampling complexity $Θ(\varepsilon^{-2})$. The gate count has the smallest known dependence on the system size among algorithms retaining polylogarithmic dependence on $1/\varepsilon$. Our algorithms are based on two techniques that exploit locality: patching and merging. Patching decomposes dissipative dynamics into dynamics on subsystems with exponentially small error, generalizing a key idea underlying the Haah-Hastings-Kothari-Low algorithm for near-optimal Hamiltonian simulation. Merging absorbs reversed dissipative dynamics into other parts of the evolution, substantially reducing the overhead associated with quasi-probabilistic sampling. These results demonstrate that locality can be fully exploited to achieve fast quantum simulation of dissipative many-body dynamics, opening the way to applications such as predicting nonequilibrium phenomena and preparing desirable quantum states.

quant-pharXiv:2609.26372•Sep 23, 2026•4 citations

Driven-Dissipative Ground State Preparation: Mixing Time and Randomness

Paul Cazeaux, Marius Junge, Diyi Liu

Dissipative protocols offer a route to ground state preparation that does not require a large initial overlap with the ground state. To move beyond time independent Lindbladians and randomized Lindbladians sampled from a fixed distribution, we study driven-dissipative protocols in which the generator varies over time. Our construction uses a family of randomized Lindbladians whose jump operators are obtained by averaging the unitary evolution of random matrices under a fixed target Hamiltonian. We show that empirical averages of these Lindbladians drive arbitrary initial density matrices to low energy states. The resulting mixing time bounds depend on the Hamiltonian only through its eigenvalue distribution and remain valid even for cold starts.

quant-pharXiv:2610.03860•Oct 5, 2026•0 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

Rigorous error bounds for dissipative thermal state preparation from weak system-bath coupling

Christopher Ong, S. A. Parameswaran, Benedikt Placke +1 more

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 $J^2$. 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.

quant-pharXiv:2605.03011•Physical Review A•May 6, 2026•4 citations

Dissipative ground state preparation in ab initio electronic structure theory

Hao-En Li, Yongtao Zhan, Lin Lin

Abstract Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the Lindblad dynamics to efficiently prepare the ground state for general ab initio electronic structure problems on quantum computers, without variational parameters. These problems often involve Hamiltonians that lack geometric locality or sparsity structures, which we address by proposing two generic types of jump operators for the Lindblad dynamics. Type-I jump operators break the particle number symmetry and should be simulated in the Fock space. Type-II jump operators preserves the particle number symmetry and can be simulated more efficiently in the full configuration interaction space. For both types of jump operators, we prove that in a simplified Hartree-Fock framework, the spectral gap of our Lindbladian is lower bounded by a universal constant. For physical observables such as energy and reduced density matrices, the convergence rate of our Lindblad dynamics with Type-I jump operators remains universal, while the convergence rate with Type-II jump operators only depends on coarse grained information such as the number of orbitals and the number of electrons. To validate our approach, we employ a Monte Carlo trajectory-based algorithm for simulating the Lindblad dynamics for full ab initio Hamiltonians, demonstrating its effectiveness on molecular systems amenable to exact wavefunction treatment.

arXiv:2411.01470•npj Quantum Information•Nov 20, 2025•27 citations

Ground-state preparation via nonlinear quantum dissipation

Alireza Ataei, Olle Eriksson, Vahid Azimi Mousolou

Ground-state preparation of quantum many-body systems is a fundamental challenge across quantum science, with implications for quantum simulation, quantum computing, and the study of complex quantum matter. The exponential growth of Hilbert space and the complexity of entangled eigenstates motivate the development of new approaches that go beyond conventional strategies based on adiabatic evolution, variational optimization, imaginary-time methods, and engineered dissipative processes. Here, we demonstrate that the recently proposed quantum Landau-Lifshitz-Gilbert (QLLG) dynamics [Phys. Rev. Lett. {\bf 133}, 266704 (2024)] provides an intrinsic nonlinear dissipative mechanism for real-time ground-state preparation. Unlike engineered dissipative schemes, QLLG encodes relaxation directly into the quantum equation of motion while preserving the underlying quantum structure of the evolution. The QLLG evolution selectively suppresses excited-state contributions, driving the system toward the lowest-energy eigenstate within the accessible symmetry sector. We show that the dynamics admits a monotonic energy functional and a stable ground-state fixed point, and that for generic initial states in an $N$-qubit Hilbert space the characteristic convergence time scales linearly with $N$ and inversely with the spectral gap. Numerical simulations of an interacting spin chain confirm our analytical predictions. These results establish nonlinear dissipative QLLG dynamics as a new avenue for quantum state preparation, opening a new route for quantum simulation, computation, and state engineering.

quant-pharXiv:2604.03731•Physical review. B./Physical review. B•Apr 7, 2026•2 citations
Ground-state preparation is a fundamental challenge in quantum many-body physics, chemistry and materials science. Dissipative state-preparation techniques engineer a Lindbladian coupling to a bath that drives the system to its ground state, needing no initial overlap. Their cost is dominated by the Hamiltonian simulations inside the filtered jump operators, since each jump is a weighted sum of Heisenberg-evolved copies, or branches, of a coupling operator. We reduce this cost by following three simple observations to their logical end. First, on a fixed time grid, linear programming optimises the branch weights, trading the heating response against the circuit cost. Second, Lieb--Robinson bounds let each branch evolve on a patch whose radius grows with its duration. Third, if the dynamics converges quickly and truncation changes the jumps only slightly, the stationary state stays near the ground state even on patches smaller than the light cone. We validate our approach numerically. On a grid of 818181 evolution times, the optimised filter reduces the worst-case heating response, or leakage, more than 116116116-fold at equal cost. Across fifteen molecules and six chains, the cost falls by 27 to 56% at matched design-grid leakage; at matched cost, the molecular leakage falls by a factor of 2.92.92.9 to 2×1032\times10^{3}2×103. Density-matrix simulations show high ground-state fidelity for both filters, and on Ising and Hubbard chains the cheaper filter keeps a ground-state population of at least 0.890.890.89 on patches of three or four sites. The same patches fail on a Heisenberg chain whose truncation error falls more slowly with patch size and whose Lindbladian gap is 12 times smaller than the Ising chain's, pointing to a role for the gap in how far patches can be truncated. At fixed radius the per-branch cost becomes independent of system size, reducing the cost of dissipative state preparation.
Dissipative ground-state preparation implements energy-selective jump operators as weighted sums of Heisenberg-evolved couplings. This paper asks how filter design and spatial locality can reduce their Hamiltonian-simulation cost without compromising cooling.
On a fixed symmetric time grid, paired coefficient reweighting makes sampled heating-leakage minimisation a linear program. A second stage shortens the support at fixed leakage. Lieb–Robinson bounds assign each branch a time-dependent patch; a shared-evolution ladder grades its constituent evolutions by cumulative elapsed time. Conditional perturbation bounds transfer mixing guarantees and control stationary-state displacement: for global mixing pair (λ,κ)(\lambda,\kappa)(λ,κ) and generator perturbation δ\deltaδ, mixing survives if κδ<λ\kappa\delta<\lambdaκδ<λ, with stationary-state shift at most κδ/λ\kappa\delta/\lambdaκδ/λ in trace norm.
An 81-node example certifies over 116116116-fold lower whole-band heating leakage at unchanged maximum time and coefficient-norm budget. Across fifteen molecular instances and six chains, matched-design-grid-leakage filters reduce modelled per-jump costs by 27–56%. Density-matrix simulations find ground-state populations at least 0.890.890.89 with three- or four-site patches on Ising and Hubbard chains. Comparable patches fail on a Heisenberg chain with slower truncation-error decay and a Lindbladian gap twelve times smaller than the Ising example’s.
The guarantees require a mixing pair that is not established for the tested models. Small-patch successes lie outside the useful regime of the global bounds, and some support-optimised filters also exceed the mixing-transfer displacement budget. Numerical systems are classically tractable and small. Resource estimates price jump block encodings, excluding end-to-end Lindblad simulation and certification; matched worst-case leakage need not yield matched stationary fidelity.
Simulating the dynamics of dissipative quantum many-body systems governed by local Lindbladians is a fundamental task in quantum computation. While the near-optimal gate count has been achieved for Hamiltonian simulation, comparable results for Lindbladian simulation remain elusive. In this work, we develop quantum algorithms for lattice Lindbladians by exploiting their locality. First, we consider sparsely dissipative systems, in which the dissipation is sparsely located, including boundary-driven systems. We establish a near-optimal quantum algorithm for their dynamics with gate count O(Nt polylog(Nt/ε))O(Nt \, \mathrm{polylog}(Nt/\varepsilon))O(Ntpolylog(Nt/ε)), where NNN is the system size, ttt is the evolution time, and ε\varepsilonε is the allowable error. We then consider generic lattice Lindbladians with finite-range interactions and dissipation, and develop an algorithm for simulating time-evolved observables with gate count O((Nt)4/3 polylog(Nt/ε))O((Nt)^{4/3} \, \mathrm{polylog}(Nt/\varepsilon))O((Nt)4/3polylog(Nt/ε)) per sample with the sampling complexity Θ(ε−2)Θ(\varepsilon^{-2})Θ(ε−2). The gate count has the smallest known dependence on the system size among algorithms retaining polylogarithmic dependence on 1/ε1/\varepsilon1/ε. Our algorithms are based on two techniques that exploit locality: patching and merging. Patching decomposes dissipative dynamics into dynamics on subsystems with exponentially small error, generalizing a key idea underlying the Haah-Hastings-Kothari-Low algorithm for near-optimal Hamiltonian simulation. Merging absorbs reversed dissipative dynamics into other parts of the evolution, substantially reducing the overhead associated with quasi-probabilistic sampling. These results demonstrate that locality can be fully exploited to achieve fast quantum simulation of dissipative many-body dynamics, opening the way to applications such as predicting nonequilibrium phenomena and preparing desirable quantum states.
Dissipative protocols offer a route to ground state preparation that does not require a large initial overlap with the ground state. To move beyond time independent Lindbladians and randomized Lindbladians sampled from a fixed distribution, we study driven-dissipative protocols in which the generator varies over time. Our construction uses a family of randomized Lindbladians whose jump operators are obtained by averaging the unitary evolution of random matrices under a fixed target Hamiltonian. We show that empirical averages of these Lindbladians drive arbitrary initial density matrices to low energy states. The resulting mixing time bounds depend on the Hamiltonian only through its eigenvalue distribution and remain valid even for cold starts.
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.
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 JJJ, scaling as J2J^2J2. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning JJJ. 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.
Abstract Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the Lindblad dynamics to efficiently prepare the ground state for general ab initio electronic structure problems on quantum computers, without variational parameters. These problems often involve Hamiltonians that lack geometric locality or sparsity structures, which we address by proposing two generic types of jump operators for the Lindblad dynamics. Type-I jump operators break the particle number symmetry and should be simulated in the Fock space. Type-II jump operators preserves the particle number symmetry and can be simulated more efficiently in the full configuration interaction space. For both types of jump operators, we prove that in a simplified Hartree-Fock framework, the spectral gap of our Lindbladian is lower bounded by a universal constant. For physical observables such as energy and reduced density matrices, the convergence rate of our Lindblad dynamics with Type-I jump operators remains universal, while the convergence rate with Type-II jump operators only depends on coarse grained information such as the number of orbitals and the number of electrons. To validate our approach, we employ a Monte Carlo trajectory-based algorithm for simulating the Lindblad dynamics for full ab initio Hamiltonians, demonstrating its effectiveness on molecular systems amenable to exact wavefunction treatment.
Ground-state preparation of quantum many-body systems is a fundamental challenge across quantum science, with implications for quantum simulation, quantum computing, and the study of complex quantum matter. The exponential growth of Hilbert space and the complexity of entangled eigenstates motivate the development of new approaches that go beyond conventional strategies based on adiabatic evolution, variational optimization, imaginary-time methods, and engineered dissipative processes. Here, we demonstrate that the recently proposed quantum Landau-Lifshitz-Gilbert (QLLG) dynamics [Phys. Rev. Lett. {\bf 133}, 266704 (2024)] provides an intrinsic nonlinear dissipative mechanism for real-time ground-state preparation. Unlike engineered dissipative schemes, QLLG encodes relaxation directly into the quantum equation of motion while preserving the underlying quantum structure of the evolution. The QLLG evolution selectively suppresses excited-state contributions, driving the system toward the lowest-energy eigenstate within the accessible symmetry sector. We show that the dynamics admits a monotonic energy functional and a stable ground-state fixed point, and that for generic initial states in an NNN-qubit Hilbert space the characteristic convergence time scales linearly with NNN and inversely with the spectral gap. Numerical simulations of an interacting spin chain confirm our analytical predictions. These results establish nonlinear dissipative QLLG dynamics as a new avenue for quantum state preparation, opening a new route for quantum simulation, computation, and state engineering.