Quantum Algorithms for Intersection and Proximity Problems

Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1113-1119
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE86-A
Issue number5
Publication statusPublished - 2003 May

Keywords

  • Amplitude amplification
  • Computational geometry
  • Intersection
  • Proximity
  • Quantum algorithms

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Quantum Algorithms for Intersection and Proximity Problems'. Together they form a unique fingerprint.

Cite this