§5 and Remark 2: full-algebra Shor extension
ProvedQAlgorithms.Papers.Independent.Gap48.P46.shor_extension_channelAll quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel , write for the maximum ensemble Holevo information at mean , for the minimum average output entropy at that mean, and for the maximum of over a nonempty closed mean constraint .
Let be a channel, , , and an integer. For an arbitrary operator on , let be its diagonal label blocks and . Define the full-algebra map
This map is CPTP and is unchanged when all off-diagonal label blocks of are deleted. It agrees with the classical-array formula on diagonal arrays, while supplying the full quantum channel required by Remark 2. The cases and are included.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF pp.10–11, §5 and Remark 2: the explicit full-algebra Shor map is CPTP,
and input label dephasing leaves its output unchanged. -/
theorem shor_extension_channel [Nonempty I] [Nonempty O]
(Phi : Superop I O) (hPhi : IsChannel Phi) (E : Matrix I I ℂ) (hE : IsEffect E)
(q : ℝ) (hq : q ∈ Set.Icc (0 : ℝ) 1) (d : ℕ) (hd : 1 ≤ d) :
IsChannel (shor Phi E q d) ∧ ∀ X,
shor Phi E q d X = shor Phi E q d (dephaseLabel d X) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, let be a channel from matrices on to matrices on , let be a matrix on such that and are positive semidefinite, let , and let be an integer. For any complex matrix on , put . Define on the disjoint union to have -block , diagonal entry at , diagonal entry at label , and all other entries outside the -block equal to zero. Then is a channel: it has a finite representation for every , with . Moreover, for every matrix , including matrices that are not density matrices, , where when and is otherwise. Both endpoints and the case are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.