Leakage Rate (LR): Metrics & Trade-Offs

• Leakage Rate is a metric that measures the transfer of physical quantities (information, mass, charge, or population) across boundaries with domain-specific definitions and formulas.
• It underpins analyses in diverse fields such as wireless security, quantum key distribution, semiconductor device performance, and hydrodynamics by guiding system design and trade-offs.
• Leakage Rate introduces crucial trade-offs between throughput and security, influencing error correction, privacy protocols, and practical measurement methodologies in engineering.

Leakage Rate (LR) quantifies the transfer of physical quantities—information, mass, charge, or population—across boundaries that are ideally impermeable or confidential. The exact metric, operational meaning, and mathematical representation of Leakage Rate are domain-specific but universally serve as critical performance constraints in security, sensing, engineering, and quantum information. This article presents a rigorous cross-disciplinary synthesis of LR, delineating its definitions, analytical forms, and tradeoffs in communication security, quantum key distribution, device physics, quantum error correction, privacy-constrained information theory, and classical hydrodynamics.

1. Fundamental Definitions and Domain-Specific Metrics

The term leakage rate appears in a range of precise forms across scientific domains:

• Information-Theoretic Leakage Rate (Wireless Security): In quasi-static fading wiretap channels, the average information Leakage Rate $R_L$ is the expected number of confidential bits per channel use revealed to an eavesdropper. For Rayleigh-fading single-antenna wiretap channels under fixed-rate wiretap coding (code rate $R_b$, secrecy rate $R_s$), it is given by:

$$R_L = \frac{1}{\ln 2}e^{1/\bar{\gamma}_e}\left[\mathrm{Ei}\left(-\frac{2^{R_b}}{\bar{\gamma}_e}\right) - \mathrm{Ei}\left(-\frac{2^{R_b-R_s}}{\bar{\gamma}_e}\right)\right],$$

where $\mathrm{Ei}(\cdot)$ is the exponential integral, $\bar{\gamma}_e$ is Eve's mean SNR (Huang et al., 2018).

• Quantum Key Distribution (QKD): The Leakage Rate $LR$ is the classical information per raw-key bit about Alice's sifted key revealed to an adversary due to information reconciliation. The raw definition is

$LR = \frac{\mathrm{leak}}{t}$

where $\mathrm{leak} = H_0(C) - H_\infty(C|X^{(t)})$ and $C$ is the reconciliation message. In Slepian-Wolf-optimal protocols, $LR = H(X|Y)$ (Elkouss et al., 2013).

• Classical Device Leakage Rate (Physical Systems): In hydrodynamics, leakage rate $Q$ ($\dot{V}$) is the volumetric flow rate through a boundary (e.g., pipeline leak, seal, fractured formation):

$Q = \frac{dV}{dt}$

For seal microchannels, $Q = (u_c^3 / 12\eta)\Delta P$ (Poiseuille), $u_c$ is critical separation, $\eta$ fluid viscosity (Lorenz et al., 2010).

• Semiconductor Device Leakage Rate: For irradiated silicon diodes and LGADs, leakage rate is the reverse dark current due to SRH bulk generation and trap-assisted transport:

$$J_{\mathrm{leak}}(T) = J_0\left(\frac{T}{300\, \mathrm K}\right)^2 \exp\left[-\frac{E_g}{2k}\left(\frac{1}{T} - \frac{1}{300\, \mathrm K}\right)\right]$$

(Yang et al., 2021).

• Quantum Information Leakage Rate: In quantum processors, the LR is the probability per operation that population leaves the computational subspace, e.g., for a CPTP noise channel $\Lambda$ on $H=H_c \oplus H_l$:

$$L_{\mathrm{ave}}(\Lambda) = \mathrm{Tr}[\Pi_l\,\Lambda(\Pi_c/d_c)]$$

(Wu et al., 2023, Xin et al., 21 Nov 2025).

• Privacy and Source Coding: For communication schemes with privacy constraints, the leakage rate generalizes to the normalized mutual information or maximum guessing probability:

$$\ell = \frac{1}{n} I(M; Y^n), \qquad L(P_{Q|M}) = \max_{q,m} P_{Q|M}(q|m) \ \in \ [1/M, 1]$$

(Goldfeld et al., 2015, Yakimenka et al., 2021).

2. Analytical Approximations and Computation

Leakage Rate formulas often involve intractable integrals or optimization over code and channel parameters; tractable closed forms are critical:

• Approximate Average Leakage Rate in Fading Channels: For $x=2^{R_b}$, $y=2^{R_s}$, the main exponential-integral difference can be approximated for large $R_b$ as $O \approx (3/10)\bar{\gamma}_e(y - 1)/x$, yielding

$$R_{Lp} = \frac{3\,\bar{\gamma}_e\,e^{1/\bar{\gamma}_e}}{10\,\ln 2}\frac{2^{R_s} - 1}{2^{R_b}}$$

enabling analytic transmission design (Huang et al., 2018).

• QKD Reconciliation Leakage: Asymptotically, for LDPC-based rate-adaptive protocols, $LR_{\mathrm{sp}}(\infty) = 1 - R$ with $R$ the effective code rate; $LR_{\mathrm{opt}} = H(X|Y)$ is the Slepian–Wolf limit (Elkouss et al., 2013).
• Seal Microfluidics: For rough seals, leak-rate $Q$ is governed by the critical-junction theory, $$Q = (L_y/L_x)[\alpha u_1(\zeta_c)]^3/(12\eta)\,\Delta P$$, with $u_1(\zeta_c)$ determined self-consistently via surface roughness spectra and contact mechanics (Lorenz et al., 2010).
• Quantum Gate Leakage: Benchmarked via leakage randomized benchmarking protocols, experimental survival probabilities decay exponentially as $$p_{\Pi_c}(m) \sim A + B\,e^{-\alpha m} + C\,e^{-\beta m}$$ with exponents related to $L_{\mathrm{ave}}$ (Wu et al., 2023, Xin et al., 21 Nov 2025).

3. Trade-Offs Involving Leakage Rate

Leakage Rate is an explicit constraint or penalty, introducing fundamental performance trade-offs:

• Throughput–Leakage Trade-off (Wiretap): For fixed-rate wiretap codes, maximizing throughput $\eta(R_b, R_s)$ under $R_L \leq \xi$ yields

$$R_s^* = \log_2\left[1 + \xi\,A\,2^{R_b}\right],\quad \eta^*(\xi) = \max_{R_b \ge -\log_2(1 - \xi A)}$$

Throughput saturates as the leakage constraint is relaxed; excessive security margin does not improve data rate (Huang et al., 2018).

• Privacy–Rate–Distortion–Leakage (Source Coding): With download rate $R$, distortion $D$, and maximal leak $L$, the tradeoff obeys

$$R^*(D,L;M) = \min_{P_{Q|M}\colon L(P_{Q|M}) \le L} \sum_q P_Q(q) \sum_{m=1}^M R_X(D_m^{(q)})$$

with boundary cases

$L=1/M:\ R = M R_X(D),\qquad L=1:\ R = R_X(D)$

(Yakimenka et al., 2021).

• Broadcast Channel Capacity–Leakage Region: Leak constraints $L_j$ enter Marton-like achievable rate regions by modifying the private-message bounds:

$$R_1 \leq I(U_1; Y_1|U_0) - I(U_1; U_2, Y_2|U_0) + L_1$$

and similarly for $R_2$; at $L_j=0$ the region reduces to standard confidentiality, at large $L_j$ to the unconstrained case (Goldfeld et al., 2015).

• Quantum Error Correction: Leakage rates directly constrain logical error suppression in code families; subsystem codes achieve considerably better logical protection per qubit under high leakage than subspace surface codes and retain effective distance up to threshold leakage rates $p \lesssim 7.5\times 10^{-4}$ (Brown et al., 2019).

4. Experimental Methodologies for Leakage Rate Measurement

Application-appropriate measurement protocols are domain-defined:

Domain	Measurement Protocol	Quantitative Output
Wireless Security	Analytical/numerical evaluation over SNR statistics	$R_L$ in bits/channel use
QKD	Classical message-length, smooth min-entropy chain rule	$LR$ per raw key bit
Semiconductor Devices	TCAD-SIMS calibrated current-voltage characteristics	$J_{\mathrm{leak}}$ (A)
Quantum Gates	Leakage (Interleaved) Randomized Benchmarking (LRB/iLRB)	$L_{\mathrm{ave}}$, $S_{\mathrm{ave}}$
PMT Enclosures	Accumulation-box SF$_6$ trace with sniffer, calibration runs	LR in Pa·m$^3$/s (SF$_6$/He equiv)
Fluidic Seals, Pipelines	Volumetric tracking (pressure drop, flow rate, transient analysis)	$Q = dV/dt$ (m$^3$/s)

For large-scale PMT electronics, a polycarbonate accumulation-box with SF$_6$ tracer and ppm sniffer provides a detection sensitivity of $2.3 \times 10^{-9}$ Pa·m$^3$/s (SF$_6$), well below the requirement for water ingress prevention (Chu et al., 30 May 2025).

5. Leakage Rate in Quantum Information and Device Physics

• Gate-Induced Leakage in Quantum Processors: For superconducting transmon processors, the LR per entangling gate (e.g., CZ, iSWAP) is extracted from conditional-oscillation experiments or leakage RB:

$$L_1 = \mathrm{Prob}[\textrm{leakage per gate}] \leq M/2,\quad M = 1 - P_{11 \rightarrow 11} - P_{11 \rightarrow 02}$$

Embedding a "Leakage Removal Unit" (LRU)—concurrent dispersively-tuned pulses—achieves removal fractions $R_{LRU} \simeq 98.4\%$ with negligible impact on computational-readout fidelity. Maintaining low leakage rates is essential to suppressing logical errors in memory and stability benchmarks (Xin et al., 21 Nov 2025).

