메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1627, Issue , 1999, Pages 174-183
Probabilities to accept languages by quantum finite automata
Author keywords

[No Author keywords available]
Indexed keywords

COMBINATORIAL MATHEMATICS; FINITE AUTOMATA; PROBABILITY;
EID: 84957798926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_17     Document Type: Conference Paper
Times cited : (26)
References (13)
  • 1
    • 0032320434 scopus 로고    scopus 로고
    • 1-way quantum finite automata: Strengths, weaknesses and generalizations
    • AF 98
    • AF 98. Andris Ambainis and Rūsiņš Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. 39th FOCS, 1998, p. 332-341. http://xxx:lanl:gov=abs=quant−ph=9802062
    • (1998) Proc. 39Th FOCS , pp. 332-341
    • Ambainis, A.1    Freivalds, R.2
  • 2
    • 0024714327 scopus 로고
    • Time-space tradeoffs for reversible computation
    • Be 89
    • Be 89. Charles Bennett. Time-space tradeoffs for reversible computation. SIAM J. Computing, 18:766-776, 1989.
    • (1989) SIAM J. Computing , vol.18 , pp. 766-776
    • Bennett, C.1
  • 6
    • 0002470138 scopus 로고
    • Quantum theory, the Church-Turing principle and the universal quantum computer
    • De 89
    • De 89. David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Royal Society London, A400, 1989. p. 96-117.
    • (1989) Proc. Royal Society London , pp. 96-117
    • Deutsch, D.1
  • 7
    • 51249180339 scopus 로고
    • Simulating physics with computers
    • Fe 82
    • Fe 82. Richard Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 1982, vol. 21, No. 6/7, p. 467-488.
    • (1982) International Journal of Theoretical Physics , vol.21 , Issue.6-7 , pp. 467-488
    • Feynman, R.1
  • 8
    • 85034453168 scopus 로고
    • Fast probabilistic algorithms
    • Fr 79
    • Fr 79. Rūsiņš Freivalds. Fast probabilistic algorithms. Lecture Notes in Computer Science, 1979, vol. 74, p. 57-69.
    • (1979) Lecture Notes in Computer Science , vol.74 , pp. 57-69
    • Freivalds, R.1
  • 10
    • 0031351354 scopus 로고    scopus 로고
    • On the power of quantum finite state automata
    • KW 97
    • KW 97. Attila Kondacs and John Watrous. On the power of quantum finite state automata. In Proc. 38th FOCS, 1997, p. 66-75.
    • (1997) Proc. 38Th FOCS , pp. 66-75
    • Kondacs, A.1    Watrous, J.2
  • 11
    • 0001869506 scopus 로고    scopus 로고
    • Quantum automata and quantum grammars
    • MC 97, to appear
    • MC 97. Christopher Moore, James P. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, to appear. Also available at http://xxx:lanl:gov=abs=quant−ph=9707031
    • Theoretical Computer Science
    • Moore, C.1    Crutchfield, J.P.2
  • 12
    • 0142051871 scopus 로고    scopus 로고
    • Polynomial time quantum algorithms for prime factorization and discrete logarithms on a quantum computer
    • Sh 97
    • Sh 97. Peter Shor. Polynomial time quantum algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 1997, vol. 26, p. 1484-1509.
    • (1997) SIAM Journal on Computing , vol.26 , pp. 1484-1509
    • Shor, P.1
  • 13
    • 0027873262 scopus 로고
    • Quantum circuit complexity
    • Ya 93
    • Ya 93. Andrew Chi-Chih Yao. Quantum circuit complexity. In Proc. 34th FOCS, 1993, p. 352-361.
    • (1993) Proc. 34Th FOCS , pp. 352-361
    • Yao, A.C.-C.1

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