We investigate the computational hardness of estimating the quantum
α-Rényi entropy
SαR(ρ)=1−αlnTr(ρα) and the quantum
q-Tsallis entropy
SqT(ρ)=q−11−Tr(ρq), both of which converge to the von Neumann entropy as the order approaches
1. The promise problems Quantum
α-Rényi Entropy Approximation (RényiQEA
α) and Quantum
q-Tsallis Entropy Approximation (TsallisQEA
q) ask whether $ {\rm S}^ {\tt R}_α(ρ)$ or
SqT(ρ), is at least
τ1 or at most
τ2, where
τ1−τ2 is typically a positive constant. Previous hardness results cover only the von Neumann entropy (order
1) and some cases of the quantum
q-Tsallis entropy, while existing approaches do not readily extend to other orders.
We establish that for all positive real
α and
q, and also for
α=∞, the rank-
2 variants Rank2RényiQEA
α and Rank2TsallisQEA
q 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
α>0 or
α=∞, and for all real orders
0<q≤1, LowRankRényiQEA
α and LowRankTsallisQEA
q are BQP-complete, where both are restricted versions of RényiQEA
α and TsallisQEA
q with
ρ of polynomial rank.
- For all real order
q>1, TsallisQEA
q is BQP-complete.
Our hardness results stem from reductions based on new inequalities relating the
α-Rényi or
q-Tsallis binary entropies of different orders. These reductions differ substantially from previous approaches, and the inequalities are of independent interest.
The main aim of this thesis is to study quantum dynamics, with a focus on irreversible, dissipative dynamics, by collecting repeated observations and arranging them to form a process. This leads to quantum states of extended models with some simplifying features. The models explored here are quantum spins on Fermionic lattices and chains of quantum spins. We focus in particular on the randomising properties of the dynamics. The thesis begins by exploring the relation between the average von Neumann and Renyi entropies of integer orders for shift-invariant quasi-free Fermionic lattice systems. This then leads to an investigation into approximating the von Neumann entropy in terms of a combination of integer-order Renyi entropies and an estimate for the quality of such an approximation is given. Later, a rather general technique is introduced to model a quantum system’s dynamics on a semi-infinite half-chain of quantum spins. Here, bounds are given for the average entropy of the model system as well as a general scheme for computing the average Renyi entropy of integer order of such models. Finally, the half-chain model is made explicit with the example of a simple qubit evolving under a thermalising dissipative dynamics. With this example, the integer-order Renyi entropies are explicitly calculated. By optimising over all possible choices of models, a model-independent expression for the average Renyi entropies is derived.
We study the entanglement entropy of connected bipartitions in free-fermion gases of N particles in arbitrary dimension d . We show that the von Neumann and Rényi entanglement entropies grow asymptotically as N ( d −1)/ d ln N , with a prefactor that is analytically computed using the Widom conjecture both for periodic and open boundary conditions. The logarithmic correction to the power-law behavior is related to the area-law violation in lattice free fermions. These asymptotic large- N behaviors are checked against exact numerical calculations for N -particle systems.