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

Exact Diamond Distance to Equilibrium for a Qubit Generalized-Amplitude-Damping Channel

Boris Batenin, Andrei Preece

Published Nov 10, 2026• 0 citations
Publisher

Abstract

This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.

DOI
10.5281/zenodo.24103828

Related papers

Exact Robustness Frontiers and Fidelity Limits for Qubit Memories

Ying Xie

We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.

•Nov 12, 2026•0 citations

Quantum Processes with Recovery: Normal Form, Stability, and Memory Certification

David Gutierrez Ule

We characterize two-step quantum processes with a prescribed first channel whose unperturbed final evolution exactly recovers the input. For a system of dimension d and a first channel of Kraus rank k > 1, the compatible family is affinely bijective to the set of channels from dimension d(k−1) to dimension d. For qubit dephasing with residual coherence r, an intermediate X intervention not only reconstructs the parametrizing channel but also attains the optimal operational distance, equal to (1−r²) times the diamond distance between the parametrizing channels. We determine the classical subfamily, its minimum register cardinality, and the maximal temporal negativity (1−r²)/2. For imperfect recovery, we prove O(√δ) proximity to the exact family while preserving the first channel, with dimension-independent constants. An explicit two-qubit example shows that the exponent 1/2 cannot be uniformly improved. Finally, we derive a Pauli-cycle witness whose exact classically attainable region is characterized by a quadratic inequality involving the cyclic coherence and two return probabilities. The witness requires neither population preservation nor perfect recovery. A linear version uses twelve experimental settings and admits explicit finite-sample significance bounds with calibrated control errors. Analytical proofs are accompanied by reproducible code. No experimental data or departures from standard quantum mechanics are claimed.

•Oct 26, 2026•0 citations

Quantum-Event Reachability Certificates, dissipative Mixing, and formally verified Coherence Benchmarks

Boris Batenin, Andrei Preece

Can a quantum event be certified without simulating the full quantum state? This study develops rigorous, event-specific probability bounds for constrained, finite-dimensional open quantum systems described by Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) dynamics. For initially unexcited targets, locally bounded Hamiltonian transitions that change at most one target occupation, and dissipation that preserves or lowers these occupations, it proves the sharp joint-excitation envelope pA(t) ≤ ∏j∈A sin²(min{π/2, ∫₀ᵗ uj(s) ds}). Independent resonant drives attain this bound within the stated model class. Complementary rational-polynomial certificates, interaction-dependent estimates, and bounds under pumping, coherent leakage, and guaranteed loss provide checkable alternatives for finite-time and all-time reachability questions. The analysis also examines how much information a particular event actually requires, distinguishing exact observable reductions and scalar trajectories from the exponentially larger ambient state description. Positive-operator barriers and operator-Schmidt-rank constraints clarify the resources and limitations of compact certificates. For independent generalized-amplitude-damping channels, the work establishes an ancilla-stable dissipative mixing bound: ‖⊗ⱼ Φⱼ,ₜ − ⊗ⱼ Rⱼ‖⋄ ≤ min{2, ∑ⱼ(rⱼ + rⱼ²)} ≤ 2N exp(−γ*t), where rⱼ = exp(−λⱼt/2) and γ* = minⱼ(λⱼ/2). The arbitrary-finite-ancilla hybrid inequality and resulting product-channel envelope are supported by kernel-checked Lean theorems; the leading long-time diamond-norm coefficient is established analytically, not formally verified. A separate formal development checks gauge-fixed Fibonacci fusion and braiding coherence identities, including pentagon and hexagon relations, and provides an ideal braid benchmark with conditional bounds for noisy encoded implementations. Taken together, the results offer a framework for auditable quantum-event certificates, model-specific noise benchmarks, and experimentally distinguishable predictions, while keeping their scope explicit: the claims depend on specified dynamics and controls and do not establish a new conservation law, microscopic topological protection, or universal computational advantage. Natural next steps include broader machine-checked dynamical certificates and validated interfaces from experimental models to formal proof objects.

•Nov 9, 2026•0 citations

BINDU–VECTRA: Machine-Checked Ancilla-Uniform Mixing Bounds for Independent Generalized Amplitude-Damping Channels

Boris Batenin, Andrei Preece

BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖[(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A](X)‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖[(ℋₖ₊₁ − ℋₖ) ⊗ id_A](X)‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.

•Nov 10, 2026•0 citations

Exact Reference-Assisted Entropy Contraction from the Choi Matrix

Harjas Sandhu

How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.

•Nov 14, 2026•0 citations

Bounds on amplitude-damping-channel discrimination

Jason L. Pereira, Stefano Pirandola

Amplitude-damping (AD) channels are good models for many physical scenarios, and so the development of protocols to discriminate between them is an important task in quantum information science. It is therefore important to bound the performance of such protocols. Since adaptivity has been shown to improve the performance of discrimination protocols, bounds on the distinguishability of AD channels must take this into account. In this paper, we use both channel simulation and a bound based on the diamond norm to significantly tighten the upper bound on the trace norm between the possible outputs of binary channel discrimination protocols acting on AD channels (and hence the lower bound on the error probability of such protocols). The diamond norm between any two AD channels is found analytically, giving the optimal error probability for a one-shot discrimination protocol. We also present a tighter lower bound on the achievable trace norm between protocol outputs (and a corresponding upper bound on the achievable error probability). The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios.

arXiv:2009.04783•Physical Review A•Feb 18, 2021•19 citations
This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
We characterize two-step quantum processes with a prescribed first channel whose unperturbed final evolution exactly recovers the input. For a system of dimension d and a first channel of Kraus rank k > 1, the compatible family is affinely bijective to the set of channels from dimension d(k−1) to dimension d. For qubit dephasing with residual coherence r, an intermediate X intervention not only reconstructs the parametrizing channel but also attains the optimal operational distance, equal to (1−r²) times the diamond distance between the parametrizing channels. We determine the classical subfamily, its minimum register cardinality, and the maximal temporal negativity (1−r²)/2. For imperfect recovery, we prove O(√δ) proximity to the exact family while preserving the first channel, with dimension-independent constants. An explicit two-qubit example shows that the exponent 1/2 cannot be uniformly improved. Finally, we derive a Pauli-cycle witness whose exact classically attainable region is characterized by a quadratic inequality involving the cyclic coherence and two return probabilities. The witness requires neither population preservation nor perfect recovery. A linear version uses twelve experimental settings and admits explicit finite-sample significance bounds with calibrated control errors. Analytical proofs are accompanied by reproducible code. No experimental data or departures from standard quantum mechanics are claimed.
Can a quantum event be certified without simulating the full quantum state? This study develops rigorous, event-specific probability bounds for constrained, finite-dimensional open quantum systems described by Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) dynamics. For initially unexcited targets, locally bounded Hamiltonian transitions that change at most one target occupation, and dissipation that preserves or lowers these occupations, it proves the sharp joint-excitation envelope pA(t) ≤ ∏j∈A sin²(min{π/2, ∫₀ᵗ uj(s) ds}). Independent resonant drives attain this bound within the stated model class. Complementary rational-polynomial certificates, interaction-dependent estimates, and bounds under pumping, coherent leakage, and guaranteed loss provide checkable alternatives for finite-time and all-time reachability questions. The analysis also examines how much information a particular event actually requires, distinguishing exact observable reductions and scalar trajectories from the exponentially larger ambient state description. Positive-operator barriers and operator-Schmidt-rank constraints clarify the resources and limitations of compact certificates. For independent generalized-amplitude-damping channels, the work establishes an ancilla-stable dissipative mixing bound: ‖⊗ⱼ Φⱼ,ₜ − ⊗ⱼ Rⱼ‖⋄ ≤ min{2, ∑ⱼ(rⱼ + rⱼ²)} ≤ 2N exp(−γ*t), where rⱼ = exp(−λⱼt/2) and γ* = minⱼ(λⱼ/2). The arbitrary-finite-ancilla hybrid inequality and resulting product-channel envelope are supported by kernel-checked Lean theorems; the leading long-time diamond-norm coefficient is established analytically, not formally verified. A separate formal development checks gauge-fixed Fibonacci fusion and braiding coherence identities, including pentagon and hexagon relations, and provides an ideal braid benchmark with conditional bounds for noisy encoded implementations. Taken together, the results offer a framework for auditable quantum-event certificates, model-specific noise benchmarks, and experimentally distinguishable predictions, while keeping their scope explicit: the claims depend on specified dynamics and controls and do not establish a new conservation law, microscopic topological protection, or universal computational advantage. Natural next steps include broader machine-checked dynamical certificates and validated interfaces from experimental models to formal proof objects.
BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖[(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A](X)‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖[(ℋₖ₊₁ − ℋₖ) ⊗ id_A](X)‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
Amplitude-damping (AD) channels are good models for many physical scenarios, and so the development of protocols to discriminate between them is an important task in quantum information science. It is therefore important to bound the performance of such protocols. Since adaptivity has been shown to improve the performance of discrimination protocols, bounds on the distinguishability of AD channels must take this into account. In this paper, we use both channel simulation and a bound based on the diamond norm to significantly tighten the upper bound on the trace norm between the possible outputs of binary channel discrimination protocols acting on AD channels (and hence the lower bound on the error probability of such protocols). The diamond norm between any two AD channels is found analytically, giving the optimal error probability for a one-shot discrimination protocol. We also present a tighter lower bound on the achievable trace norm between protocol outputs (and a corresponding upper bound on the achievable error probability). The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios.