Introduces semi-classical geometric tensor relating quantum geometric tensor to classical Fisher information matrix and proves a sharpened matrix inequality for multiparameter quantum bounds.
Cambridge university press
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A classical agent extracts more work from quantum temporal correlations via adaptive strategies bounded by the new Time-Ordered Free Energy, while reinforcement learning achieves polylogarithmic dissipation when learning unknown states.
Introduces r-deformed α-z-Rényi relative entropies that satisfy divergence axioms, obey data processing inequality in certain parameter ranges, and provide a tighter upper bound on Tsallis relative entropy for density operators than a prior bound.
Explicit exponential convergence bounds are derived for the classical and quantum capacities of GNS-symmetric quantum channels in terms of entropic properties.
A comprehensive review of entanglement cost in non-local quantum computation, connecting quantum cryptography, complexity theory, and holography.
citing papers explorer
-
Semi-classical geometric tensor in multiparameter quantum information
Introduces semi-classical geometric tensor relating quantum geometric tensor to classical Fisher information matrix and proves a sharpened matrix inequality for multiparameter quantum bounds.
-
A Demon that remembers: An agential approach towards quantum thermodynamics of temporal correlations
A classical agent extracts more work from quantum temporal correlations via adaptive strategies bounded by the new Time-Ordered Free Energy, while reinforcement learning achieves polylogarithmic dissipation when learning unknown states.
-
$r$-deformed $\alpha$-$z$-R\'enyi relative entropy
Introduces r-deformed α-z-Rényi relative entropies that satisfy divergence axioms, obey data processing inequality in certain parameter ranges, and provide a tighter upper bound on Tsallis relative entropy for density operators than a prior bound.
-
Fast convergence of Dynamic Capacities of GNS-Symmetric Quantum Channels
Explicit exponential convergence bounds are derived for the classical and quantum capacities of GNS-symmetric quantum channels in terms of entropic properties.
-
Entanglement cost in non-local quantum computation
A comprehensive review of entanglement cost in non-local quantum computation, connecting quantum cryptography, complexity theory, and holography.