Theorem 1: deterministic exact four-call inversion
ProvedQAlgorithms.Papers.Independent.Support50.P24.deterministicExactFourCallsThere is a fixed seven-qubit quantum circuit with exactly four forward calls to an unknown , using the same at every call. Its inserted gates, singlet on input wires 2 and 3, and four zero ancillas are independent of and the input. After discarding every output wire except wire 3, its channel is
This equality holds on every input density matrix and after tensoring with the identity on any reference system. The auxiliary output may depend on . The result establishes deterministic exact inversion without a supplied catalyst.
Formalization Note Equality is stated on all matrices; for these linear channels this is equivalent to channel equality on states, including entangled inputs.
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 pp.1-2, Theorem 1: a fixed circuit uses exactly four forward calls and
implements the inverse channel on all inputs, including reference-entangled inputs. -/
theorem deterministicExactFourCalls :
∃ gates : List CallGate, PhysicalCalls gates ∧ calls gates = 4 ∧ ExactInverter gates := by sorry
end QAlgorithms.Papers.Independent.Support50.P24
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exists a finite list of operations on seven Boolean-labelled qubits, each operation being either a specified complex matrix or a call labelled by one of the seven qubit positions, such that every specified matrix in the list is unitary and exactly four list entries are calls. For every determinant-one unitary matrix indexed by , replace a call at position by the matrix with entry when for all , and entry otherwise; let be the product of the resulting matrices in chronological order, with later operations multiplying on the left and the empty product equal to the identity. Define , with rows indexed by seven-bit strings and columns by Booleans , by
Then, for every complex Boolean-indexed matrix , including matrices that are not density matrices, setting gives, for every pair of Booleans ,
Here means replacing coordinate of by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.