The load state on qubits
DefinitionTwoFoldOPI_Supplement_loadStatecoding-theoryoptimal-polynomial-intersectionp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-algorithmsregev-reductionschur-product-codes
For a nonempty load set ,
where a word is written on qubits, each symbol in bits, most significant bit first.
Formalization Note Used only for , where it is a unit vector.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Basic
namespace TwoFoldOPI
namespace Supplement
open QAlgorithms
/-- **The load state `|T⟩ = |T|^{−1/2} Σ_{x ∈ T} |x⟩` on qubits.**
Ragavan, Shutty, *Quantum Algorithms for OPI Variants Beyond Locality and Classical
Decodability*, arXiv:2610.00502 (version held, sha256 ef050ec0…62605), §10.1, Definition 10.2, eq. (23), p.53: "If T ≠ ∅, we may also define the quantum state:
|T⟩ := (1/√|T|) Σ_{x∈T} |x⟩."
A word `x ∈ [n]^m` is written on `m · ⌈log₂ n⌉` qubits: symbol `x_j` (`0 ≤ x_j < n`) in
`⌈log₂ n⌉` bits, most significant bit first (`natToBits`), symbol `0` first. `loadState m n T` is
the uniform superposition of these basis states over `x ∈ T`.
**Formalization Note.** Used only for `T ≠ ∅`, where it is a unit vector (distinct words give
distinct basis states). -/
noncomputable def loadState (m n : ℕ) (T : Finset (Fin m → Fin n)) :
EuclideanSpace ℂ (Qubits (m * Nat.clog 2 n)) :=
∑ x ∈ T, ((Real.sqrt (T.card : ℝ))⁻¹ : ℂ) •
ket (fun i : Fin (m * Nat.clog 2 n) =>
natToBits (Nat.clog 2 n) (x (finProdFinEquiv.symm i).1).val (finProdFinEquiv.symm i).2)
end Supplement
end TwoFoldOPI
Source
Ragavan, Shutty, Quantum Algorithms for OPI Variants Beyond Locality and Classical Decodability, arXiv:2610.00502 (version held, sha256 ef050ec0…62605), §10.1, Definition 10.2, eq. (23), p. 53