ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

DOI10.1142/9789814447546_0011zbMATH1325.81054OpenAlexW2491185298MaRDI QIDQ3449656FDOQ3449656

Authors Masanori Ohya, S. Iriyama, Igor V. Volovich

Publication date 4 November 2015

Published in Quantum Probability and Related Topics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814447546_0011

zbMATH Keywords

computational complexityquantum algorithmprime factoring

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• A precise estimation of the computational complexity in Shor's factoring algorithm
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum factoring algorithm: resource estimation and survey of experiments
• Computation of quantum factorials and their inverses
• A low-resource quantum factoring algorithm
• scientific article; zbMATH DE number 799789
• Quantum computers, factoring, and decoherence
• scientific article; zbMATH DE number 5049912
• On quantum complexity

Cited in

(8)

• scientific article; zbMATH DE number 5568412 (Why is no real title available?)
• Factorization of numbers with Gauss sums: III. Algorithms with entanglement
• Primality Test Via Quantum Factorization
• Complexity considerations quantum computation
• New quantum algorithm solving the NP complete problem
• A precise estimation of the computational complexity in Shor's factoring algorithm
• Closed-form formula on quantum factorization effectiveness
• A low-resource quantum factoring algorithm

This page was built for publication: ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

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