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.
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.
Quantum channel discrimination is a highly versatile task in quantum information. Almost any physical process can be modelled as a quantum channel, so discrimination between channels has broad applications across many fields of science. Since the processes modelled by quantum channels and the contexts in which we want to discriminate between them are so wide-ranging, it should come as no surprise that the possible protocols are equally varied. The most general discrimination protocols can use any sequence of operations allowed by physics. \n \nThis is what makes protocol stretching such a powerful mathematical tool. It allows the calculation of bounds on the performance of any discrimination protocol and can be applied to any situation in which the channels involved are jointly simulable by some quantum processor. \n \nCertain channels, such as the amplitude damping channels, cannot be simulated using standard teleportation. Others, like the lossy bosonic channels, can be (individually) simulated using teleportation, but two lossy channels with different losses cannot be jointly simulated. \n \nIn this thesis, we characterise port-based teleportation so that it can be used as a tool for channel simulation. Port-based teleportation is a variant of quantum teleportation that can simulate any channel in the asymptotic limit of infinite ports. For a finite number of ports, we can find resource states that simulate amplitude damping channels well. By combining our channel simulations with the technique of protocol stretching, we are able to tighten existing bounds on the discrimination of amplitude-damping channels. \n \nWe also address the relatively unstudied subfield of channel position finding. We use channel simulation to bound the performance of environment localisation, and we show the viability of idler-free channel position finding over pure loss channels. Finally, we calculate the secret key rate for a scenario of quantum hacking based on a side channel in the sender's device.
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 analyze minimum-error discrimination of two qubit dynamical processes generated by phase-covariant amplitude-damping Lindbladians in a single-use scenario. The optimization involves both the input probe, possibly entangled with an isolated ancilla, and the interrogation time. For unassisted probes we obtain a closed expression for the optimal trace-norm distinguishability at fixed time, with distinct interior and boundary branches. For entanglement-assisted probes, the common phase covariance of the two channels reduces the diamond-norm optimization to a one-parameter Schmidt family. The resulting formula gives transparent sufficient conditions for fixed-time entanglement advantage and separates this local advantage from advantage after global optimization over time. We exhibit examples in which the best unassisted strategy is approached only asymptotically, whereas an entangled probe achieves a strictly smaller error probability at finite time.
Quantum hypothesis testing is an important tool for quantum information processing.Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained.In both scenarios, the testing between quantum states is relatively well understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channels is less understood.Although the ultimate limit of minimum error discrimination between channels has been explored recently, the corresponding limit of unambiguous discrimination is unknown.In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels.In particular, in the channel case, our lower bound of the inconclusive probability holds for arbitrary adaptive sensing protocols.For the special class of "teleportation-covariant" channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.
Amplitude-damping (AD) noise, which models energy relaxation and spontaneous decay, is a dominant source of decoherence in quantum systems such as atoms, ions, photonics, and superconducting qubits. While the qubit (two-level) AD channel has been extensively analyzed, its generalization to higherdimensional systems (qudits) remains less explored despite their practical relevance. This paper develops a systematic framework to evaluate and compare the performance of qubits and qudits under amplitude-damping noise. Closed-form expressions are derived for several fidelity measures, including computational basis, equal superposition, and Haar-average fidelities. We then numerically estimate the single-letter coherent informationQ1as a lower bound on the quantum capacity. A normalized performance score combining fidelity and capacity is proposed to identify optimal qudit dimensions across different damping probabilities. Simulation results reveal that higher-dimensional systems can outperform qubits in low-noise regimes, while qubits remain more robust under strong damping. The resulting “recommendation map” offers practical guidance for the experimental selection of qudit dimension in amplitude-damping environments.
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.