scientific article; zbMATH DE number 5320378

MaRDI QIDQ3522601zbMATH OpenFDO

Authors Simon J. Devitt, Austin G. Fowler, Lloyd C. L. Hollenberg

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0408081

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• An implementation of Shor's \(r\)-algorithm
• A note on Shor's quantum algorithm
• Probability estimates for Shor's algorithm
• Realization of a scalable shor algorithm
• Shor's r-algorithms: theory and practice
• Robustness in quantum measurements
• STACS 2005
• Robust polynomials and quantum algorithms
• Robust Quantum Algorithms with ε-Biased Oracles
• Robust quantum private queries

Cited in

(8)

• Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
• A fine estimate of quantum factorization success probability
• Scalability of Shor’s algorithm with a limited set of rotation gates
• Robust Quantum Algorithms with ε-Biased Oracles
• Improving the success probability for Shor's factorization algorithm
• A precise estimation of the computational complexity in Shor's factoring algorithm
• scientific article; zbMATH DE number 2222672 (Why is no real title available?)
• Robustness verification of quantum classifiers

This page was built for publication:

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