We investigate the computational hardness of estimating the quantum -Rényi entropy and the quantum -Tsallis entropy , both of which converge to the von Neumann entropy as the order approaches . The promise problems Quantum -Rényi Entropy Approximation (RényiQEA) and Quantum -Tsallis Entropy Approximation (TsallisQEA) ask whether or , is at least or at most , where is typically a positive constant. Previous hardness results cover only the von Neumann entropy (order ) and some cases of the quantum -Tsallis entropy, while existing approaches do not readily extend to other orders. We establish that for all positive real and , and also for , the rank- variants Rank2RényiQEA and Rank2TsallisQEA are BQP-hard. Combined with prior (rank-dependent) quantum query algorithms in Wang, Guan, Liu, Zhang, and Ying (TIT 2024), Wang, Zhang, and Li (TIT 2024), and Liu and Wang (SODA 2025), as well as the one derived from O’Donnell and Wright (STOC 2016), our results imply: - For all real orders or , and for all real orders , LowRankRényiQEA and LowRankTsallisQEA are BQP-complete, where both are restricted versions of RényiQEA and TsallisQEA with of polynomial rank. - For all real order , TsallisQEA is BQP-complete. Our hardness results stem from reductions based on new inequalities relating the -Rényi or -Tsallis binary entropies of different orders. These reductions differ substantially from previous approaches, and the inequalities are of independent interest.

生成讲解博客的中文版本

生成AI智能校验的中文版本