메뉴 건너뛰기




Volumn 2589, Issue , 2003, Pages 309-323

Quantum computing and abstract state machines

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS; QUANTUM THEORY;

EID: 23844554785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36498-6_18     Document Type: Article
Times cited : (15)

References (8)
  • 3
    • 84947248224 scopus 로고    scopus 로고
    • Sequential Abstract State Machines capture sequential algorithms
    • Y. GUREVICH, Sequential Abstract State Machines capture sequential algorithms, ACM Transactions on Computational Logic, 1 (2000), pp. 77-111.
    • (2000) ACM Transactions on Computational Logic , vol.1 , pp. 77-111
    • Gurevich, Y.1
  • 7
    • 0142051871 scopus 로고    scopus 로고
    • Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
    • P. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing, 26 (1997), pp. 1484-1509.
    • (1997) SIAM Journal on Computing , vol.26 , pp. 1484-1509
    • Shor, P.1
  • 8
    • 0035924370 scopus 로고    scopus 로고
    • Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
    • L. VANDERSYPEN, M. STEFFEN, G. BREYTA, C. YANNONI, M. SHERWOOD, AND I. CHUANG, Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance, Nature, 414 (2001), pp. 883-887.
    • (2001) Nature , vol.414 , pp. 883-887
    • Vandersypen, L.1    Steffen, M.2    Breyta, G.3    Yannoni, C.4    Sherwood, M.5    Chuang, I.6


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