메뉴 건너뛰기




Volumn 312, Issue 2-3, 2004, Pages 479-489

Characterizations of quantum automata

Author keywords

Automata; Grammars; Hilbert spaces; Quantum computation

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GRAMMARS; FORMAL LANGUAGES; QUANTUM THEORY; SET THEORY;

EID: 0347600621     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.08.007     Document Type: Article
Times cited : (20)

References (12)
  • 1
    • 0032320434 scopus 로고    scopus 로고
    • One-way quantum finite automata: Strengths, weaknesses and generalizations
    • Palo Alfo, California, Also quant-ph/9802062, 1998
    • A. Ambainis, R. Freivalds, One-way quantum finite automata: strengths, weaknesses and generalizations, in: Proc. 39th Annu. Symp. on Foundations of Computer Science, Palo Alfo, California, 1998, pp. 332-341. Also quant-ph/9802062, 1998.
    • (1998) Proc. 39th Annu. Symp. on Foundations of Computer Science , pp. 332-341
    • Ambainis, A.1    Freivalds, R.2
  • 2
    • 0032631760 scopus 로고    scopus 로고
    • Dense quantum coding and a lower bound for 1-way quantum automata
    • Atlanta, Georgia, Also quant-ph/9804043, 1998
    • A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in: Proc. 31st Annu. ACM Symp. on Theory of Computing, Atlanta, Georgia, 1999, pp. 376-383. Also quant-ph/9804043, 1998.
    • (1999) Proc. 31st Annu. ACM Symp. on Theory of Computing , pp. 376-383
    • Ambainis, A.1    Nayak, A.2    Ta-Shma, A.3    Vazirani, U.4
  • 3
    • 0037174192 scopus 로고    scopus 로고
    • Two-way finite automata with quantum and classical states
    • Ambainis A., Watrous J. Two-way finite automata with quantum and classical states. Theoret. Comput. Sci. 287:2002;299-311.
    • (2002) Theoret. Comput. Sci. , vol.287 , pp. 299-311
    • Ambainis, A.1    Watrous, J.2
  • 4
    • 0036588754 scopus 로고    scopus 로고
    • Characterizations of 1-way quantum finite automata
    • Also quant-ph/9903014, 1999
    • Broadsky A., Pippenger N. Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31:2002;1456-1478. Also quant-ph/9903014, 1999.
    • (2002) SIAM J. Comput. , vol.31 , pp. 1456-1478
    • Broadsky, A.1    Pippenger, N.2
  • 5
    • 84956976494 scopus 로고    scopus 로고
    • Quantum pushdown automata
    • Proc. 27th Conf. on Current Trends in Theory and Practice of Informatics, Milovy, Springer, Berlin
    • M. Golovkins, Quantum pushdown automata, in: Proc. 27th Conf. on Current Trends in Theory and Practice of Informatics, Milovy, Lecture Notes in Computer Science, Vol. 1963, Springer, Berlin, 2000, pp. 336-346.
    • (2000) Lecture Notes in Computer Science , vol.1963 , pp. 336-346
    • Golovkins, M.1
  • 8
    • 0442326281 scopus 로고    scopus 로고
    • Basic properties of quantum automata
    • Gudder S. Basic properties of quantum automata. Found. Phys. 30:2000;301-319.
    • (2000) Found. Phys. , vol.30 , pp. 301-319
    • Gudder, S.1
  • 11
    • 0000134862 scopus 로고    scopus 로고
    • Quantum automata and quantum grammars
    • Also quant-ph/9707031, 1997
    • Moore C., Crutchfield J.P. Quantum automata and quantum grammars. Theoret. Comput. Sci. 237:2000;275-306. Also quant-ph/9707031, 1997.
    • (2000) Theoret. Comput. Sci. , vol.237 , pp. 275-306
    • Moore, C.1    Crutchfield, J.P.2
  • 12
    • 0036092767 scopus 로고    scopus 로고
    • Characterization of sequential quantum machines
    • Qiu D.W. Characterization of sequential quantum machines. Internat. J. Theoret. Phys. 41:2002;811-822.
    • (2002) Internat. J. Theoret. Phys. , vol.41 , pp. 811-822
    • Qiu, D.W.1


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