Result 2: the two-branch attained interaction cost
OpenQAlgorithms.Papers.Independent.Intakethird100.P99.interactionCost_twoBranchesLet be a Hermitian Hamiltonian on two qubits , with canonical interaction coefficients satisfying . Local terms in are allowed. Local unitary controls are instantaneous and free, interaction intervals are nonnegative, and . Write for the infimum of the interaction durations of protocols implementing the gate , allowing the ideal limit of arbitrarily fine pulses at fixed total duration and disregarding global phase. This cost is an extended nonnegative real, with value for an impossible simulation. For a two-qubit unitary , let be an actual interaction-content witness: is locally equivalent, up to global phase, to , where are the Pauli matrices and . For real triples, means s-majorization: sort their absolute coordinates in descending order, give the smallest coordinate the sign of the product, and compare the first coordinate and the two sums . Put for . If , there is a least feasible time , attained in the ideal control model, such that
For zero canonical interaction, the cost is for local gates and otherwise. This characterizes time cost using just two periodic branches.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P99
namespace QAlgorithms.Papers.Independent.Intakethird100.P99
open scoped Matrix Kronecker NNReal ENNReal
open QAlgorithms.Papers.Independent.Information100.P10 (pauli)
open QAlgorithms.Papers.Independent.Information100.P32 (evolution)
noncomputable section
/-- PDF p.6, Result 2 (abstract p.1): the two-branch minimum is attained for a nonzero
interaction. For a zero canonical interaction the extended cost is 0 on local gates and
infinity otherwise; no division by zero or empty real infimum is used. -/
theorem interactionCost_twoBranches (H U : TwoMatrix) (a b : Triple)
(hH : HasCanonicalHamiltonian H a) (hU : HasContent U b) :
(0 < a 0 → ∃ t : ℝ, IsLeast {s : ℝ | 0 ≤ s ∧
(SMajorized b (s • a) ∨ SMajorized (secondShift b) (s • a))} t ∧
IdealSimulates H U t ∧ interactionCost H U = ENNReal.ofReal t) ∧
(a = 0 → (TwoQubitLocalEquivalent U 1 → interactionCost H U = 0) ∧
(¬ TwoQubitLocalEquivalent U 1 → interactionCost H U = ⊤)) := by sorry
end
end QAlgorithms.Papers.Independent.Intakethird100.P99
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of complex two-qubit matrices and every pair of real triples , assume that is Hermitian, , , and there exist single-qubit unitary matrices and Hermitian single-qubit matrices satisfying , where and are the standard Pauli matrices. Assume also that is unitary, , , , and for some single-qubit unitary matrices . For a real triple , let , , and define
Write for the three inequalities , , and . Say that ideally simulates at time when is Hermitian, is unitary, , and for every real there exist a finite list of nonnegative durations , single-qubit unitary matrices for , and with , such that and
the empty list is allowed. Define to be the infimum, in , of all nonnegative times at which this simulation condition holds, with infimum if there are no such times. The conclusion is the conjunction of two implications: if , there exists a real which is the least element of
such that ideally simulates at time and , viewed as an extended nonnegative real; and if , then whenever for some single-qubit unitaries , whereas whenever no such four unitaries exist.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.