Definitions for Aggregating quantum repeaters for the quantum internet
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P84prove2quantum
The objects the formalized statements of Aggregating quantum repeaters for the quantum internet (arXiv:1606.00135) are stated in. Each was checked against the paper by a blind read-back and a moderator.
edgeTensor: PDF p.3, Eq.(4): the independent tensor product over labelled edges. Each edge may have a different output register. Matrix entries are products; for an empty edge type the register is the tensor unit and its sole entry is 1.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
/-!
# Aggregating quantum repeaters for the quantum internet
Azuma and Kato, arXiv:1606.00135v1. The independently meaningful estimates
(4) and (13) are stated here. Operational results are individually deferred in
the assigned unit's HARD.md and GAPS.json. Compilation is pending handoff.
-/
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): the independent tensor product over labelled edges.
Each edge may have a different output register. Matrix entries are products;
for an empty edge type the register is the tensor unit and its sole entry is 1. -/
def edgeTensor {E : Type*} [Fintype E] {I : E → Type*}
(rho : (e : E) → Matrix (I e) (I e) ℂ) :
Matrix ((e : E) → I e) ((e : E) → I e) ℂ :=
fun x y => ∏ e, rho e (x e) (y e)
/-- Sanity: an empty tensor is the one-dimensional unit, not a zero matrix. -/
example (I : Fin 0 → Type) (rho : (e : Fin 0) → Matrix (I e) (I e) ℂ)
(x y : (e : Fin 0) → I e) : edgeTensor rho x y = 1 := by
simp [edgeTensor]
/-- Sanity: a one-edge tensor has exactly the supplied matrix entries. -/
example {I : Type*} (rho : Matrix I I ℂ) (x y : Unit → I) :
edgeTensor (fun _ : Unit => rho) x y = rho (x ()) (y ()) := by
simp [edgeTensor]
end QAlgorithms.Papers.Independent.Intakenext100.P84
Source
Aggregating quantum repeaters for the quantum internet, arXiv:1606.00135v1, https://arxiv.org/abs/1606.00135v1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P84.edgeTensor
For any finite type , any family of types , and any family of complex matrices whose rows and columns are indexed by , define a complex matrix whose rows and columns are indexed by tuples , by
No finiteness assumption is imposed on the types . If is empty, there is one empty tuple and is the matrix with entry ; if some is empty, there are no row or column indices.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.