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:2610.39217

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

Zixin Huang, Mark M. Wilde

quant-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks how much channel distinguishability and parameter information an experiment can extract without a definite causal order. It considers finite-dimensional processes whose action on tensor products of slot Choi operators is completely positive and produces a normalized channel or state for every independent choice of channels. This class includes fixed-order circuits and the quantum switch, but is not assumed entirely physically realizable. For geometric Rényi divergence, it proves $\widehat D_\alpha(\mathcal W(\mathcal N_1,\ldots,\mathcal N_n)\|\mathcal W(\mathcal M_1,\ldots,\mathcal M_n))\leq\sum_i\widehat D_\alpha(\mathcal N_i\|\mathcal M_i)$ for $\alpha\in(0,1)\cup(1,2]$. Optimizing over channel-to-state processes gives equality, approached by independent reference-assisted parallel probes. The proof combines operator-perspective Jensen inequalities with a normalization lemma bounding process weights of positive product operators by products of their input marginals’ extremal eigenvalues. The lower bound uses reciprocal input effects, affine extension of channel normalization, and Cauchy–Schwarz. For differentiable channel families and a parameter-independent process, it also proves $I_{\rm RLD}^{\rm out}\leq\sum_i I_{\rm RLD}^{(i)}$. Affine Choi perturbations establish this for singular channels. Consequently, locally unbiased estimators satisfy $\operatorname{MSE}\geq1/\sum_i I_{\rm RLD}^{(i)}$; estimating an erasure probability attains $p(1-p)/n$. Applications give finite-use discrimination and exclusion converses, plus communication and resource-generation bounds conditional on additional comparison-output preservation. Divergence optimization does not characterize the full finite-use discrimination region or optimal Stein threshold. RLD bounds need not be attainable and become vacuous for nontrivial unitary families. Infinite-dimensional and multiparameter extensions are left open.

Little sign of AI-generated textAI use disclosed
ChatGPT assisted with proof formulation and exploration, exposition, literature checks, figure preparation, and numerical tests during the development of this manuscript.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Greatest Quantum Channels with Prescribed Maximal Information

Harjas Sandhu

Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.

•Nov 6, 2026•0 citations

Asymptotic Attainability of the Channel RLD Fisher-Information Bound

Masahito Hayashi

The channel right-logarithmic-derivative (RLD) Fisher information is a computable upper bound on the optimal asymptotic symmetric-logarithmic-derivative (SLD) Fisher information per channel use over causally ordered, parameter-independent strategies. The bound is not always attained, even if the Choi matrix is positive definite. We determine exactly when equality holds using a semidefinite feasibility condition involving only the Choi matrix and its first derivative. The condition allows a degenerate largest eigenvalue of the RLD matrix and rank-deficient Choi matrices with derivatives supported on their range. The original channel family may change rank nearby. For generalized dephasing channels with a positive-definite correlation matrix at the evaluation point, the condition becomes a system of linear equations for nonnegative certificate weights that sum to one. At a completely dephasing point we also calculate the optimal SLD information for every finite number of uses and show that a repeated, ancilla-free probe attains it, even against adaptive strategies. Explicit examples give an unbounded ratio of the channel RLD information to the optimal asymptotic SLD information per use, either as the dimension grows or at fixed qubit dimension as the smallest Choi eigenvalue tends to zero. We derive the equality criterion and its consequences from the asymptotic optimization of Zhou and Jiang.

arXiv:2611.16578•Nov 12, 2026•0 citations

RLD Fisher information bound for multiparameter estimation of quantum channels

Vishal Katariya, Mark M. Wilde

Abstract One of the fundamental tasks in quantum metrology is to estimate multiple parameters embedded in a noisy process, i.e. a quantum channel. In this paper, we study fundamental limits to quantum channel estimation via the concept of amortization and the right logarithmic derivative (RLD) Fisher information value. Our key technical result is the proof of a chain-rule inequality for the RLD Fisher information value, which implies that amortization, i.e. access to a catalyst state family, does not increase the RLD Fisher information value of quantum channels. This technical result leads to a fundamental and efficiently computable limitation for multiparameter channel estimation in the sequential setting, in terms of the RLD Fisher information value. As a consequence, we conclude that if the RLD Fisher information value is finite, then Heisenberg scaling is unattainable in the multiparameter setting.

arXiv:2008.11178•New Journal of Physics•Jul 1, 2021•8 citations

Geometric Rényi Divergence and its Applications in Quantum Channel Capacities

Kun Fang, Hamza Fawzi

Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.

arXiv:1909.05758•Communications in Mathematical Physics•May 24, 2021•89 citations

Quantum Fisher information matrices from Rényi relative entropies

