New applications of quantum algorithms to computer graphics

Abstract

The inherent parallelism of quantum systems determined not only the investigation of innovative applications that can be developed using these high performance computing systems, but also of ways to improve the performances over the classical case. Exploiting this parallelism recently led to the emergence of innovative ideas in the field of computer graphics, sketching the development of quantum rendering and quantum computational geometry. Following these tracks, we propose a new quantum algorithm for the RANdom SAmple Consensus (RANSAC) voting scheme. In this paper we show that by exploiting the unique features of quantum computing, generating uniform superpositions of states in the problem space and applying quantum operators to all states simultaneously, the performance of our quantum algorithm is orders of magnitude faster than the classical variant.