Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING - MaRDI portal

ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

From MaRDI portal

Publication:3449656

Jump to:navigation, search

DOI10.1142/9789814447546_0011zbMath1325.81054OpenAlexW2491185298MaRDI QIDQ3449656

Masanori Ohya, Igor V. Volovich, Satoshi 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 complexity quantum algorithm prime factoring

Mathematics Subject Classification ID

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

Related Items (1)

New quantum algorithm solving the NP complete problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3449656&oldid=16770495"