|
<!--this subpage is graffiti, I tolerate but do not endorse the content-->
{{busy|Jehochman|with graduate school}} ▼{{/Antizilla}}
▲{{busy|Jehochman|with graduate school}}
{{Ds/aware|a-i|ap|e-e|a-a|9/11}}
<!--my archives are messed up so I have removed the links. They might be fixed some day-->
{{User:ClueBot III/ArchiveThis
|archivenow=<nowiki>{{User:ClueBot III/ArchiveNow}}</nowiki>
}}
{{Help button |Gamma-ray burst | Boom! |text=Press button for large explosion. }}
<br/>
__TOC__
== ReferenceExpander ==
Just a friendly heads-up in case you weren't already aware, since it's installed on your common.js: Careless use of ReferenceExpander has caused serious problems. It's [[WP:Miscellany for deletion/User:BrandonXLF/ReferenceExpander|currently at MFD]], and [[User:XOR'easter/sandbox/ReferenceExpander|a large cleanup project]] is underway to repair the citations damaged by the script. I and several other users have !voted that the script be deleted or disabled, and I wouldn't recommend using it at all unless you thoroughly check ''every'' reference it modifies against the previous revision. If you're interested in a more detailed explanation of the script's issues, {{noping|Folly Mox}} has provided an excellent summary at the MFD. — [[User:SamX|SamX]] [[[User talk:SamX#top|talk]] '''·''' [[Special:Contributions/SamX|contribs]]] 05:03, 1 June 2023 (UTC)
== The shors algorithm edit ==
can you explain what you meant by ballony?
I don't see a problem with how it was before your edits [[User:Quantumly|Quantumly]] ([[User talk:Quantumly|talk]]) 00:22, 7 June 2023 (UTC)
:The bit about Shor’s being efficient because of modular exponentiation was baloney. That operation is what makes shores so inefficient in terms of circuit complexity O(n^3). The binary Fourier transform is also not an efficiency. What makes Shor’s efficient is quantum parallelism and constructive/destructive interference. This allows a readout with significant probability of being a multiple of the order of the subgroup. [[User:Jehochman|Jehochman]] <sup>[[User talk:Jehochman|Talk]]</sup> 01:47, 7 June 2023 (UTC)
::Yes, at first I thought the part about modular exponentiation made sense if you're looking at the slightly modified version using phase estimation, but yes it is ballony.
::I also am not sure why you felt changing my edit of exponential back to sub-exponential? I really think the definition of sub-exponential including things like O(2^(n^k)) for 0 < k < 1 is a bit misleading. There are problems that are complete in EXP-time that take "sub-exponential" time if you use this definition (poly reductions still get you any exponential function) which sounds just wrong! [[User:Quantumly|Quantumly]] ([[User talk:Quantumly|talk]]) 01:54, 7 June 2023 (UTC)
:::I think we should fix the definition of sub-exponential because there’s a big difference between exponential and sub-exponential and we should be clear and accurate when talking about GNFS. [[User:Jehochman|Jehochman]] <sup>[[User talk:Jehochman|Talk]]</sup> 01:56, 7 June 2023 (UTC)
::::To be clear GNFS takes time less than all exponential algorithms, but more than all polynomial algorithms. It’s distinctly in between the two classes. [[User:Jehochman|Jehochman]] <sup>[[User talk:Jehochman|Talk]]</sup> 01:58, 7 June 2023 (UTC)
::I am sorry for being gruff. Quantum computing is widely misunderstood, and even writers who are experts can get confused. [[User:Jehochman|Jehochman]] <sup>[[User talk:Jehochman|Talk]]</sup> 01:55, 7 June 2023 (UTC)
| 