메뉴 건너뛰기




Volumn 68, Issue 5, 2003, Pages 523111-523116

Lower bounds on the complexity of simulating quantum gates

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA PROCESSING; DEGREES OF FREEDOM (MECHANICS); EIGENVALUES AND EIGENFUNCTIONS; HAMILTONIANS; INTEGER PROGRAMMING; LOGIC GATES; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PARAMETER ESTIMATION; THEOREM PROVING; VECTORS;

EID: 0942289430     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (34)

References (28)
  • 15
    • 0004151496 scopus 로고    scopus 로고
    • Springer-Verlag, New York
    • R. Bhatia, Matrix Analysis (Springer-Verlag, New York, 1997).
    • (1997) Matrix Analysis
    • Bhatia, R.1


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