1 / 10

Experimental Realization of Shor’s Factoring Algorithm ‡

Experimental Realization of Shor’s Factoring Algorithm ‡. M. Steffen 1,2 , L.M.K. Vandersypen 1,2 , G. Breyta 1 , C.S. Yannoni 1 , M. Sherwood 1 , I.L.Chuang 1,3. 1 IBM Almaden Research Center, San Jose, CA 95120 2 Stanford University, Stanford, CA 94305

sahkyo
Download Presentation

Experimental Realization of Shor’s Factoring Algorithm ‡

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Experimental Realization of Shor’s Factoring Algorithm‡ M. Steffen1,2, L.M.K. Vandersypen1,2, G. Breyta1, C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3 1 IBM Almaden Research Center, San Jose, CA 95120 2 Stanford University, Stanford, CA 94305 3 MIT Media Laboratory, Cambridge, MA 02139 ‡Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001)

  2. Shor’s Factoring Algorithm Quantum circuit to factor an integer N gcd(ar/2±1,N) Implemented for the case N = 15 -- expect 3 and 5

  3. Factoring N = 15 Challenging experiment: • synthesis of suitable 7 qubit molecule • requires interaction between almost • all pairs of qubits • coherent control over qubits

  4. Factoring N = 15 mod exp QFT a = 7 ‘hard case’ a = 11 ‘easy case’

  5. The molecule

  6. Pulse Sequence Init. mod. exp. QFT ~ 300 RF pulses || ~ 750 ms duration

  7. Results: Spectra Mixture of |0,|4 23/4 = r = 2 gcd(112/2 ± 1, 15) = 3, 5 a = 11 15 = 3 · 5 a = 7 Mixture of |0,|2,|4,|6 23/2 = r = 4 gcd(74/2 ± 1, 15) = 3, 5 qubit 3 qubit 2 qubit 1

  8. Results: Predictive Decoherence Model Operator sum representation:   kEk  Ek† Generalized Amplitude Damping

  9. Results: Circuit Simplifications ‘Peephole’ optimization • control of C is |0 • control of F is |1 • E and H inconsequential to outcome • targets of D and G in computational basis

  10. Conclusions • First experimental demonstration of • Shor’s factoring algorithm • Developed predictivedecoherence model • Methods for circuit simplifications

More Related