arXiv:2609.31266
Locality and filter design for dissipative ground-state preparation
Samuel J. Elman
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.
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