메뉴 건너뛰기




Volumn , Issue , 2003, Pages 200-209

Quantum search of spatial regions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; QUANTUM THEORY;

EID: 0344009617     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (106)

References (22)
  • 2
    • 0032313840 scopus 로고    scopus 로고
    • Quantum lower bounds by polynomials
    • quant-ph/9802049
    • R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf. Quantum lower bounds by polynomials, FOCS'98, pp. 352-361, 1998. quant-ph/9802049.
    • (1998) FOCS'98 , pp. 352-361
    • Beals, R.1    Buhrman, H.2    Cleve, R.3    Mosca, M.4    De Wolf, R.5
  • 3
    • 33750708757 scopus 로고
    • A universal upper bound on the entropy to energy ratio for bounded systems
    • J. D. Bekenstein. A universal upper bound on the entropy to energy ratio for bounded systems, Phys. Rev. D23:287, 1981.
    • (1981) Phys. Rev. , vol.D23 , pp. 287
    • Bekenstein, J.D.1
  • 4
    • 20744434184 scopus 로고    scopus 로고
    • Space searches with a quantum robot
    • (S. J. Lomonaco and H. E. Brandt, eds.); quant-ph/003006
    • P. Benioff. Space searches with a quantum robot, Quantum Computation & Information (S. J. Lomonaco and H. E. Brandt, eds.), 2002. quant-ph/003006.
    • (2002) Quantum Computation & Information
    • Benioff, P.1
  • 5
    • 0001063035 scopus 로고    scopus 로고
    • Strengths and weaknessess of quantum computing
    • quant-ph/9701001
    • C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknessess of quantum computing, SIAM J. Comput. 26(5):1510-1523, 1997. quant-ph/9701001.
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1510-1523
    • Bennett, C.1    Bernstein, E.2    Brassard, G.3    Vazirani, U.4
  • 6
    • 7044226599 scopus 로고    scopus 로고
    • Positive vacuum energy and the N-bound
    • hepth/0010252
    • R. Bousso. Positive vacuum energy and the N-bound, J. High Energy Phys. 0011:038, 2000. hepth/0010252.
    • (2000) J. High Energy Phys.
    • Bousso, R.1
  • 7
    • 0036659444 scopus 로고    scopus 로고
    • The holographic principle
    • hep-th/0203101
    • R. Bousso. The holographic principle, Rev. Mod. Phys. 74(3), 2002. hep-th/0203101.
    • (2002) Rev. Mod. Phys. , vol.74 , Issue.3
    • Bousso, R.1
  • 8
    • 0032338939 scopus 로고    scopus 로고
    • Tight bounds on quantum searching
    • quant-ph/9605034
    • M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching, Fortschritte Der Physik 46(4-5):493-505, 1998. 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
  • 9
    • 0942266992 scopus 로고    scopus 로고
    • Quantum amplitude amplification and estimation
    • (S. J. Lomonaco and H. E. Brandt, eds.); quant-ph/0005055
    • G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation, Quantum Computation & Information (S. J. Lomonaco and H. E. Brandt, eds.), 2002. quant-ph/0005055.
    • (2002) Quantum Computation & Information
    • Brassard, G.1    Høyer, P.2    Mosca, M.3    Tapp, A.4
  • 10
    • 0031630576 scopus 로고    scopus 로고
    • Quantum vs. classical communication and computation
    • quant-ph/9702040
    • H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation, STOC'98, pp. 63-68, quant-ph/9702040.
    • (1998) STOC'98 , pp. 63-68
    • Buhrman, H.1    Cleve, R.2    Wigderson, A.3
  • 11
    • 2342472493 scopus 로고    scopus 로고
    • Spatial search by quantum walk
    • submitted; quant-ph/0306054
    • A. M. Childs and J. Goldstone. Spatial search by quantum walk, submitted, 2003. quant-ph/0306054.
    • (2003)
    • Childs, A.M.1    Goldstone, J.2
  • 12
    • 0042127184 scopus 로고    scopus 로고
    • Extensive entropy bounds
    • gr-qc/0212087
    • G. Gour. Extensive entropy bounds, Phys. Rev. D67, 2003. gr-qc/0212087.
    • (2003) Phys. Rev. , vol.D67
    • Gour, G.1
  • 13
    • 0029701737 scopus 로고    scopus 로고
    • A fast quantum mechanical algorithm for database search
    • quant-ph/9605043
    • L. K. Grover. A fast quantum mechanical algorithm for database search, STOC'96, pp. 212-219, 1996. quant-ph/9605043.
    • (1996) STOC'96 , pp. 212-219
    • Grover, L.K.1
  • 14
    • 84937432486 scopus 로고    scopus 로고
    • Improved quantum communication complexity bounds for disjointness and equality
    • quant-ph/0109068
    • P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality, STACS'2002, LNCS 2285, pp. 299-310, 2002. quant-ph/0109068.
    • (2002) STACS'2002, LNCS 2285
    • Høyer, P.1    De Wolf, R.2
  • 15
    • 0037054126 scopus 로고    scopus 로고
    • Computational capacity of the universe
    • quant-ph/0110141, 237901
    • S. Lloyd. Computational capacity of the universe, Phys. Rev. Lett. 88 (237901), 2002. quant-ph/0110141.
    • (2002) Phys. Rev. Lett. , vol.88
    • Lloyd, S.1
  • 16
    • 0033147122 scopus 로고    scopus 로고
    • Measurements of Ω and Λ from 42 high-redshift supernovae
    • astro-ph/9812133
    • S. Perlmutter and 32 others (Supernova Cosmology Project), Measurements of Ω and Λ from 42 high-redshift supernovae, Astrophysical Journal 517(2):565-586, 1999. astro-ph/9812133.
    • (1999) Astrophysical Journal , vol.517 , Issue.2 , pp. 565-586
    • Perlmutter, S.1
  • 17
    • 0345269910 scopus 로고    scopus 로고
    • Quantum communication complexity of symmetric predicates
    • (Russian); English version at quant-ph/0204025
    • A. A. Razborov. Quantum communication complexity of symmetric predicates (Russian), Izvestiya Math. 6, 2002, English version at quant-ph/0204025.
    • (2002) Izvestiya Math. , vol.6
    • Razborov, A.A.1
  • 18
    • 24844463960 scopus 로고    scopus 로고
    • Quantum searching a classical database (or how we learned to stop worrying and love the bomb)
    • quant-gh/0206066
    • T. Rudolph and L. Grover. Quantum searching a classical database (or how we learned to stop worrying and love the bomb), 2002. quant-gh/0206066.
    • (2002)
    • Rudolph, T.1    Grover, L.2
  • 19
    • 0037768972 scopus 로고    scopus 로고
    • A quantum random walk search algorithm
    • quant-ph/0210064, 052307
    • N. Shenvi, J. Kempe, and K. B. Whaley. A quantum random walk search algorithm, Phys. Rev. A67 (052307), 2003. quant-ph/0210064.
    • (2003) Phys. Rev. , vol.A67
    • Shenvi, N.1    Kempe, J.2    Whaley, K.B.3
  • 20
    • 0142051871 scopus 로고    scopus 로고
    • Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
    • quant-ph/9508027
    • P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26(5):1484-1509, 1997. quant-ph/9508027.
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1484-1509
    • Shor, P.1
  • 21
    • 0029541042 scopus 로고
    • On one-dimensional quantum cellular automata
    • J. Watrous. On one-dimensional quantum cellular automata, FOCS'95, pp. 528-537, 1995.
    • (1995) FOCS'95 , pp. 528-537
    • Watrous, J.1
  • 22
    • 0344196448 scopus 로고    scopus 로고
    • Could Grover's algorithm help in searching an actual database?
    • quant-ph/9901068
    • Ch. Zalka. Could Grover's algorithm help in searching an actual database?, 1999. quant-ph/9901068.
    • (1999)
    • Zalka, Ch.1


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