메뉴 건너뛰기




Volumn 21, Issue 3, 1999, Pages 417-429

Reasoning about Grover's quantum search algorithm using probabilistic wp

Author keywords

Quantum computation; Quantum mechanics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; PROBABILITY; SEARCH ENGINES; STATISTICAL METHODS;

EID: 0041412799     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/319301.319303     Document Type: Article
Times cited : (10)

References (14)
  • 1
    • 0004245694 scopus 로고
    • Number 55 in Applied Mathematics Series. U. S. Dept. of Commerce, National Bureau of Standards
    • ABRAMOWITZ, M. AND STEGUN, I. A. 1964. Handbook of mathematical functions. Number 55 in Applied Mathematics Series. U. S. Dept. of Commerce, National Bureau of Standards.
    • (1964) Handbook of Mathematical Functions
    • Abramowitz, M.1    Stegun, I.A.2
  • 2
    • 34250256884 scopus 로고
    • The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
    • BENIOFF, P. 1980. The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 22, 563-591.
    • (1980) Journal of Statistical Physics , vol.22 , pp. 563-591
    • Benioff, P.1
  • 4
    • 0002768948 scopus 로고    scopus 로고
    • Quantum computation
    • Springer-Verlag
    • BERTHIAUME, A. 1996. Quantum computation. In Complexity Theory Retrospective II. Springer-Verlag. Available from http://andre.cs.depaul.edu/Andre/publicat.htm.
    • (1996) Complexity Theory Retrospective II , vol.2
    • Berthiaume, A.1
  • 5
    • 0032338939 scopus 로고    scopus 로고
    • Tight bounds on quantum searching
    • BOYER, M., BRASSARD, G., HØYER, P., AND TAPP, A. 1998. Tight bounds on quantum searching. Fortschritte Der Physik 46, 4-5, 493-505. Available from http://xxx.lanl.gov/abs/quant-ph/9605034.
    • (1998) Fortschritte Der Physik , vol.46 , Issue.4-5 , pp. 493-505
    • Boyer, M.1    Brassard, G.2    HØyer, P.3    Tapp, A.4
  • 6
    • 0022421379 scopus 로고
    • Quantum theory, the Church-Turing principle and the universal quantum computer
    • DEUTSCH, D. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. In Royal Society London A 400. 96-117.
    • (1985) Royal Society London A , vol.400 , pp. 96-117
    • Deutsch, D.1
  • 7
    • 0001893626 scopus 로고    scopus 로고
    • Quantum computation
    • DEUTSCH, D. AND EKERT, A. 1998. Quantum computation. Physics World 11, 3, 47-52. Available from http://www.qubit.org/.
    • (1998) Physics World , vol.11 , Issue.3 , pp. 47-52
    • Deutsch, D.1    Ekert, A.2
  • 9
    • 4243807288 scopus 로고    scopus 로고
    • Quantum mechanics helps in searching for a needle in a haystack
    • GROVER, L. 1997. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 79, 2, 325-328.
    • (1997) Physical Review Letters , vol.79 , Issue.2 , pp. 325-328
    • Grover, L.1
  • 11
    • 0020732231 scopus 로고
    • A probabilistic PDL
    • KOZEN, D. 1985. A probabilistic PDL. J. Comput. Syst. Sci. 30, 162-178.
    • (1985) J. Comput. Syst. Sci. , vol.30 , pp. 162-178
    • Kozen, D.1
  • 13
    • 0012691159 scopus 로고    scopus 로고
    • Proof rules for probabilistic loops
    • H. Jifeng, J. Cooke, and P. Wallis, Eds. Electronic Workshops in Computing. Springer-Verlag
    • MORGAN, C. 1996. Proof rules for probabilistic loops. In BCS-FACS Refinement Workshop, H. Jifeng, J. Cooke, and P. Wallis, Eds. Electronic Workshops in Computing. Springer-Verlag. Available from http://www.comlab.ox.ac.uk/oucl/publications/tr/TR-25-95.html.
    • (1996) BCS-FACS Refinement Workshop
    • Morgan, C.1


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