Curator's Take
AI Commentary
This article introduces Lindblad Multiproduct Formulas, a new error‑mitigation framework that leverages two‑dimensional tensor networks and loop‑corrected belief propagation to compute correction factors cheaper than the observables themselves. By combining Clifford rescaling with an estimated error bar, the authors demonstrate the technique on a 65‑qubit heavy‑hex lattice and achieve up to a 5.6× GPU speedup in the classical post‑processing, showing that sophisticated tensor‑network tools can now be deployed on near‑term hardware. If the approach scales to larger, more complex circuits, it could become a practical bridge between noisy quantum devices and high‑fidelity simulations, though its applicability may still be limited to problems amenable to low‑dimensional tensor‑network representations.
— Mark Eatherly
Summary
We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The quantities required to implement the error mitigation scheme that are evaluated with tensor networks can be less computationally expensive to calculate than the expectation values themselves, thus allowing for the possibility of applying our method to certain systems for which tensor network methods may struggle to calculate the observable quantities of interest. The workflow incorporates Clifford rescaling techniques and outputs an estimated error bar. We apply our method to a model of two-dimensional discrete time crystals studied previously and implement it on $65$ qubits arranged in a $3\!\times\!3$ heavy-hexagonal topology on the quantum computer ibm_basquecountry. We show that a GPU implementation of the classical part of our workflow achieves a speedup of up to $5.6\times$.