Tight quantum bounds for computational geometry problems

DOI10.1142/S0219749909005572MaRDI QIDQ3401879zbMATH OpenOpenAlexFDO

Authors Nilton Volpato, Arnaldo Vieira Moura

Publication date 1 February 2010

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219749909005572

zbMATH Keywords

computational geometrylower boundquantum algorithmquantum computingupper bound

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum Computation in Computational Geometry
• Quantum algorithmic methods for computational geometry
• Quantum algorithms for computational geometry problems
• Quantum lower bounds by quantum arguments
• Quantum lower bounds by quantum arguments

Cites work

• A simple randomized sieve algorithm for the closest-pair problem
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computation in Computational Geometry
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum Walk Algorithm for Element Distinctness
• Secure assisted quantum computation

Cited in

(3)

• Quantum Computation in Computational Geometry
• scientific article; zbMATH DE number 7561744 (Why is no real title available?)
• Quantum algorithms for Hopcroft's problem

This page was built for publication: Tight quantum bounds for computational geometry problems

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