We present a hashing protocol for distilling multipartite Calderbank-Shor-Steane states by means of local Clifford operations, Pauli measurements, and classical communication. It is shown that this hashing protocol outperforms previous versions by exploiting information theory to a full extent and not only applying controlled-NOT gates as local Clifford operations. Using the information-theoretical notion of a strongly typical set, we calculate the asymptotic yield of the protocol as the solution of a linear programming problem.

• Received 17 October 2005

DOI:https://doi.org/10.1103/PhysRevA.73.042316