Mark M. Wilde

Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, $α$-$z$, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter $α$, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter $α$ even though the original quantities do not. Additionally, I derive and establish basic properties of $α$-$z$ information matrices resulting from the $α$-$z$ Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their $α$-$z$ information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.

arXiv:2510.02218•Oct 2, 2025•12 citations

Fundamental Limits of Quantum Metrology Beyond Fixed Causal Order

Wenjie Wei, Yutong Li, Shengshi Pang

Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in $N$ identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.

quant-pharXiv:2609.05355•Sep 7, 2026•3 citations
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.
The paper asks how much channel distinguishability and parameter information an experiment can extract without a definite causal order. It considers finite-dimensional processes whose action on tensor products of slot Choi operators is completely positive and produces a normalized channel or state for every independent choice of channels. This class includes fixed-order circuits and the quantum switch, but is not assumed entirely physically realizable.
For geometric Rényi divergence, it proves D^α(W(N1,…,Nn)∥W(M1,…,Mn))≤∑iD^α(Ni∥Mi)\widehat D_\alpha(\mathcal W(\mathcal N_1,\ldots,\mathcal N_n)\|\mathcal W(\mathcal M_1,\ldots,\mathcal M_n))\leq\sum_i\widehat D_\alpha(\mathcal N_i\|\mathcal M_i)Dα​(W(N1​,…,Nn​)∥W(M1​,…,Mn​))≤∑i​Dα​(Ni​∥Mi​) for α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2]. Optimizing over channel-to-state processes gives equality, approached by independent reference-assisted parallel probes. The proof combines operator-perspective Jensen inequalities with a normalization lemma bounding process weights of positive product operators by products of their input marginals’ extremal eigenvalues. The lower bound uses reciprocal input effects, affine extension of channel normalization, and Cauchy–Schwarz.
For differentiable channel families and a parameter-independent process, it also proves IRLDout≤∑iIRLD(i)I_{\rm RLD}^{\rm out}\leq\sum_i I_{\rm RLD}^{(i)}IRLDout​≤∑i​IRLD(i)​. Affine Choi perturbations establish this for singular channels. Consequently, locally unbiased estimators satisfy MSE⁡≥1/∑iIRLD(i)\operatorname{MSE}\geq1/\sum_i I_{\rm RLD}^{(i)}MSE≥1/∑i​IRLD(i)​; estimating an erasure probability attains p(1−p)/np(1-p)/np(1−p)/n.
Applications give finite-use discrimination and exclusion converses, plus communication and resource-generation bounds conditional on additional comparison-output preservation. Divergence optimization does not characterize the full finite-use discrimination region or optimal Stein threshold. RLD bounds need not be attainable and become vacuous for nontrivial unitary families. Infinite-dimensional and multiparameter extensions are left open.
Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.
The channel right-logarithmic-derivative (RLD) Fisher information is a computable upper bound on the optimal asymptotic symmetric-logarithmic-derivative (SLD) Fisher information per channel use over causally ordered, parameter-independent strategies. The bound is not always attained, even if the Choi matrix is positive definite. We determine exactly when equality holds using a semidefinite feasibility condition involving only the Choi matrix and its first derivative. The condition allows a degenerate largest eigenvalue of the RLD matrix and rank-deficient Choi matrices with derivatives supported on their range. The original channel family may change rank nearby. For generalized dephasing channels with a positive-definite correlation matrix at the evaluation point, the condition becomes a system of linear equations for nonnegative certificate weights that sum to one. At a completely dephasing point we also calculate the optimal SLD information for every finite number of uses and show that a repeated, ancilla-free probe attains it, even against adaptive strategies. Explicit examples give an unbounded ratio of the channel RLD information to the optimal asymptotic SLD information per use, either as the dimension grows or at fixed qubit dimension as the smallest Choi eigenvalue tends to zero. We derive the equality criterion and its consequences from the asymptotic optimization of Zhou and Jiang.
Abstract One of the fundamental tasks in quantum metrology is to estimate multiple parameters embedded in a noisy process, i.e. a quantum channel. In this paper, we study fundamental limits to quantum channel estimation via the concept of amortization and the right logarithmic derivative (RLD) Fisher information value. Our key technical result is the proof of a chain-rule inequality for the RLD Fisher information value, which implies that amortization, i.e. access to a catalyst state family, does not increase the RLD Fisher information value of quantum channels. This technical result leads to a fundamental and efficiently computable limitation for multiparameter channel estimation in the sequential setting, in terms of the RLD Fisher information value. As a consequence, we conclude that if the RLD Fisher information value is finite, then Heisenberg scaling is unattainable in the multiparameter setting.
Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.
Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, ααα-zzz, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter ααα, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter ααα even though the original quantities do not. Additionally, I derive and establish basic properties of ααα-zzz information matrices resulting from the ααα-zzz Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their ααα-zzz information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.
Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in NNN identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.