§III: general-input projection and conditional emulation
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.emulator_projection_limitLet normalized pure samples, , generate the full algebra on their span, and let be its projector. Fix an anchor and an unknown unitary . In Fig.2 take the reconstructed system on and the old system from the SWAP on . Let be these averaged subnormalized output branches. For every input density operator,
This states projection followed by conditional emulation on the successful branch, including zero Born probability without division. The circuit and its algebra promise differ from Appendix H's unknown-projector instrument.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
noncomputable section
open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator
attribute [local instance] Classical.propDecidable
open MeasureTheory Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P67
variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
[Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
[Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]
/-- PDF pp.4,6: general-input Fig.2 instrument converges to conditional emulation
on H_in and projection on its complement, using the actual outcome-dependent wires. -/
theorem emulator_projection_limit (phi : K → EuclideanSpace ℂ I) (a : K)
(hK : 2 ≤ Fintype.card K) (hphi : ∀ k, IsState (phi k))
(hgen : Generates (pureSamples phi)) (U : Matrix.unitaryGroup I ℂ)
(rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) :
let Pi := samplePi (pureSamples phi)
Tendsto (fun T : ℕ => traceNorm (wireBranch phi a (U : Matrix I I ℂ) T false rho -
densityConjugation (U : Matrix I I ℂ) (Pi * rho * Pi))) atTop (nhds 0) ∧
Tendsto (fun T : ℕ => traceNorm (wireBranch phi a (U : Matrix I I ℂ) T true rho -
(1-Pi) * rho * (1-Pi))) atTop (nhds 0) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P67
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite index types with decidable equality, let , assume , and let every have norm . Put , and let by continuous functional calculus, where and otherwise. Assume that, for every complex matrix on , membership in the complex linear span of all nonempty products is equivalent to . Let be unitary and let be positive semidefinite with trace . Define , for , , and , where applies when the Boolean ancilla is true and the identity otherwise, and . For each natural and history , let successively apply to the system and ancilla , and let do the same with . Write , , , and . The two matrices whose limits are asserted are
With , the conclusion is
The histories and products are empty at ; no support condition on is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.