Block decoding contracts finite total-variation distance
ProvedThresholdTheorem.tvDist_decodeDist_lefault-tolerancequantum-computingtotal-variation
Let and be arbitrary real-valued functions on the finite set of physical measurement strings of blocks of bits. Decode each block deterministically into one logical bit and push both functions forward by summing over the fibers of this decoding map. Then
This finite data-processing inequality requires no positivity or normalization assumptions on and . It allows a physical output error bound to pass unchanged through the block decoder in the threshold-theorem circuit model.
Preamble
import Definitions.Def_threshold_theorem_noise_model open ThresholdTheorem
Formal statement
namespace ThresholdTheorem
theorem tvDist_decodeDist_le {n b : ℕ}
(dec : (Fin b → Fin 2) → Fin 2)
(P Q : (Fin n × Fin b → Fin 2) → ℝ) :
tvDist (decodeDist dec P) (decodeDist dec Q) ≤ tvDist P Q := by sorry
end ThresholdTheoremSource
Finite-fiber triangle inequality for the decodeDist and tvDist definitions in Prove2Me Definitions.Def_threshold_theorem_noise_model, used by ThresholdTheorem.level_k_concatenated_simulation (theorem 6d175c37-2a54-43c5-89c0-14cf15f2cfd5, https://prove2.me/theorems/6d175c37-2a54-43c5-89c0-14cf15f2cfd5).