pith. sign in

arxiv: 1002.1330 · v2 · pith:YTQMNQDBnew · submitted 2010-02-05 · 🪐 quant-ph

Efficient estimation of nearly sparse many-body quantum Hamiltonians

classification 🪐 quant-ph
keywords hamiltonianquantumalgorithmefficientinteractionsnearlyapplyapproach
0
0 comments X
read the original abstract

We develop an efficient and robust approach to Hamiltonian identification for multipartite quantum systems based on the method of compressed sensing. This work demonstrates that with only O(s log(d)) experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a d-dimensional system, provided that the Hamiltonian is nearly s-sparse in a known basis. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.