Independent edge Bell products have additive trace-norm error
OpenQAlgorithms.Papers.Independent.Intakenext100.P84.independent_edge_bell_errorLet be the finite set of labelled edges. For every , let and let be a normalized density operator on the two endpoint registers of Bell pairs. Write , where . Suppose and for every edge. Then
The norm is the full Schatten -norm. Empty products are the one-dimensional unit state, and zero Bell copies are allowed. This estimate controls the error of the independently prepared Bell-resource network.
Formalization Note The two halves of each Bell product are grouped by endpoint, so its vector is the accepted normalized maximally entangled vector on two -qubit registers.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P84
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P84
open QAlgorithms
open scoped BigOperators
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, Eq.(4): independent normalized edge outputs, each epsilon-close
in full trace norm to m(e) Bell pairs, have joint error at most |E| epsilon.
`maxEntangled m` is the Bell product with the two endpoint registers grouped
locally; its amplitude is 2^(-m/2). Zero copies give the tensor unit. -/
theorem independent_edge_bell_error {E : Type*} [Fintype E]
(m : E → ℕ)
(rho : (e : E) → Matrix (Qubits (m e) × Qubits (m e))
(Qubits (m e) × Qubits (m e)) ℂ)
(epsilon : ℝ) (hepsilon : 0 < epsilon)
(hrho : ∀ e, IsDensityMatrix (rho e))
(hedge : ∀ e,
traceNorm (rho e - pureDensity (maxEntangled (m e))) ≤ epsilon) :
traceNorm (edgeTensor rho -
edgeTensor (fun e => pureDensity (maxEntangled (m e)))) ≤
(Fintype.card E : ℝ) * epsilon := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P84
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite type , every function , every family of complex matrices indexed by pairs of -bit strings, and every real , suppose that each is positive semidefinite with trace , and that for every . Here an -bit string is a function , has entries , and, for a pair of -bit strings, when and otherwise. For any complex square matrix , the notation means , with the square root taken by continuous functional calculus. Define matrices , indexed by tuples of such pairs, by and . Then
The values are included, in which case the corresponding pair index set is a singleton and . If is empty, both product matrices are , and the conclusion is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.