A quantum algorithm for database search using photons
1 : Laboratoire dÍnformatique, de Modélisation et dÓptimisation des Systèmes
Université Clermont Auvergne : UMR6158, Université Clermont Auvergne
2 : Laboratoire de Physique de Clermont
Institut National de Physique Nucléaire et de Physique des Particules du CNRS, Centre National de la Recherche Scientifique : UMR6533, Université Clermont Auvergne : UMR6533, Centre National de la Recherche Scientifique, Université Clermont Auvergne
3 : CGI Clermont Ferrand
CGI
Quantum computing is a several decades old idea, which remained a rather pure field of theoretical
studies for some time, until quantum technologies finally allowed to manipulate quantum
objects with the requested precision in order to build the elementary blocks of quantum computing:
the qubits. The most common opinion today is that a quantum
processor will play the role of a specialized co-processor connected to a classical computing
machine, and that, probably, each technology will find its maximum efficiency in a more or
less extended field of applications. The number of efficient algorithms discovered up to now is
quite modest, and the quest for finding other algorithms encounters the very complex problem
of the underlying mathematics of quantum mechanics. Among these ideas, we aim to present how Grover's search can be implemented on photonic quantum computers using the dual-rail encoding, hopefully enabling researchers to see beyond the gate-based model and better exploit these emerging technologies.

