Reversible implementation of an injective classical string map on basis states
ProvedInfoLossLAR.WorstCase.CoherentInjection.circuit_basis_atcomplexitylatticesquantum-computing
Let compute a binary string map and compute . Fix an input length . For any word of length for which recovers from the padded encoding of , the combined reversible circuit maps the basis state containing and blank output to the basis state containing and blank input. Its work registers are restored to zero. The same circuit works for every eligible word of that length, so the basis identity also determines its effect on their coherent superpositions.
Preamble
import Definitions.Def_InfoLossLAR_ReversibleStringInjection set_option autoImplicit false open QAlgorithms QAlgorithms.Complexity open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit open InfoLossLAR.WorstCase.CoherentComputeUncompute OAI.MetricKMedian.Binary
Formal statement
namespace InfoLossLAR.WorstCase.CoherentInjection
theorem circuit_basis_at {f g : Str → Str} (P : PolyProgram id id f) (Q : PolyProgram id id g)
(n : ℕ) (word : Str) (hlen : word.length = n)
(hinverse : g (CoherentClassicalOracle.paddedOutput P word) = word) :
runLayered (circuit P Q n) (basis (inputBitsAt P Q n word)) = basis (finalBitsAt P Q n word) := by sorry
end InfoLossLAR.WorstCase.CoherentInjection
Source
InfoLossLAR formalization of physical Fourier sampling from a shared bounded-distance decoder. https://prove2.me/theorems/d106aba4-0ad7-4239-9c6b-4a9dc8c9ebc4