Experimental requirements for Grover’s algorithm in optical quantum computation

2003/06/11 by Jennifer L. Dodd, Timothy C. Ralph, G. J. Milburn
Computer Science · Engineering · Physics and Astronomy · #Algorithm #Computation #Computer science #Controlled NOT gate #Neural Networks and Reservoir Computing #Optical Network Technologies #Physics #Quantum #Quantum Information and Cryptography #Quantum computer #Quantum gate #Quantum mechanics #Qubit #Theoretical computer science #quant-ph

paper · pdf · doi:10.1103/physreva.68.042328

9 pages, 8 figures

arxiv created 2003/06/11 · openalex publication_date 2003/10/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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 nonscalable controlled-NOT (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 [E. Knill, R. Laflamme, and G. J. Milburn, Nature (London) 409, 46 (2001)].

Citations

• Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
• Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate
• Encoding a qubit in an oscillator
• Tight Bounds on Quantum Searching
• Probabilistic quantum logic operations using polarizing beam splitters
• Climbing Mount Scalable: Physical Resource Requirements for a Scalable Quantum Computer