메뉴 건너뛰기




Volumn 63, Issue 3, 2001, Pages 355-383

Quantum neural networks

Author keywords

Church Turning thesis; Parallel computation; Quantum computing; Theoretical computer science; Threshold circuits

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL MODELS; NONLINEAR EQUATIONS; PARALLEL PROCESSING SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS; POLYNOMIALS; QUANTUM THEORY; THRESHOLD LOGIC; TURING MACHINES;

EID: 0035521409     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1769     Document Type: Article
Times cited : (133)

References (43)
  • 3
    • 0008651743 scopus 로고
    • Depth reductions for circuits of unbounded fan-in
    • [An earlier version appears as: E. Allender, A note on the power of threshold circuits, Found. Comput. Sci. (1989) 580-584]
    • (1994) SIAM J. Comput. , vol.112 , pp. 217-238
    • Allender, E.1    Hertrampf, U.2
  • 27
    • 0009716861 scopus 로고    scopus 로고
    • Quantum circuits: Fanout, parity and counting
    • (1999)
    • Moore, C.1
  • 30
  • 37
    • 0142051871 scopus 로고    scopus 로고
    • Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1484-1509
    • Shor, P.W.1


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