Depth-two tree: logical X and Z success probabilities
OpenQAlgorithms.Papers.Independent.Intakenext100.P89.depth_two_measurementsConsider a regular tree with positive integer branching factors . Every physical photon used in a measurement independently survives with probability . The tree has child groups, each comprising a child and its grandchildren. Logical succeeds if at least one group survives completely. Logical succeeds if every group contains at least one surviving photon, allowing the child to be measured directly or indirectly. Then
These are the depth-two specializations of the indirect-measurement recursion. For the source's repeater, . No optimality of depth two is assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P89
namespace QAlgorithms.Papers.Independent.Intakenext100.P89
open scoped BigOperators ComplexConjugate
-- Accepted probability primitives: symbol true is success; choose n x is zero for x > n.
open QAlgorithms.Papers.Independent.Information100.P54 (binomialMass)
open QAlgorithms.Papers.Independent.Information100.P56 (bernoulli)
noncomputable section
/-- Source p.11, IV, Eqs.(2)--(6): the depth-two specialization of the indirect-measurement
recursion with positive integral branches. Here p = 1-epsilon_stat is photon survival.
No optimality of depth two is asserted or assumed. -/
theorem depth_two_measurements (b0 b1 : ℕ) (hb0 : 0 < b0) (hb1 : 0 < b1)
(p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
depthTwoLogicalXSuccess b0 b1 p = 1 - (1 - p ^ (b1 + 1)) ^ b0 ∧
logicalZ b0 b1 p = (1 - (1 - p) ^ (b1 + 1)) ^ b0 := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P89
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers and a real number with , assign each Boolean array with rows and columns the weight . The theorem asserts both
The endpoint values and are included; neither nor is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.