Abstract
This article focuses on the development of scalable and quantum bit-efficient algorithms for computing power functions of random quantum states. Two algorithms, based on Hadamard testing and Gate Set Tomography, are proposed. We provide a comparative analysis of their computational outcomes, accompanied by a meticulous evaluation of inherent errors in the gate set tomography approach. The second algorithm exhibits a significant reduction in the utilization of two-qubit gates compared to the first. As an illustration, we apply both methods to compute the Von Neumann entropy of randomly generated quantum states.