Five-in-five cat concatenation strictly improves hashing
OpenQAlgorithms.Papers.Independent.Support50.P40.fiveInFive_improvesHashingConsider independent qubit depolarization with identity-Pauli probability and each other Pauli probability . Let encode by the ordinary five-qubit cat encoder, followed on each output by the rotated five-qubit cat module . Thus the rotated modules are adjacent to the physical channel. For a fixed complete coset frame of this code, let denote its signed coset-entropy yield per physical channel use. Define , and let be the corresponding ordinary length- cat threshold; is hashing.
This specified 25-qubit code and a compatible coset frame satisfy
Whenever its yield is positive, it is an attainable limiting unassisted transmission rate using this fixed inner code and growing additive outer codes, with both entanglement fidelity and fidelity for every unknown normalized input tending to one. In particular, some fidelity in has positive although the hashing signed yield is nonpositive.
This is a constructive improvement within the specified concatenation family. The reported decimal is not an exact cutoff or a claim of optimal channel capacity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
namespace QAlgorithms.Papers.Independent.Support50.P40
open QAlgorithms QAlgorithms.Stabilizer
open scoped ComplexConjugate Matrix
noncomputable section
/-- PDF pp.1,19,24--25,31: the specified 25-qubit five-in-five construction
has a strictly lower positivity threshold than the five-cat and hashing,
and gives positive unassisted transmission where hashing's signed yield
is nonpositive. Printed decimals are approximate and are not exact cutoffs. -/
theorem fiveInFive_improvesHashing :
∃ C : InnerCode 24, ∃ T : CosetChoices C,
innerEncoderMatrix C = fiveInFive ∧
positivityThreshold (signedYield C T) < catThreshold 4 ∧
catThreshold 4 < catThreshold 0 ∧
(∀ f : ℝ, (3 / 4 : ℝ) ≤ f → f ≤ 1 →
(0 < signedYield C T f ↔ positivityThreshold (signedYield C T) < f)) ∧
(∀ f : ℝ, 0 ≤ f → f ≤ 1 → 0 < signedYield C T f →
FixedInnerAchievable C f (signedYield C T f)) ∧
∃ f : ℝ, (3 / 4 : ℝ) ≤ f ∧ f ≤ 1 ∧ catYield 0 f ≤ 0 ∧
0 < signedYield C T f := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exist data and of the following form. The data consist of a subgroup of the unitary matrices on qubits and two orthonormal vectors whose complex span is precisely the common fixed subspace of . The subgroup is contained in the subgroup generated by all matrices , where , , and uses the standard Pauli matrices; its elements commute pairwise, and none is . Let be the finite set of labels for which for some and ; it has cardinality . Let be the finite set of labels whose matrices commute with every member of . Multiplication of labels means coordinatewise Pauli multiplication with the scalar phase discarded, and . The data consist of representatives , indexed by , and , indexed by , such that and are the all-identity labels, every error label belongs to for exactly one , every belongs to , and every label in belongs to for exactly one . For the encoder matrix , they also satisfy, for every Pauli label and every complex matrix ,
This encoder is exactly the matrix
for every -bit string and bit . To state the remaining conclusions, put , , where counts nonidentity entries, and
Here . For any real function , define , with empty real infimum assigned value . Define , for every integer , by the same entropy expression divided by , using error labels of length , masses , syndrome bits , and logical label determined by , where have amplitude and phase pairs ; the syndrome and joint masses are the sums over errors with those respective values. Put . The chosen satisfy
For every with , the following additional assertion holds with : for every real and , there is an integer such that for every integer , there are an integer , an outer encoder , and a decoder from blocks of qubits to qubits, with
The range of is the common fixed subspace of some pairwise commuting subgroup of the subgroup generated by phased -qubit Pauli matrices, with excluded. The decoder is a channel, meaning that it has a finite Kraus representation with . Let
and let the transmission map be
It satisfies both
where , and the second quantifier ranges over all complex -qubit vectors. Finally, there exists for which and . The block lengths and witness dimensions quantified here may include and ; empty tensor products and bit strings have their usual singleton interpretations.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.