  Recently introduced shadow tomography protocols use classical shadows of
quantum states to predict many target functions of an unknown quantum state.
Unlike full quantum state tomography, shadow tomography does not insist on
accurate recovery of the density matrix for high rank mixed states. Yet, such a
protocol makes multiple accurate predictions with high confidence, based on a
moderate number of quantum measurements. One particular influential algorithm,
proposed by Huang, Kueng, and Preskill arXiv:2002.08953, requires additional
circuits for performing certain random unitary transformations. In this paper,
we avoid these transformations but employ an arbitrary informationally complete
POVM and show that such a procedure can compute k-bit correlation functions for
quantum states reliably. We also show that, for this application, we do not
need the median of means procedure of Huang et al. Finally, we discuss the
contrast between the computation of correlation functions and fidelity of
reconstruction of low rank density matrices.
