Shor's quantum factoring algorithm on a photonic chip
Quantum Physics
2009-11-09 v1
Abstract
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.
Cite
@article{arxiv.0911.1242,
title = {Shor's quantum factoring algorithm on a photonic chip},
author = {Alberto Politi and Jonathan C. F. Matthews and Jeremy L. O'Brien},
journal= {arXiv preprint arXiv:0911.1242},
year = {2009}
}
Comments
2 pages, 1 figure