• Passive Leakage Removal and Transport: Disordered transmon arrays support passive leakage evacuation with an engineered balance between leakage propagation ($J_{\text{prop}}$) and last-site reset by feedback measurement or dissipation. There are two optimal measurement rates: $\Gamma_{fb}^{low} \sim 2 J_{\text{prop}}$ (propagation-limited) and $\Gamma_{fb}^{high} \sim \bar{U}$ (disintegration-limited). Quantitatively, steady-state leakage population decays as $P_\star^{(L)}(t) \sim e^{-\Gamma_{\rm eff} t}$, so $\mathrm{LR} \equiv \Gamma_{\rm eff}$ (Martín-Vázquez et al., 20 Feb 2025).
• Code Performance Under Leakage: Subsystem surface codes (Bravyi–Bacon–Shor type) confine leakage-induced correlated errors spatially. For swap-based leakage reduction (swap-LR), subsystem codes outperform subspace codes below threshold rates $p \lesssim 7.5 \times 10^{-4}$ for DP-leakage and $p \lesssim 1.2 \times 10^{-3}$ for MS-leakage when using Bacon–Shor codes (Brown et al., 2019).

6. Device and Engineering Applications

• Semiconductor Detectors: LR modeling for LGADs under high neutron fluence incorporates both local acceptor removal and global midgap trapping, with post-irradiation scaling

$$I(\Phi_{eq},T) = M_I(\Phi_{eq})\, I_{\mathrm{gen}}(\Phi_{eq},T)$$

where $$I_{\mathrm{gen}} \propto \sum_i N_{t,i}(\Phi_{eq}) n_i(T)/\tau_i(T)$$, robustly matching measured currents at $-30^\circ$C to within 5–10% (Yang et al., 2021).

• Pipeline and Fluid Transport: In water/gas pipelines, LR is tied to orifice outflows. For unsteady gas dynamics in parallel pipes, the leak rate is modeled as a time-decaying function:

$$\dot{m}_{\mathrm{leak}}(t) = \frac{K g P_{in,0}}{2 a c^2} e^{-B t} H(x - \xi)$$

where $P_{in}(t)$ is the measured inlet pressure, yielding better correspondence to transients than static leak models (Aliyev et al., 11 Sep 2025). Extended Kalman Filter assimilation of transient pressures using a 24D hydraulic state vector enables accurate (<2% error) estimation of leak positions and rates in noisy environments with minimal sensors (P et al., 2021).

• Drilling and Well Integrity: Time-dependent LR during lost-circulation events in fractured formations is derived from Herschel–Bulkley rheology, giving

$LR(t) = 2\pi T_w r_f \dot{r}_f$

where $r_f(t)$ solves a nonlinear ODE involving fracture geometry and fluid parameters. Dimensional curve-sets ("type curves") allow fast field diagnosis, and Monte Carlo methods yield probabilistic LR/confidence bands for real-time operations (Albattat et al., 2020).

7. Leakage Rate Constraints in Information Theory and Security

• Broadcast Channels with Leakage Constraints: LR empirically links physical-layer security and capacity: a leakage constraint $L_1$ introduces a penalty term and additive relaxation in achievable rates. Inner bounds based on Marton coding and outer TV-approximation lemmas precisely delineate permissible tradeoffs. As $L_1 \to 0$, one recovers secrecy-capacity; for $L_1$ large, standard Marton/UVW bounds are restored (Goldfeld et al., 2015).
• Private Information Retrieval: In loss-tolerant PIR, the optimal download rate $R^*(D,L;M)$ trades off permissible average leakage $L$ (ML guess probability), reconstruction distortion $D$, and communication per file. With exact privacy ($L=1/M$) the rate matches that of downloading all files; with no privacy constraint ($L=1$) one recovers classical source coding (Yakimenka et al., 2021).

---

Summary Table: Primary Leakage Rate Metrics and Operation Domains

Context	LR Definition and Metric	Operational Implication
Wiretap channel	$R_L$: bits/use, average equivocation loss	Security-throughput optimization
QKD reconciliation	$LR$: leak per raw bit, min-entropy reduction	Limits on secret key length
Quantum gate/circuit	$L_{\mathrm{ave}}$: pop. leakage per gate/measure	Logical error rates, QEC thresholds
Semiconductor device	$J_{\mathrm{leak}}$: reverse current density	Radiation tolerance, device lifetime
Hydrodynamics/devices	$Q$: volumetric flow ($m^3$/s)	Integrity/safety monitoring
Privacy constraints	$\ell$, $L(P_{Q|M})$: MI or guess probability	Download cost, information-theoretic security
Broadcast channel	$\ell_j$: normalized MI ($I(M_j ; Y_k^n) / n$)	Achievable rates under secrecy budget

---

Leakage Rate is thus a central, domain-specific parameter that encapsulates leakage in various physical, information-theoretic, and engineering contexts, dictating operational security, code design, device integrity, privacy guarantees, and information flow. Its analytical expressions, measurement protocols, and optimization tradeoffs serve as foundational tools for the design and analysis of secure, robust, and high-integrity systems across science and engineering.