Classical simulability and the significance of modular exponentiation in Shor’s algorithm
We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and for general product measurements at the output, can efficiently simulate Shor's factoring algorithm. This is done by using the notion of the semiclassical Fourier tr...
Gespeichert in:
Veröffentlicht in: | Physical review. A, Atomic, molecular, and optical physics Atomic, molecular, and optical physics, 2007-12, Vol.76 (6), Article 060302 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and for general product measurements at the output, can efficiently simulate Shor's factoring algorithm. This is done by using the notion of the semiclassical Fourier transform due to Griffith and Niu, and further discussed in the context of Shor's algorithm by Browne. |
---|---|
ISSN: | 1050-2947 1094-1622 |
DOI: | 10.1103/PhysRevA.76.060302 |