1 paper
Tyler Kann, Matthieu R. Bloch, Shrinivas Kudekar +1
The quantum hashing bound guarantees that rates up to 1−H(pI,pX,pY,pZ) are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve…