The exact restricted-chamber criterion and one-branch cost
OpenQAlgorithms.Papers.Independent.Intakethird100.P99.restrictedCostLet 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 . Write . For a nonzero interaction (),
Under this restriction, , with the minimum attained in the ideal control model. The shifted vector is s-ordered before comparison, giving .
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 pp.6–7, III.C: the exact criterion for dropping the second branch, and the
resulting attained one-branch interaction-cost formula. -/
theorem restrictedCost (H U : TwoMatrix) (a b : Triple)
(hH : HasCanonicalHamiltonian H a) (hU : HasContent U b) (ha : 0 < a 0) :
(SMajorized b (secondShift b) ↔ b 0 + |b 2| ≤ Real.pi / 4) ∧
(b 0 + |b 2| ≤ Real.pi / 4 → ∃ t : ℝ,
IsLeast {s : ℝ | 0 ≤ s ∧ SMajorized b (s • a)} t ∧
IdealSimulates H U t ∧ interactionCost H U = ENNReal.ofReal t) := 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 all complex two-qubit matrices and real triples , assume , , , , and there exist one-qubit unitaries and Hermitian one-qubit matrices with
Also assume is unitary, , , , and for some four one-qubit unitaries. For any real triple , let , , and
Write when , , and . Then
Moreover, if , there exists a real such that , , and for every real satisfying ; at this same exact time , admits arbitrarily accurate pulse simulation under , and its interaction cost is . Here simulation at time means that for every there is a finite product , with one-qubit unitaries, nonnegative durations summing to , and some , whose operator-norm distance from is strictly less than ; zero pulses are allowed. The interaction cost is the infimum of all such nonnegative times in , with empty infimum .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.