2009/11/06 by Alberto Politi, Jonathan C. F. Matthews, Jeremy L. O'Brien · 1 citation
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1126/science.1173731
published as Science, 325, 1221 (2009) · 2 pages, 1 figure
arxiv created 2009/11/06 · arxiv updated 2009/12/01
Shor's quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method a task that lies at the heart of modern information security, particularly on the internet. This algorithm requires a quantum computer a device which harnesses the `massive parallelism' afforded by quantum superposition and entanglement of quantum bits (or qubits). We report the demonstration of a compiled version of Shor's algorithm on an integrated waveguide silica-on-silicon chip that guides four single-photon qubits through the computation to factor 15.