Quantum Computation in Computational Geometry

DOI10.4036/IIS.2002.129MaRDI QIDQ4800313zbMATH OpenOpenAlexFDO

Authors Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama

Publication date 2002

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c6148bace55f6e05236a4c32570316158890c485

zbMATH Keywords

linear programmingconvex hullsquantum computationgeometric algorithmsintersection problemsminimum enclosing ballsgeometric data processing

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Quantum algorithmic methods for computational geometry
• scientific article; zbMATH DE number 2080987
• A quantum search algorithm of two-dimensional convex hull
• Tight quantum bounds for computational geometry problems
• Quantum algorithms for computational geometry problems

Cited in

(9)

• Quantum algorithmic methods for computational geometry
• A quantum search algorithm of two-dimensional convex hull
• scientific article; zbMATH DE number 2103531 (Why is no real title available?)
• A simple quantum computation to calculate intersection of data sets
• Tight quantum bounds for computational geometry problems
• Quantum algorithms for computational geometry problems
• Quantum computation as geometry
• Geometry of discrete quantum computing
• scientific article; zbMATH DE number 2080987 (Why is no real title available?)

This page was built for publication: Quantum Computation in Computational Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800313)