arXiv Analytics

Sign in

arXiv:quant-ph/0306081AbstractReferencesReviewsResources

Experimental requirements for Grover's algorithm in optical quantum computation

Jennifer L. Dodd, Timothy C. Ralph, G. J. Milburn

Published 2003-06-11Version 1

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single non-scalable CNOT gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn.

Related articles: Most relevant | Search more
arXiv:quant-ph/0610130 (Published 2006-10-16)
Grover's algorithm on a Feynman computer
arXiv:1611.02926 [quant-ph] (Published 2016-11-09)
Quantum teleportation and Grover's algorithm without the wavefunction
arXiv:quant-ph/0012143 (Published 2000-12-27)
A Generalization of Grover's Algorithm