No CrossRef data available.
Article contents
Quantum algorithmic methods for computational geometry
Published online by Cambridge University Press: 08 November 2010
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
In this paper we develop novel quantum algorithms based on Quantum Multi-Object Search (QMOS) for convex hulls and general object intersection reporting, with applications to computer graphics. These algorithms are developed and described using standard concepts from computer science by encapsulating the physics of quantum computation within black-box subroutines.
Information
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 20 , Special Issue 6: Quantum Algorithms , December 2010 , pp. 1117 - 1125
- Copyright
- Copyright © Cambridge University Press 2010
References
Andersson, A. and Swanson, K. (1997) On the difficulty of range searching. Computational Geometry with Applications 8 (3)115–122.Google Scholar
Boyer, M., Brassard, G., Hoyer, P. and Tapp, A. (1996) Tight bounds on quantum searching. Proceedings of the Fourth Workshop on Physics and Computation.Google Scholar
Brassard, G., Hoyer, P., Mosca, M. and Tapp, A. (2000) Quantum amplitude amplification and estimation. e-print quant-ph/0005055.Google Scholar
Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.Google Scholar
Preparata, F. P. and Shamos, M. I. (1985) Computational Geometry, Springer-Verlag.CrossRefGoogle Scholar
You have
Access
- 16
- Cited by