Quantum_Shor.pdf (459.87 kB)
A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform
conference contribution
posted on 2023-06-09, 13:45 authored by Rupert YoungRupert Young, Phil BirchPhil Birch, Chris ChatwinChris ChatwinThe 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 p would be required.
History
Publication status
- Published
File Version
- Accepted version
Journal
Proceedings of SPIE, Pattern Recognition and Tracking XXIXISSN
0277-786XPublisher
Society of Photo-optical Instrumentation EngineersExternal DOI
Volume
10649Event name
SPIE Defense + SecurityEvent location
Orlando, Florida, United StatesEvent type
conferenceEvent date
15-19 April 2018Series
Pattern Recognition and TrackingDepartment affiliated with
- Engineering and Design Publications
Research groups affiliated with
- Industrial Informatics and Signal Processing Research Group Publications
Full text available
- Yes
Peer reviewed?
- Yes
Legacy Posted Date
2018-06-14First Open Access (FOA) Date
2018-06-14First Compliant Deposit (FCD) Date
2018-06-13Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC