1996/08/15 by Tal Mor, T. Mor, Mor, T. · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Benford’s Law and Fraud Detection #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/9608025
5 pages, RevTeX
arxiv created 1996/08/15 · openalex publication_date 1996/08/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Noise causes severe difficulties in implementing quantum computing and quantum cryptography. Several schemes have been suggested to reduce this problem, mainly focusing on quantum computation. Motivated by quantum cryptography, we suggest a coding which uses N quantum bits (N=n2) to encode one quantum bit, and reduces the error exponentially with n. Our result suggests the possibility of distributing a secure key over very long distances, and maintaining quantum states for very long times. It also provides a new quantum privacy amplification against a strong adversary.