Phys. Rev. Lett. 99, 250505 (2007) [4 pages]Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum EntanglementReceived 18 May 2007; published 19 December 2007 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. © 2007 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.99.250505
DOI:
10.1103/PhysRevLett.99.250505
PACS:
03.67.Lx, 03.67.−a, 03.67.Mn, 42.50.Dv
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.