ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

DOI10.1142/9789814447546_0011zbMATH Open1325.81054OpenAlexW2491185298MaRDI QIDQ3449656FDOQ3449656

Igor V. Volovich, Masanori Ohya, S. Iriyama

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)

Cited In (6)

• Primality Test Via Quantum Factorization
• New quantum algorithm solving the NP complete problem
• Title not available (Why is that?)
• Closed-form formula on quantum factorization effectiveness
• Factorization of numbers with Gauss sums: III. Algorithms with entanglement
• A low-resource quantum factoring algorithm

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• A low-resource quantum factoring algorithm 👍 👎
• Title not available (Why is that?) 👍 👎
• Quantum computers, factoring, and decoherence 👍 👎
• Title not available (Why is that?) 👍 👎
• On quantum complexity 👍 👎

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)