Main properties (iii): completeness when the bond dimension may grow exponentially
OpenQAlgorithms.Papers.Independent.Intakethird100.P57.completenessLet and let be any unit vector in . There exist an integer bond dimension and periodic trace tensors such that
The graph weights and final local rotations can therefore be chosen trivial. This is an exact representability statement with exponential bond dimension allowed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P57
noncomputable section
open scoped ComplexConjugate Matrix
namespace QAlgorithms.Papers.Independent.Intakethird100.P57
attribute [local instance] Classical.propDecidable
/-- PDF p.2, Main properties (iii): exact completeness, explicitly allowing exponential D.
The graph and rotations may be chosen trivial, with the periodic trace convention retained. -/
theorem completeness (N : ℕ) (hN : 1 ≤ N) (v : EuclideanSpace ℂ (Qubits N))
(hv : IsState v) :
∃ D : ℕ, 1 ≤ D ∧ D ≤ 2 ^ N ∧ ∃ A : Tensors N D,
rage A (emptyPhaseGraph N) (fun _ => 1) = v := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P57
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every complex vector indexed by with Euclidean norm , there exist a natural number satisfying and complex matrices , one for each site and bit , such that
The product uses increasing site order. Equivalently, applying the diagonal phase operator with all weights zero and the product of identity local rotations to this trace-defined vector gives exactly .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.