메뉴 건너뛰기




Volumn 47, Issue 6, 2001, Pages 2644-2649

Quantum birthday problems: Geometrical aspects of quantum random coding

Author keywords

Asymptotic orthogonality; Birthday problem; Quantum channel coding; Quantum information theory; Random vector; R nyi entropy; Von Neumann entropy

Indexed keywords

GEOMETRY; INFORMATION THEORY; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; VECTORS;

EID: 0035443285     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945283     Document Type: Letter
Times cited : (3)

References (9)
  • 4
    • 0018527510 scopus 로고
    • Capacity of a quantum communication channel
    • (in Russian); Translation in Probl. Inform. Transm., vol. 15, pp. 247-253, 1979
    • (1979) Probl. Pered. Inform. , vol.15 , pp. 3-11
    • Holevo, A.S.1


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