Appendix G2, Eq.(G2): bridge samples enable controlled emulation
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.controlled_with_bridgeLet a finite nonempty mixed sample family generate all operators on . Take a unit vector and normalized control amplitudes with both nonzero. In addition to tagged original samples, supply the pure bridge and its exact output . The augmented input family satisfies
The actual mixed-sample emulator with this pure anchor consequently converges uniformly to controlled conjugation on supported input density operators. The bridge output supplies the relative phase; that phase is not inferred from the original density records.
The tagged output resources are and , together with the output bridge; controlled leaves the zero-control branch unchanged.
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 p.28, G2: nonzero control amplitudes in an additional pure bridge generate
the full systemControlled-space algebra and enable emulation by the actual mixed-sample channel.
Printed: the final output-record list uses both control projectors tensor S_out.
Changed: the constructed target-conjugated records use S_in on control zero and
S_out on control one, plus the given output bridge. Why: the defined controlled-U
acts as identity on control zero; these records are available from the given resources. -/
theorem controlled_with_bridge [Nonempty K] (S : K → Matrix I I ℂ)
(hS : ∀ k, IsDensityMatrix (S k)) (hgen : Generates S)
(phi : EuclideanSpace ℂ I) (hphi : IsState phi)
(hsupport : InSampleSupport S (pureDensity phi)) (alpha beta : ℂ)
(hnorm : ‖alpha‖ ^ 2 + ‖beta‖ ^ 2 = 1) (halpha : alpha ≠ 0) (hbeta : beta ≠ 0) :
let B := bridgeSamples S phi alpha beta
let bridge := tensorVec phi (WithLp.toLp 2 fun b => if b then beta else alpha)
Generates B ∧ ∀ (U : Matrix.unitaryGroup I ℂ) (eps : ℝ), 0 < eps →
∃ N : ℕ, ∀ T ≥ N, ∀ rho : Matrix (I × Bool) (I × Bool) ℂ, IsDensityMatrix rho → InSampleSupport B rho →
traceDistance (mixedEmulate B none bridge (systemControlled (U : Matrix I I ℂ)) T rho)
(densityConjugation (systemControlled (U : Matrix I I ℂ)) rho) ≤ eps := 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, with nonempty. Let every be positive semidefinite of trace , let be the functional-calculus value of on , and assume that the complex span of all nonempty products of the equals . Let have norm and satisfy , and let satisfy , , and . On , put , and define the family indexed by by
Let be the functional-calculus value of on . The assertion is that the complex span of all nonempty products of the equals , and that the following approximation holds. For a unitary on , put . For operators on , define , , and
For and , let apply successively on and ancilla , let , set , and set . Define the matrix map
with entrywise Lebesgue integration and empty products interpreted as identities. For every such and every real , there exists a natural number such that, for every and every positive semidefinite matrix on of trace satisfying ,
The averaging family has indices and includes the anchor index .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.