메뉴 건너뛰기




Volumn 57, Issue 2, 1998, Pages 830-839

Quantum-channel capacity of very noisy channels

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000286896     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.57.830     Document Type: Article
Times cited : (282)

References (45)
  • 1
    • 33746738958 scopus 로고
    • PLRAAN
    • P. W. Shor, Phys. Rev. A 52, 2493 (1995).PLRAAN
    • (1995) Phys. Rev. A , vol.52 , pp. 2493
    • Shor, P.W.1
  • 22
    • 4243536108 scopus 로고    scopus 로고
    • PLRAAN
    • R. Cleve, Phys. Rev. A 55, 4054 (1997).PLRAAN
    • (1997) Phys. Rev. A , vol.55 , pp. 4054
    • Cleve, R.1
  • 23
    • 85037195680 scopus 로고    scopus 로고
    • IEEE Trans. Inf. Theory
    • E. M. Rains, IEEE Trans. Inf. Theory (to be published);
    • Rains, E.M.1
  • 25
    • 85037192891 scopus 로고    scopus 로고
    • Quantum hash coding is a protocol for which a vanishingly small fraction of errors are not corrected. The distance (Formula presented) for a typical hash code can be obtained by the following counting procedure: There are (Formula presented) likely error patterns to be assigned to (Formula presented) possible hash strings. It is highly likley that there will be cases where two error patterns are at random assigned to the same hash. A smaller set of error patterns can be assigned uniquely to hashes with a low probability of collision, provided that this number is smaller than (Formula presented) (coming from the usual birthday-paradox reasoning). This fixes the distance between such errors according to (Formula presented). Thus the distance scales as the block size, being approximately (Formula presented)
    • Quantum hash coding is a protocol for which a vanishingly small fraction of errors are not corrected. The distance (Formula presented) for a typical hash code can be obtained by the following counting procedure: There are (Formula presented) likely error patterns to be assigned to (Formula presented) possible hash strings. It is highly likley that there will be cases where two error patterns are at random assigned to the same hash. A smaller set of error patterns can be assigned uniquely to hashes with a low probability of collision, provided that this number is smaller than (Formula presented) (coming from the usual birthday-paradox reasoning). This fixes the distance between such errors according to (Formula presented). Thus the distance scales as the block size, being approximately (Formula presented).
  • 27
    • 84856043672 scopus 로고
    • Bell Syst. Tech. J.C. E. Shannon27, 623 (1948).
    • (1948) , vol.27 , pp. 623
    • Shannon, C.E.1
  • 29
    • 85037190285 scopus 로고    scopus 로고
    • Of course, even more exotic codes exist, ones that do not conform to the additive code classification at all. The only nonadditive codes of which we are aware are in
    • Of course, even more exotic codes exist, ones that do not conform to the additive code classification at all. The only nonadditive codes of which we are aware are in 42425. We cannot rule out the possibility that a nonadditive code achieves the best possible capacity for depolarizing channels. Only the code in 25 is directly relevant the depolarizing channel discussed in most of this paper.
  • 32
    • 85037217654 scopus 로고    scopus 로고
    • Proceedings of the Symposium on the Foundations of Computer Science (IEEE Press, Los Alamitos, CA, 1996)
    • P. W. Shor, in Proceedings of the Symposium on the Foundations of Computer Science (IEEE Press, Los Alamitos, CA, 1996);
    • Shor, P.W.1
  • 39
    • 0001521178 scopus 로고    scopus 로고
    • PLRAAN
    • S. Lloyd, Phys. Rev. A 55, 1613 (1997).PLRAAN
    • (1997) Phys. Rev. A , vol.55 , pp. 1613
    • Lloyd, S.1
  • 42
    • 51349163744 scopus 로고
    • JMOPEW
    • R. Jozsa, J. Mod. Opt. 41, 2315 (1994).JMOPEW
    • (1994) J. Mod. Opt. , vol.41 , pp. 2315
    • Jozsa, R.1
  • 44
    • 85037249056 scopus 로고    scopus 로고
    • We did not search all possible cat-in-cat codes up to 25 qubits, but the next best code we identified was a (Formula presented) inside a (Formula presented) cat code which had a threshold at (Formula presented). The (Formula presented) inside a (Formula presented) code was much worse, having a threshold at (Formula presented), worse even than the regular hashing result for which (Formula presented) and the threshold is at (Formula presented)
    • We did not search all possible cat-in-cat codes up to 25 qubits, but the next best code we identified was a (Formula presented) inside a (Formula presented) cat code which had a threshold at (Formula presented). The (Formula presented) inside a (Formula presented) code was much worse, having a threshold at (Formula presented), worse even than the regular hashing result for which (Formula presented) and the threshold is at (Formula presented).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.