Corollary 16: quantum/private bounds for polynomial Pauli noise
OpenQAlgorithms.Papers.Independent.Intakethird100.P50.polynomialPauli_capacities_expansionAll systems are nonzero finite-dimensional complex Hilbert spaces. A channel is complex-linear, completely positive and trace preserving. Its receiver and full complementary channel are obtained from the same isometric dilation. Write and for the unassisted operational quantum and private capacities, allowing arbitrary collective codes over independent uses with vanishing reliability error and environmental leakage. Write , where the maximum includes every density operator. Entropies and logarithms are in bits, with . The diamond norm has no factor .
Let be real polynomials vanishing at zero, with and physical four-component weights near from the right. Let be their qubit Pauli channel and , where is the linear coefficient of . There exist and , depending on the fixed family, such that for all ,
The case remains included. These estimates specialize the polynomial degradability expansion to quantum and private communication.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P50
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P50
variable {A B E F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype F] [DecidableEq F]
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel maximumCoherentInformation
dilationPower idealJoint)
open QAlgorithms.Papers.Independent.Information100.P80 (log2)
open QAlgorithms.Papers.Independent.Information100.P69 (diamond choi)
open QAlgorithms.Papers.Independent.Support50.P07 (fullTracePrivateCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P17 (clock)
/-- Corollary 16, PDF p.17: the printed Q(N),P(N) denote the same N_p.
C_p=0 is included without using log C_p. -/
theorem polynomialPauli_capacities_expansion (P : Fin 3 → Polynomial ℝ)
(hP : PolynomialNoise P) :
∃ Kq Kp : ℝ, 0 ≤ Kq ∧ 0 ≤ Kp ∧ ∃ delta : ℝ, 0 < delta ∧ delta ≤ 1 ∧
∀ p ∈ Set.Ioo 0 delta,
let V := pauliDilation (polynomialWeights P p)
(maximumCoherentInformation V ≤ dilationQuantumCapacity V ∧
dilationQuantumCapacity V ≤ maximumCoherentInformation V -
512 * pairCoefficient P * p ^ 2 * log2 p + Kq * p ^ 2) ∧
(maximumCoherentInformation V ≤ fullTracePrivateCapacity V ∧
fullTracePrivateCapacity V ≤ maximumCoherentInformation V -
1536 * pairCoefficient P * p ^ 2 * log2 p + Kp * p ^ 2) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be real polynomials with , and assume that for some the weights are nonnegative and sum to throughout . Write for the coefficient of degree in , , and , where the four are the identity and usual Pauli matrices. Put , , and
where functions of Hermitian matrices use spectral functional calculus, , and . Define as the supremum of nonnegative rates admitting positive message dimensions and encoding and decoding channels for every , with entanglement transmission fidelity through tending to and, for every , eventually . The fidelity is the expectation of in the state obtained by applying the encoded channel and decoder to the second half of . Define as the supremum of nonnegative rates such that, for every , every sufficiently large positive admits , density matrices , and positive semidefinite matrices summing to , with and
Here a density matrix is positive semidefinite with trace , every channel has a finite Kraus representation with , and . There exist and such that every satisfies
The hypotheses permit zero linear coefficients and . The quantum code sequence includes , where real division by zero is , while its asymptotic conditions concern large .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.