Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

P=NP via Factorization and Shor's Algorithm

יהוה, Kaoru Aguilera Katayama

Published Feb 11, 2026• 0 citations
Publisher

Abstract

We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.

DOI
10.5281/zenodo.18604587

Related papers

Shor’s Algorithm for Integer Factorization

Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor

SpringerBriefs in computer science•Jan 1, 2019•16 citations

Breaking Integer Factorization Using Shor’s Algorithm: A Practical Approach with IBM Qiskit

Anand Ghugare, Atharva Rajoba, Dinesh Kumar Saini

Smart innovation, systems and technologies•Jan 1, 2026•0 citations

A Re-evaluation of Shor's Algorithm

J. Cooper

Shor's algorithm is examined critically from the standpoint of it's eventual use to obtain the factors of large integers.

arXiv:quant-ph/0612077•Dec 11, 2006•1 citation

Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm

Poornima Ardhyamath, N. M. Naghabhushana, Rohitha Ujjinimatad

World Scientific News•Jan 1, 2019•1 citation

A-6-7 Factoring Gaussian Integers using Shor's Algorithm

Hachiro Fujita

電子情報通信学会ソサイエティ大会講演論文集•Aug 31, 2010•0 citations

Quantum Threat to Cryptographic Security: Implementation and Analysis of Shor’s Algorithm for Integer Factorization Using IBM Qiskit

Anubhav Saxena, Dinesh Kumar Saini, Satpal Singh Kushwaha

Lecture notes in networks and systems•Oct 29, 2025•1 citation
We prove P=NPP = NPP=NP by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in O(log⁡ n)O(\log\ n)O(log n).