A note on Shor's quantum algorithm

MaRDI QIDQ879724zbMATH OpenFDO

Authors Zhengjun Cao, Li Hua Liu

Publication date 9 May 2007

Published in Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

zbMATH Keywords

quantum algorithms

Mathematics Subject Classification ID

Quantum logic (03G12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Review text

The 3-page-note claims to overcome shortcomings of Shor's original article. It ends with the question whether the new algorithm is very time and space consuming.

Cited in

(7)

• Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
• A bijective proof of the Shor recurrence
• Shor’s Quantum Factoring Algorithm on a Photonic Chip
• Scalability of Shor’s algorithm with a limited set of rotation gates
• scientific article; zbMATH DE number 5320229 (Why is no real title available?)
• scientific article; zbMATH DE number 5320378 (Why is no real title available?)
• A Note on the Instantiability of the Quantum Random Oracle

This page was built for publication: A note on Shor's quantum algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879724)