Efficiently learning non-Markovian noise in many-body quantum simulators
Jordi A. Montañà-López, Andreas Elben, Joonhee Choi, Rahul Trivedi
TL;DR
The paper tackles learning non-Markovian noise in many-body quantum simulators under a stationary Gaussian environment by focusing memory kernels that encode environment correlations. It develops a measurement protocol using short-time evolution, product-state preparation, a single layer of local gates, and Pauli measurements to extract derivatives of memory kernels, with provable sample complexity that scales favorably with system size for fixed derivative order M. The approach handles both non-Markovian noise and an ensemble-Hamiltonian model with Gaussian coefficients, giving logarithmic (or near-logarithmic) sample complexity in N for the former and efficient means to recover means and covariances in the latter. Numerically, the method demonstrates accurate recovery of kernel parameters and Hamiltonian means for models with finite memory and dense correlations, and shows error scaling behaving as 1/√S with shot noise while remaining robust to increasing system size under reasonable locality assumptions.
Abstract
As quantum simulators are scaled up to larger system sizes and lower noise rates, non-Markovian noise channels are expected to become dominant. While provably efficient protocols for Markovian models of quantum simulators, either closed system models (described by a Hamiltonian) or open system models (described by a Lindbladian), have been developed, it remains less well understood whether similar protocols for non-Markovian models exist. In this paper, we consider geometrically local lattice models with both quantum and classical non-Markovian noise and show that, under a Gaussian assumption on the noise, we can learn the noise with sample complexity scaling logarithmically with the system size. Our protocol requires preparing the simulator qubits initially in a product state, introducing a layer of single-qubit Clifford gates and measuring product observables.
