Talk:Shor's algorithm: Difference between revisions

Revision as of 20:58, 6 August 2023

Latest revision as of 15:44, 13 May 2025

(6 intermediate revisions by 6 users not shown)

Line 1:

{{talkheader}}

{{WikiProject banner shell|1class=B|

{{maths rating|class=c|priority=mid|field=number theory}}

{{WikiProject Mathematics|priority=mid}}

{{physics|class=c|importance=mid}}

{{WikiProject computer science|class=cPhysics|importance=mid}}

{{physics|class=cWikiProject Computer science|importance=mid}}

}}

{{Archives}}

Line 15 ⟶ 16:

::The first few lines of the description of the algorithm state that the number N '''cannot''' be the power of a prime (say P^Q). How difficult would it be to implement an encryption scheme that raised a prime number to a prime exponent? That would seem to solve the problem as well, wouldn't it? -- [[User:TheLastWordSword|TheLastWordSword]] ([[User talk:TheLastWordSword|talk]]) 22:21, 9 January 2014 (UTC)

:::{{ping|TheLastWordSword}} A power of prime, and any other perfect power for that matter, is trivial to factor by taking roots up to the log-base-2-of-Nth root of N, a polynomial time operation.--[[User:Jasper Deng|Jasper Deng]] [[User talk:Jasper Deng|(talk)]] 06:48, 19 October 2023 (UTC)

==Nature article==

Line 37 ⟶ 39:

::@[[User:Tapeworms27|Tapeworms27]] thanks! I mostly agree with your changes, and archiving most of the old discussions here which were either stale or outdated with the current version of the wiki anyway.

::I'm not very familiar with quality assessment levels, but having had a quick look at [[Wikipedia:Content assessment]], I'm not so sure I'd rate the current version of this page as more than C. I think there's still plenty that can be done, both in quality of writing for some of the sections, and in additional content to add. For example, adding how the algorithm works out in an explicit toy example would help a lot digesting the material. Also some additional detail about the number of qubits required in the first register is needed: currently the article just says "2n is sufficient" without saying why.   [[User:Luca Innocenti|Luca]] ([[User talk:Luca Innocenti|talk]]) 20:58, 6 August 2023 (UTC)

== Simple Animation of Shor's ==

https://www.youtube.com/watch?v=nvk8xU2BNnY [[User:Doug youvan|Doug youvan]] ([[User talk:Doug youvan|talk]]) 15:34, 13 February 2024 (UTC)

== Added short section entitled Shor's algorithm Qiskit implementation ==

I made modifications that I trust are acceptable. [[User:JavaFXpert|JavaFXpert]] ([[User talk:JavaFXpert|talk]]) 22:40, 20 February 2025 (UTC)