pith. sign in

arxiv: quant-ph/0306081 · v1 · submitted 2003-06-11 · 🪐 quant-ph

Experimental requirements for Grover's algorithm in optical quantum computation

classification 🪐 quant-ph
keywords loqcalgorithmcnotcomputationexperimentalexperimentsgrovermilestones
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.