Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
Top Cited Papers
- 19 December 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 99 (25) , 250505
- https://doi.org/10.1103/physrevlett.99.250505
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.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- High-speed linear optics quantum computing using active feed-forwardNature, 2007
- Measurement of the Entanglement of Two Superconducting Qubits via State TomographyScience, 2006
- Demonstration of an Optical Quantum Controlled-NOT Gate without Path InterferencePhysical Review Letters, 2005
- Linear Optics Controlled-Phase Gate Made SimplePhysical Review Letters, 2005
- Demonstration of a Simple Entangling Optical Gate and Its Use in Bell-State AnalysisPhysical Review Letters, 2005
- Experimental one-way quantum computingNature, 2005
- Quantum Process Tomography of a Controlled-NOT GatePhysical Review Letters, 2004
- Demonstration of an all-optical quantum controlled-NOT gateNature, 2003
- Realization of the Cirac–Zoller controlled-NOT quantum gateNature, 2003
- Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gateNature, 2003