Share Email Print

Proceedings Paper

A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform
Author(s): Rupert C. D. Young; Philip M. Birch; Chris R. Chatwin
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 27 April 2018
PDF: 10 pages
Proc. SPIE 10649, Pattern Recognition and Tracking XXIX, 1064903 (27 April 2018); doi: 10.1117/12.2309468
Show Author Affiliations
Rupert C. D. Young, Univ. of Sussex (United Kingdom)
Philip M. Birch, Univ. of Sussex (United Kingdom)
Chris R. Chatwin, Univ. of Sussex (United Kingdom)

Published in SPIE Proceedings Vol. 10649:
Pattern Recognition and Tracking XXIX
Mohammad S. Alam, Editor(s)

© SPIE. Terms of Use
Back to Top