Quantum algorithms for computational geometry problems

DOI10.4230/LIPICS.TQC.2020.9MaRDI QIDQ5874394zbMATH OpenOpenAlexFDO

Authors Nikita Larka, Andris Ambainis

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2004.08949

zbMATH Keywords

3SUM problemamplitude amplificationcomputational geometryquantum algorithmsquantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Quantum algorithmic methods for computational geometry
• scientific article; zbMATH DE number 2080987
• Quantum Computation in Computational Geometry
• A panoply of quantum algorithms
• On a class of \(O(n^ 2)\) problems in computational geometry

Cited in

(11)

• An online calculator for quantum computing operations based on geometric algebra
• Quantum algorithmic methods for computational geometry
• Tight quantum bounds for computational geometry problems
• scientific article; zbMATH DE number 2080987 (Why is no real title available?)
• Quantum Computation in Computational Geometry
• A quantum search algorithm of two-dimensional convex hull
• Near-optimal quantum algorithms for string problems
• Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
• Quantum algorithm for computing distances between subspaces
• Quantum algorithms for Hopcroft's problem
• Quantum speedups for polynomial-time dynamic programming algorithms

This page was built for publication: Quantum algorithms for computational geometry problems

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