27 April 2018 A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform
Author Affiliations +
Abstract
The Shor quantum factorization algorithm allows the factorization or large integers in logarithmic squared time whereas classical algorithms require an exponential time increase with the bit length of the number to be factored. The hardware implementation of the Shor algorithm would thus allow the factorization of the very large integers employed by commercial encryption methods. We propose some modifications of the algorithm by employing some simplification to the stage employing the quantum Fourier transform. The quantum Hadamard transform may be used to replace the quantum Fourier transform in certain cases. This would reduce the hardware complexity of implementation since phase rotation gates with only two states of 0 and π would be required.
Conference Presentation
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rupert C. D. Young, Rupert C. D. Young, Philip M. Birch, Philip M. Birch, Chris R. Chatwin, Chris R. Chatwin, } "A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform", Proc. SPIE 10649, Pattern Recognition and Tracking XXIX, 1064903 (27 April 2018); doi: 10.1117/12.2309468; https://doi.org/10.1117/12.2309468
PROCEEDINGS
10 PAGES + PRESENTATION

SHARE
Back to Top