Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems

Authors: Tobias Olsacher, Tristan Kraft, Christian Kokail, Barbara Kraus, Peter Zoller

arXiv: 2405.06768v2 - DOI (quant-ph)
20 pages, 9 figures

Abstract: We discuss Hamiltonian and Liouvillian learning for analog quantum simulation from non-equilibrium quench dynamics in the limit of weakly dissipative many-body systems. We present and compare various methods and strategies to learn the operator content of the Hamiltonian and the Lindblad operators of the Liouvillian. We compare different ans\"atze based on an experimentally accessible "learning error" which we consider as a function of the number of runs of the experiment. Initially, the learning error decreases with the inverse square root of the number of runs, as the error in the reconstructed parameters is dominated by shot noise. Eventually the learning error remains constant, allowing us to recognize missing ansatz terms. A central aspect of our approaches is to (re-)parametrize ans\"atze by introducing and varying the dependencies between parameters. This allows us to identify the relevant parameters of the system, thereby reducing the complexity of the learning task. Importantly, this (re-)parametrization relies solely on classical post-processing, which is compelling given the finite amount of data available from experiments. We illustrate and compare our methods with two experimentally relevant spin models.

Submitted to arXiv on 10 May. 2024

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Beta

Look for similar papers (in beta version)

By clicking on the button above, our algorithm compares the title and abstract of this paper with all the papers of the same arXiv category that we have summarized, and finds the closest ones. You can rerun it from time to time: the results improve as our database grows.