A Randomized Method for Simulating Lindblad Equations and Thermal State Preparation
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
<jats:p> We study a qDRIFT-type randomized method to simulate Lindblad dynamics by decomposing its generator into an ensemble of Lindbladians, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mo>=</mml:mo> <mml:munder> <mml:mo>∑</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>a</mml:mi> <mml:mo>∈</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> </mml:mrow> </mml:munder> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> </mml:math> , where each <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> </mml:math> comprises a simple Hamiltonian and a single jump operator. Assuming an efficient quantum simulation is available for the Lindblad evolution <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>t</mml:mi> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> </mml:mrow> </mml:msup> </mml:math> , we implement <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>t</mml:mi> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> </mml:mrow> </mml:msup> </mml:math> for a randomly sampled <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> </mml:math> at each time step according to a probability distribution <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>μ</mml:mi> </mml:math> over the ensemble <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi> </mml:mrow> <mml:mi>a</mml:mi> </mml:msub> <mml:msub> <mml:mo fence="false" stretchy="false">}</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>a</mml:mi> <mml:mo>∈</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> </mml:mrow> </mml:msub> </mml:math> . This randomized strategy reduces the quantum cost of simulating Lindblad dynamics, particularly in quantum many-body systems with a large or even infinite number of jump operators.Our contributions are two-fold. First, we provide a detailed convergence analysis of the proposed randomized method, covering both average and typical algorithmic realizations. This analysis extends the known results for the random product formula from closed systems to open systems, ensuring rigorous performance guarantees. Second, based on the random product approximation, we derive a new quantum Gibbs sampler algorithm that utilizes jump operators sampled from a Clifford-random circuit. This generator (i) can be efficiently implemented using our randomized algorithm, and (ii) exhibits a spectral gap lower bound that depends on the spectrum of the Hamiltonian. Our results present a new instance of a class of Hamiltonians for which the thermal states can be efficiently prepared using a quantum Gibbs sampling algorithm. </jats:p>