Closed-form formula on quantum factorization effectiveness

DOI10.1007/S11128-012-0360-4MaRDI QIDQ1937229zbMATH OpenOpenAlexFDO

Authors Piotr Zawadzki

Publication date 28 February 2013

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11128-012-0360-4

zbMATH Keywords

factorizationquantum computingsecure communication

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• A fine estimate of quantum factorization success probability
• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• Quantum factoring algorithm: resource estimation and survey of experiments
• Computation of quantum factorials and their inverses
• Efficient diabatic quantum algorithm in number factorization
• Formula lower bounds via the quantum method
• Factorizations of quantum effects
• scientific article; zbMATH DE number 841639
• Factorization in finite quantum systems

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Probability estimates for Shor's algorithm

Cited in

(1)

• A fine estimate of quantum factorization success probability

This page was built for publication: Closed-form formula on quantum factorization effectiveness

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