Reducing Quantum Errors and Improving Large Scale Quantum Cryptography

Simple item page
dc.creatorMor, T.
dc.date1996-08-15
dc.date.accessioned2026-07-07T06:13:56Z
dc.date.available2026-07-07T06:13:56Z
dc.descriptionNoise 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=n^2$) 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.
dc.description5 pages, RevTeX
dc.identifierhttps://arxiv.org/abs/quant-ph/9608025
dc.identifierhttp://arxiv.org/abs/quant-ph/9608025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93285
dc.subjectQuantum Physics
dc.titleReducing Quantum Errors and Improving Large Scale Quantum Cryptography
dc.typetext

Files

Collections

arXiv