Prime Factorization in the Duality Computer
classification
🪐 quant-ph
keywords
algorithmsdualityfactorizationcomputercomputingmethodalgorithmclassical
read the original abstract
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.