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.
No takes yet. Share an insight, caveat, or question.
Hostens et al. (2006) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: