A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Digital Image Processing
Quantum Information Processing
Hybrid quantum-classical computing with applications to computer graphics
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Proceedings of the 24th international conference on Machine learning
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Explorations in Quantum Computing
Explorations in Quantum Computing
Proceedings of the 6th ACM conference on Computing frontiers
Processing images in entangled quantum systems
Quantum Information Processing
Quantum Information Processing
Strategies for designing geometric transformations on quantum images
Theoretical Computer Science
Watermarking and authentication of quantum images based on restricted geometric transformations
Information Sciences: an International Journal
A watermark strategy for quantum images based on quantum fourier transform
Quantum Information Processing
| Hi-index | 5.23 |
In this paper we investigate the use of quantum computing systems in the field of image processing. We consider histogram-based image processing operations and develop quantum algorithms for histogram computation and threshold-based segmentation. The underlying principle used for constructing the proposed quantum algorithms is to reformulate them in order to exploit the performance of the quantum Fourier transform and of quantum amplitude amplification. We show that, compared to the classical correspondents, a significant speedup can be achieved by expressing parts of the computational process in terms of problems that can be solved using these quantum techniques.