Quantum Algorithms for Intersection and Proximity Problems

  • Kunihiko Sadakane
  • Norito Sugawara
  • Takeshi Tokuyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)


We discuss applications of quantum computation to geometric data processing. Especially, we give efficient algorithms for intersection problems and proximity problems. Our algorithms are based on Brassard et al.’s amplitude amplification method, and analogous to Buhrman et al.’s algorithm for element distinctness. Revealing these applications is useful for classifying geometric problems, and also emphasizing potential usefulness of quantum computation in geometric data processing. Thus, the results will promote research and development of quantum computers and algorithms.


Voronoi Diagram Quantum Algorithm Target Data Quantum Model Identical Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Agarwal, Range searching, Section 31 of Handbook of Discrete and Computational Geometry (1997) 575–598, CRC Press.Google Scholar
  2. 2.
    P. Agarwal and M. Sharir, Efficient Algorithms for Geometric Optimization Research Report, Duke University, 2708-0129 (1997).Google Scholar
  3. 3.
    A. Ambanis, A better bound for quantum algorithms searching an ordered list, Proc. 40th FOCS (1999) 352–357.Google Scholar
  4. 4.
    E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM Journal on Computing 26(5) (1997)1411–1473.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    H. Buhrman, C. Dürr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, and R. de Wolf, Quantum algorithms for element distinctness, quant-ph/0007016, Proc. IEEE Complexity 2001 Google Scholar
  6. 6.
    G. Brassard, P. Hoyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation, quant-ph/0005055, to appear in Quantum Computation and Quantum Information: A Millenium Volume, AMS Contemporary Series, ed. S. Lomonaco.Google Scholar
  7. 7.
    K. Clarkson, New applications of random sampling in computational geometry, Discrete & Computational Geometry 2 (1987) 195–222.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    K. Clarkson and P. Shor, Applications of random sampling in computational geometry II, Discrete & Computational Geometry 4 (1989) 387–421.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    L. Grover, A faster quantum mechanical algorithm for database search, Proc. 28th STOC (1996) 212–219.Google Scholar
  10. 10.
    L. Grover, Quantum search on structured problems, Chaos, Solution, & Fractals 10 (1999), 1695–1705.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    L. Grover, Rapid sampling through quantum computing, Proc. 32nd STOC (2000), 618–626.Google Scholar
  12. 12.
    R. Motowani and P. Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995. 149Google Scholar
  13. 13.
    F. Preparata and I. Shamos, Computational Geometry — An Introduction (2nd edition), Springer-Verlag, 1988.Google Scholar
  14. 14.
    K. Sadakane, N. Sugawara, and T. Tokuyama, Quantum computation in computational geometry, submitted (2001).Google Scholar
  15. 15.
    P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput.,26(5) (1997) 1484–1509.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Kunihiko Sadakane
    • 1
  • Norito Sugawara
    • 1
  • Takeshi Tokuyama
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations