Pauli measurements: conditional-Z and Hadamard reordering instruments
ProvedQAlgorithms.Papers.Independent.Intakenext100.P89.appendix_pauli_reorderingLet be any finite nonempty unmeasured register, including arbitrary spectators, and let all input density operators be positive with trace one. Let be any earlier measurement of qubit , with a finite nonempty outcome set and . Its outcome controls on a distinct qubit . A later unitary on is controlled by and by the Pauli outcome on ; outcome zero means eigenvalue . Write for the subnormalized residual branch after this sequence, discarding . Define and . Let instead measure before the earlier measurement, omit , and apply . Then, for every joint input state,
For the Hadamard identities, let , set and . If discards the measured qubit, then for every density on ,
These identities include removal of before a measurement and the sign reversal for a measurement after . They preserve the joint outcome laws and residual states through the branch traces, not the measured output vectors. They make no assertion about equal loss accrued under different physical measurement times.
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
/-- Appendix A p.15, Fig.8(a)--(c): all conditional-Z and Hadamard measurement identities,
including the corrected downstream control of U. Equality is of subnormalized residual
branches after disposing of measured photons, hence of joint outcome probabilities and
residual states, with arbitrary finite references. No equality of measured output vectors
or time-dependent lossy hardware channels is asserted. -/
theorem appendix_pauli_reordering {O R : Type*} [Fintype O] [Nonempty O]
[Fintype R] [DecidableEq R] [Nonempty R]
(MA : O → Matrix Bool Bool ℂ)
(hMA : ∑ o, (MA o).conjTranspose * MA o = 1)
(feed : O → Bool) (U : O → Bool → Matrix.unitaryGroup R ℂ) :
(∀ (rho : Matrix ((Bool × Bool) × R) ((Bool × Bool) × R) ℂ),
QAlgorithms.IsDensityMatrix rho → ∀ (a : PauliBasis) (o : O) (r : Bool),
latePauliBranch MA feed U a o r rho =
earlyPauliBranch MA feed U a o (xor r (zOutcomeFlip a (feed o))) rho) ∧
(∀ (rho : Matrix (Bool × R) (Bool × R) ℂ), QAlgorithms.IsDensityMatrix rho →
∀ (a : PauliBasis) (r : Bool),
effectDiscard (QAlgorithms.hadamard.conjTranspose * pauliProjector a r *
QAlgorithms.hadamard) rho =
effectDiscard (pauliProjector (hadamardBasis a)
(xor r (hadamardOutcomeFlip a))) rho) := 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 every finite nonempty type , every finite nonempty type with decidable equality, every family of complex matrices satisfying , every Boolean function , and every family of unitary matrices on , the following two assertions hold. Use Boolean order , let , , , and set , interpreting Boolean exponents as or . Let when , otherwise , and let for , while . For either finite index set or , define . First, for every positive semidefinite matrix of trace on the two Boolean registers together with , every , every , and every Boolean ,
The right side is the early branch with outcome , whose unitary index is . Second, for every positive semidefinite matrix of trace on one Boolean register together with , every , and every Boolean ,
where , , , and , .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.