TY - GEN
T1 - Quantum algorithms for intersection and proximity problems
AU - Sadakane, Kunihiko
AU - Sugawara, Norito
AU - Tokuyama, Takeshi
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33747348898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33747348898&partnerID=8YFLogxK
U2 - 10.1007/3-540-45678-3_14
DO - 10.1007/3-540-45678-3_14
M3 - Conference contribution
AN - SCOPUS:33747348898
SN - 3540429859
SN - 9783540429852
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 148
EP - 159
BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001
Y2 - 19 December 2001 through 21 December 2001
ER -