§2.2 Corollaries, item 2 and the R basis
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.reversible_completenessLet , and let be a bijection. Each of the bases and admits an exact finite operation sequence satisfying
Here consists of the XOR lifts of NOT and AND together with CNOT. There is no efficiency claim for an arbitrary bijection.
This supplies the source's clean reversible completeness in both stated bases.
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.8, Corollary 2 and the next paragraph: exact clean representation of every
partial bijection in both C_tau and R. No efficiency bound is claimed. -/
theorem reversible_completeness (n : ℕ) (N M : Set (Qubits n)) (e : N ≃ M) :
(∃ (w : ℕ) (c : Circuit cTauBasis (n + w)), ∀ x : N,
act c.unitary (inputState x.val w) = inputState (e x).val w) ∧
(∃ (w : ℕ) (c : Circuit rBasis (n + w)), ∀ x : N,
act c.unitary (inputState x.val w) = inputState (e x).val w) := 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 , every pair of subsets , and every bijection , both of the following existence statements hold: there are a natural number and a circuit on bits using only the gates , , and , which sends exactly to for every ; and there are a possibly different natural number and circuit with the same input-output property using only the gates , controlled-NOT, and . Here each gate acts on an injectively chosen ordered collection of wires and leaves the remaining wires unchanged, circuit gates are applied in list order, and denotes the coordinate vector at followed by false bits. No gate-count or ancilla-count bound is asserted, and no behavior is prescribed for inputs outside . The statement includes ; when is empty, the required input-output conditions are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.