Computational geometry: an introduction
Computational geometry: an introduction
An introduction to ray tracing
An introduction to ray tracing
Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the difficulty of range searching
Computational Geometry: Theory and Applications
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Reflections on quantum computing
Complexity
Quantum computation and quantum information
Quantum computation and quantum information
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Proceedings of the 6th ACM conference on Computing frontiers
Histogram-based segmentation of quantum images
Theoretical Computer Science
Hi-index | 0.00 |
Quantum computing (QC) has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing (CC). In particular, QC is able to exploit the special properties of quantum superposition to achieve computational parallelism beyond what can be achieved with parallel CC computers. However, these special properties are not applicable for general computation. Therefore, we propose the use of "hybrid quantum computers" (HQCs) that combine both classical and quantum computing architectures in order to leverage the benefits of both. We demonstrate how an HQC can exploit quantum search to support general database operations more efficiently than is possible with CC. Our solution is based on new quantum results that are of independent significance to the field of quantum computing. More specifically, we demonstrate that the most restrictive implications of the quantum No-Cloning Theorem can be avoided through the use of semiclones. In this paper we discuss specific applications of quantum search to problems in computational geometry, simulation, and computer graphics.