Experimental demonstration of a compiled version of shor's algorithm with quantum entanglement

B. P. Lanyon*, T. J. Weinhold, N. K. Langford, M. Barbieri, D. F V James, A. Gilchrist, A. G. White

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

160 Citations (Scopus)

Abstract

Shor's powerful quantum algorithm for factoring represents a major challenge in quantum computation. Here, we implement a compiled version in a photonic system. For the first time, we demonstrate the core processes, coherent control, and resultant entangled states required in a full-scale implementation. These are necessary steps on the path towards scalable quantum computing. Our results highlight that the algorithm performance is not the same as that of the underlying quantum circuit and stress the importance of developing techniques for characterizing quantum algorithms.

Original languageEnglish
Article number250505
Pages (from-to)1-4
Number of pages4
JournalPhysical Review Letters
Volume99
Issue number25
DOIs
Publication statusPublished - 19 Dec 2007
Externally publishedYes

Fingerprint Dive into the research topics of 'Experimental demonstration of a compiled version of shor's algorithm with quantum entanglement'. Together they form a unique fingerprint.

Cite this