Exact three-call inversion with a returned catalyst
ProvedQAlgorithms.Papers.Independent.Support50.P24.catalyticThreeCallsLet be unknown and let . Supply the particular catalyst for this same . The fixed circuit obtained from Fig. 1 by deleting its first oracle call uses three forward calls and satisfies
The equality includes reference-entangled inputs. It returns the catalyst for reuse with the same unknown operation; it does not assert three-call inversion without advice. The density-matrix formula includes the physical wire relabelling and removes the circuit's global minus sign.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P24
noncomputable section
open QAlgorithms MeasureTheory
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Support50.P24
attribute [local instance] Classical.decEq Classical.propDecidable
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P24.groupedContinuousENorm
/-- PDF p.2, Eq.(1): three forward calls with the specified same-U catalyst return
that catalyst while inverting the input. Full output channel equality suppresses global phase. -/
theorem catalyticThreeCalls :
PhysicalCalls catalyticCircuit ∧ calls catalyticCircuit = 3 ∧
∀ (U : QubitSU) (A : Matrix Bool Bool ℂ),
conjSuperop (evaluateCalls catalyticCircuit U * catalyticInput U) A =
conjSuperop (outputEmbedding U * U.valᴴ) A := by sorry
end QAlgorithms.Papers.Independent.Support50.P24
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let the seven qubits be numbered , with computational basis indexed by Boolean strings of length seven. Write and . Let apply the matrix to target qubit when the input bits satisfy every wire–value pair in the list , and otherwise act as the identity; all other bits remain unchanged. Let swap bits when those same input conditions hold, and otherwise leave the string unchanged. An empty control list imposes no conditions. In the following lists, operations act from left to right, so the matrix of a list is , and the empty list has matrix . Define
Here a named list inside another list denotes its matrix. Define the fixed matrices
For any special unitary matrix , let , let be the matrix of the sequence
and put and . The assertion is that the known matrices in this sequence are unitary, the sequence contains exactly three calls to , and, for every such and every complex matrix ,
The tensor factors are ordered by wire number; is arbitrary and need not be a density matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.