Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1512.02490 · Periodica Mathematica Hungarica

Transformations on density operators and on positive definite operators preserving the quantum Rényi divergence

Marcell Gaál, Lajos Molnár

Published Nov 10, 2016• 1 citation
arXivHTMLPDF
DOI
10.1007/s10998-016-0174-8

Related papers

Maps on positive definite operators preserving the quantum $$\chi _\alpha ^2$$ χ α 2 -divergence

Hongyi Chen, György Pál Gehér, Chih-Neng Liu +3 more

arXiv:1701.02523•Letters in Mathematical Physics•Sep 8, 2017•5 citations

Maps on positive operators preserving Rényi type relative entropies and maximal f-divergences

Marcell Gaál, Gergő Nagy

arXiv:1703.05244•Letters in Mathematical Physics•Oct 26, 2017•2 citations

Quantum Jensen-Shannon Divergences Between Infinite-Dimensional Positive Definite Operators

Hà Quang Minh

Lecture notes in computer science•Jan 1, 2021•0 citations

Maps on density operators preserving quantum $$f$$ -divergences

Lajos Molnár, Gergő Nagy, Patrícia Szokol

Quantum Information Processing•Jan 25, 2013•20 citations

Geometric Rényi divergence and RLD Fisher information under quantum processes without definite causal order

Zixin Huang, Mark M. Wilde

Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in $(0,1)\cup(1,2]$ and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.

quant-pharXiv:2610.39217•Oct 30, 2026•0 citations

Quantum Rényi Divergences and the Strong Converse Exponent of State Discrimination in Operator Algebras

Fumio Hiai, Milán Mosonyi

arXiv:2110.07320•Annales Henri Poincaré•Nov 22, 2022•8 citations
Maps on positive definite operators preserving the quantum χα2\chi _\alpha ^2χα2​ χ α 2 -divergence
Maps on density operators preserving quantum fff -divergences
Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in (0,1)∪(1,2](0,1)\cup(1,2](0,1)∪(1,2] and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.