Hashing protocol for distilling multipartite Calderbank-Shor-Steane states

2005/10/31 by Erik Hostens, Jeroen Dehaene, Bart De Moor · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Discrete mathematics #Hash function #Mathematics #Multipartite #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum entanglement #Quantum mechanics #Set (abstract data type) #Theoretical computer science #quant-ph

paper · pdf · doi:10.1103/physreva.73.042316

published as Phys. Rev. A 73, 042316 (2006) · 13 pages, 3 figures, RevTeX4

arxiv created 2006/02/01 · openalex publication_date 2006/04/18 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

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.

Citations

• Secure Multi-party Quantum Computing
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Quantum entanglement for secret sharing and secret splitting
• Quantum cryptography based on Bell’s theorem
• Quantum secret sharing
• Measurement-based quantum computation with cluster states
• Stabilizer Codes and Quantum Error Correction

Cited by

• Simple proof of confidentiality for private quantum channels in noisy environments