§2.4.4: state preparation with binary angle control
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.binary_controlled_rotationLet be a finite binary angle code, and put
There is an exact operation sequence, with clean work, which performs
Correctness on these basis codes extends linearly to coherent control superpositions. For , the angle is zero.
This is the finite real-coefficient state preparation claimed in the paragraph, without claiming finite exact codes for arbitrary real numbers.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
noncomputable section
open scoped Matrix ComplexConjugate Kronecker
namespace QAlgorithms.Papers.Independent.Intakethird100.P03
open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)
attribute [local instance] Classical.propDecidable
/-- PDF p.14: finite binary-angle controlled state preparation, exactly and with
clean work. Correctness on these basis inputs extends linearly to coherent controls. -/
theorem binary_controlled_rotation (b : ℕ) :
∃ (w : ℕ) (c : Circuit kitaevGateBasis ((b + 1) + w)), ∀ x : Qubits b,
act c.unitary (inputState (Fin.snoc x false) w) = cleanVector w (rotatedZero x) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , there exist a natural number and a finite circuit on qubits, built from arbitrary unitary one-qubit gates, the gate , and the gate , each placed on injectively chosen ordered wires and acting identically on the other wires, such that the following holds for every Boolean string of length . Set
Applying the circuit’s embedded gate matrices in list order to the standard basis vector with bits , followed by one false bit and then false bits, produces exactly
Here is the all-false string, and both and are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.