A quantum search algorithm of two-dimensional convex hull

DOI10.1088/1572-9494/AC1DA0MaRDI QIDQ6042499zbMATH OpenOpenAlexFDO

Authors

Publication date 10 May 2023

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1572-9494/ac1da0

zbMATH Keywords

computational geometryconvex hullquantum algorithmquantum searching

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Quantum computation (81P68)

Recommendations

• Quantum algorithmic methods for computational geometry
• Quantum Computation in Computational Geometry
• A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
• Quantum algorithms for computational geometry problems
• Quantum image edge detection algorithm

Cites work

• A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
• A low failure rate quantum algorithm for searching maximum or minimum
• A novel quantum representation of color digital images
• An Algorithm for Convex Polytopes
• An efficient algorithm for determining the convex hull of a finite planar set
• Asymmetric scaling scheme over the two dimensions of a quantum image
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Improved quantum dilation and erosion operations
• NEQR: a novel enhanced quantum representation of digital images
• Phase matching condition for quantum search with a generalized initial state
• Quantum algorithmic methods for computational geometry
• Quantum circuit design for several morphological image processing methods
• Quantum circuit realization of the bilinear interpolation method for GQIR
• Quantum image scaling using nearest neighbor interpolation
• Quantum theory, the Church–Turing principle and the universal quantum computer

Cited in

(6)

• Quantum algorithmic methods for computational geometry
• Quantum Computation in Computational Geometry
• The rectilinear convex hull of line segments
• Inner -approximation of the convex hull of finite sets
• Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
• Quantum combine and conquer and its applications to sublinear quantum convex hull and maxima set construction

This page was built for publication: A quantum search algorithm of two-dimensional convex hull

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