Symmetry after measuring the test
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.posttest_symmetryLet and let be any joint unitary attack on signals with a fixed initial pure probe. Fix the bases and balanced partition and let be its coherent symmetrization from Eq. (13), with test positions written first. Then, for every test input , test outcome , and information inputs ,
For a positive common probability, the conditional probes have and retain Eq. (18):
Here are the retained test and information mask registers, is the original probe coordinate, and is computed by symmetrizing only the test mask and dividing by the square root of the same common test probability. This permits the conditional Fourier analysis; individual rows of need not be normalized.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P77
open scoped BigOperators ComplexConjugate ComplexOrder
open QAlgorithms
-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)
open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Appendix C, PDF pp.14--15, Eqs.(16)--(18): the probability of a test
outcome is independent of the information input. Positive-probability conditional
probes are normalized and retain the explicitly constructed information symmetry. -/
theorem posttest_symmetry {n d : ℕ} (hn : 1 ≤ n)
(U : Matrix.unitaryGroup (Fin d × Qubits (n + n)) ℂ) (e0 : Fin d)
(iT jT : Qubits n) :
(∀ iI kI, testProbability (coherentBitSymmetrize (attackProbes U e0)) iT jT iI =
testProbability (coherentBitSymmetrize (attackProbes U e0)) iT jT kI) ∧
(0 < testProbability (coherentBitSymmetrize (attackProbes U e0)) iT jT (fun _ => false) →
(∀ iI, ∑ jI, ‖conditionedSymmetric U e0 iT jT iI jI‖ ^ 2 = 1) ∧
∀ iI jI mT mI q,
conditionedSymmetric U e0 iT jT iI jI (Fin.append mT mI, q) =
((Real.sqrt ((2 : ℝ) ^ n))⁻¹ : ℂ) * character (iI + jI) mI *
testOnlyConditioned U e0 iT jT (iI + mI) (jI + mI) (mT, q)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For natural numbers with , a unitary matrix indexed by , an index , and binary strings of length , use XOR addition, concatenation , and with the exponent computed modulo . Set
where have length , have length , and . Then for every pair of length- strings . Moreover, if , define
For every , , and for all length- strings and every ,
The normalization and coordinate identity are asserted only under the strict positivity condition; if , only the independence of from is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.