On Estimating the Quantum Tsallis Relative Entropy

• URL: http://arxiv.org/abs/2510.00752v1
• Date: Wed, 01 Oct 2025 10:38:59 GMT
• Title: On Estimating the Quantum Tsallis Relative Entropy
• Authors: Jinge Bao, Minbo Gao, Qisheng Wang,
• Abstract summary: The relative entropy between quantum states quantifies their distinguishability.<n>We show that for any constant $alpha in (0, 1)$, the $alpha$-Tsallis relative entropy between two quantum states of rank $r$ can be estimated.<n>We also show that the quantum state distinguishability problems with respect to the quantum $alpha$-Tsallis relative entropy and quantum Hellinger distance are $mathsfQSZK$-complete in a certain regime.
• Score: 10.925697720070426
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The relative entropy between quantum states quantifies their distinguishability. The estimation of certain relative entropies has been investigated in the literature, e.g., the von Neumann relative entropy and sandwiched R\'enyi relative entropy. In this paper, we present a comprehensive study of the estimation of the quantum Tsallis relative entropy. We show that for any constant $\alpha \in (0, 1)$, the $\alpha$-Tsallis relative entropy between two quantum states of rank $r$ can be estimated with sample complexity $\operatorname{poly}(r)$, which can be made more efficient if we know their state-preparation circuits. As an application, we obtain an approach to tolerant quantum state certification with respect to the quantum Hellinger distance with sample complexity $\widetilde{O}(r^{3.5})$, which exponentially outperforms the folklore approach based on quantum state tomography when $r$ is polynomial in the number of qubits. In addition, we show that the quantum state distinguishability problems with respect to the quantum $\alpha$-Tsallis relative entropy and quantum Hellinger distance are $\mathsf{QSZK}$-complete in a certain regime, and they are $\mathsf{BQP}$-complete in the low-rank case.

Related papers

• Quantum relative entropy for unravelings of master equations [0.0]
  This work explores connections between the quantum relative entropy of two faithful states $,$ and the Kullback-Leibler divergences of classical measures $,$.
  arXiv  Detail & Related papers  (2025-11-28T08:31:14Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Near-Optimal Simultaneous Estimation of Quantum State Moments [7.1834855718325805]
  We introduce a framework for resource-efficient simultaneous estimation of quantum state moments via qubit reuse.<n>By leveraging qubit reset operations, our core circuit for simultaneous moment estimation requires only $2m+1$ physical qubits and $mathcalO(k)$ CSWAP gates.<n>We demonstrate this protocol's utility by showing that the estimated moments yield tight bounds on a state's maximum eigenvalue and present applications in quantum virtual cooling to access low-energy states of the Heisenberg model.
  arXiv  Detail & Related papers  (2025-09-29T14:23:26Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• Sample-Efficient Estimation of Nonlinear Quantum State Functions [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>Our framework enables the implementation of arbitrarily normalized degree-$n$ functions of quantum states with precision.<n>We apply QSF for developing quantum algorithms for fundamental tasks, including entropy, fidelity, and eigenvalue estimations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Conditional entropy and information of quantum processes [0.7499722271664144]
  We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy.
  arXiv  Detail & Related papers  (2024-10-02T16:50:47Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state.<n>It offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme.<n>It gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Quantum Neural Estimation of Entropies [20.12693323453867]
  entropy measures quantify the amount of information and correlation present in a quantum system. We propose a variational quantum algorithm for estimating the von Neumann and R'enyi entropies, as well as the measured relative entropy and measured R'enyi relative entropy.
  arXiv  Detail & Related papers  (2023-07-03T17:30:09Z)
• Asymptotic Equipartition Theorems in von Neumann algebras [16.37352624912904]
  We show that the smooth max entropy of i.i.d. states on a von Neumann algebra has an rate given by the quantum relative entropy.<n>Our AEP not only applies to states, but also to quantum channels with appropriate restrictions.
  arXiv  Detail & Related papers  (2022-12-30T13:42:35Z)
• The Wasserstein distance of order 1 for quantum spin systems on infinite lattices [13.452510519858995]
  We show a generalization of the Wasserstein distance of order 1 to quantum spin systems on the lattice $mathbbZd$. We also prove that local quantum commuting interactions above a critical temperature satisfy a transportation-cost inequality.
  arXiv  Detail & Related papers  (2022-10-20T17:46:18Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)
• Relating relative R\'enyi entropies and Wigner-Yanase-Dyson skew information to generalized multiple quantum coherences [0.0]
  We investigate the $alpha$-MQCs, a novel class of multiple quantum coherences based on $alpha$-relative purity. Our framework enables linking $alpha$-MQCs to Wigner-Yanase-Dyson skew information. We illustrate these ideas for quantum systems described by single-qubit states, two-qubit Bell-diagonal states, and a wide class of multiparticle mixed states.
  arXiv  Detail & Related papers  (2020-02-25T21:12:32Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.