메뉴 건너뛰기




Volumn 4, Issue 3, 2004, Pages 201-206

How significant are the known collision and element distinctness quantum algorithms

Author keywords

Collision; Element Distinctness; Quantum Algorithms

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

EID: 4043095544     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (22)

References (15)
  • 1
    • 4243807288 scopus 로고    scopus 로고
    • Quantum Mechanics helps in searching for a needle in a haystack
    • L. K. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, 78(2), 325, 1997, also at http://www.bell-labs. com/user/lkgrover/.
    • (1997) Phys. Rev. Letters , vol.78 , Issue.2 , pp. 325
    • Grover, L.K.1
  • 3
    • 0000206762 scopus 로고    scopus 로고
    • Graver's quantum searching is optimal
    • C. Zalka, Graver's quantum searching is optimal, Phys. Rev. A 60, 2746 (1999).
    • (1999) Phys. Rev. A , vol.60 , pp. 2746
    • Zalka, C.1
  • 4
    • 0036878935 scopus 로고    scopus 로고
    • Trade-offs in the quantum search algorithm
    • L. K. Grover, Trade-offs in the quantum search algorithm, Phys. Rev. A 66, 052314 (2002).
    • (2002) Phys. Rev. A , vol.66 , pp. 052314
    • Grover, L.K.1
  • 5
    • 4243643113 scopus 로고    scopus 로고
    • Quantum computers can search rapidly by using almost any transformation
    • L. K. Grover, Quantum computers can search rapidly by using almost any transformation, Phys. Rev. Letters, 80(19), 1998, 4329-4332; A framework for fast quantum mechanical algorithms, Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998, 53-63.
    • (1998) Phys. Rev. Letters , vol.80 , Issue.19 , pp. 4329-4332
    • Grover, L.K.1
  • 6
    • 0031645678 scopus 로고    scopus 로고
    • A framework for fast quantum mechanical algorithms
    • L. K. Grover, Quantum computers can search rapidly by using almost any transformation, Phys. Rev. Letters, 80(19), 1998, 4329-4332; A framework for fast quantum mechanical algorithms, Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998, 53-63.
    • (1998) Proc. 30th ACM Symposium on Theory of Computing (STOC) , pp. 53-63
  • 8
    • 4043181421 scopus 로고    scopus 로고
    • G. Brassard and P. Hoyer, quant-ph/9704027
    • G. Brassard, P. Hoeyer, M. Mosca and Alain Tapp, Quantum amplitude amplification and estimation, quant-ph/0005055; G. Brassard and P. Hoyer, quant-ph/9704027.
  • 9
    • 0036036708 scopus 로고    scopus 로고
    • Quantum lower bound for the collision problem
    • Also quant-ph/0111102
    • S. Aaronson, Quantum lower bound for the collision problem, STOC '02, pp.635-642. Also quant-ph/0111102.
    • STOC '02 , pp. 635-642
    • Aaronson, S.1
  • 13
    • 0002685054 scopus 로고    scopus 로고
    • Quantum algorithms for the collision problem
    • Also quant-ph/9705002
    • G. Brassard, P. Hoyer & A. Tapp, Quantum Algorithms for the collision problem, SIGACT News, 28:14-19,1997. Also quant-ph/9705002
    • (1997) SIGACT News , vol.28 , pp. 14-19
    • Brassard, G.1    Hoyer, P.2    Tapp, A.3
  • 15
    • 4043107916 scopus 로고    scopus 로고
    • private communication
    • Umesh Vazirani, private communication.
    • Vazirani, U.1


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