A quantum search algorithm of two-dimensional convex hull
From MaRDI portal
Publication:6042499
DOI10.1088/1572-9494/AC1DA0zbMATH Open1510.68029OpenAlexW3195019692MaRDI QIDQ6042499FDOQ6042499
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
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Quantum computation (81P68)
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- Quantum circuit design for several morphological image processing methods
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- NEQR: a novel enhanced quantum representation of digital images
- Title not available (Why is that?)
- Quantum image scaling using nearest neighbor interpolation
- A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
- An Algorithm for Convex Polytopes
- Quantum algorithmic methods for computational geometry
- Phase matching condition for quantum search with a generalized initial state
- A novel quantum representation of color digital images
- Quantum circuit realization of the bilinear interpolation method for GQIR
- Improved quantum dilation and erosion operations
- A low failure rate quantum algorithm for searching maximum or minimum
- Asymmetric scaling scheme over the two dimensions of a quantum image
Cited In (3)
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)
