User talk:Jehochman: Difference between revisions
Appearance
Content deleted Content added
→The shors algorithm edit: Reply |
Add comic |
||
(25 intermediate revisions by 9 users not shown) | |||
Line 1: | Line 1: | ||
{{Wikipedia:Wikipedia Signpost/Templates/Inline image |
|||
<!--this subpage is graffiti, I tolerate but do not endorse the content--> |
|||
|image = File:Naturhistorisk Privatundervisning.jpg |
|||
{{/Antizilla}} |
|||
|size = 500px |
|||
{{busy|Jehochman|with graduate school}} |
|||
|align = center |
|||
{{Ds/aware|a-i|ap|e-e|a-a|9/11}} |
|||
|alt = Placeholder alt text |
|||
|fullwidth = yes |
|||
|capcenter = yes |
|||
|caption = <br/>{{big|{{big|"Hold on, I zoned out for a minute. Which one of you was the Icewhiz sock again?"}}}}{{small|[[Wikipedia:Wikipedia Signpost/2023-12-04/Comix|Source]]}} |
|||
}} |
|||
<!--my archives are messed up so I have removed the links. They might be fixed some day--> |
<!--my archives are messed up so I have removed the links. They might be fixed some day--> |
||
{{User:ClueBot III/ArchiveThis |
{{User:ClueBot III/ArchiveThis |
||
Line 14: | Line 20: | ||
|archivenow=<nowiki>{{User:ClueBot III/ArchiveNow}}</nowiki> |
|archivenow=<nowiki>{{User:ClueBot III/ArchiveNow}}</nowiki> |
||
}} |
}} |
||
{{Help button |Gamma-ray burst | Boom! |text=Press button for large explosion. }} |
|||
<br/> |
|||
__TOC__ |
__TOC__ |
||
== Invitation to participate in a research == |
|||
== ReferenceExpander == |
|||
Hello, |
|||
The Wikimedia Foundation is conducting a survey of Wikipedians to better understand what draws administrators to contribute to Wikipedia, and what affects administrator retention. We will use this research to improve experiences for Wikipedians, and address common problems and needs. We have identified you as a good candidate for this research, and would greatly appreciate your participation in this '''[https://wikimediafoundation.limesurvey.net/962595?lang=en anonymous survey]'''. |
|||
You do not have to be an Administrator to participate. |
|||
The survey should take around 10-15 minutes to complete. You may read more about the study on its [[m:Special:MyLanguage/Research:Wikipedia Administrator Recruitment, Retention, and Attrition|Meta page]] and view its [[wmf:Special:MyLanguage/Legal:Administrator Experiences 2024 Survey Privacy Statement|privacy statement]] . |
|||
Please find our contact on the project Meta page if you have any questions or concerns. |
|||
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) |
|||
Kind Regards, |
|||
== The shors algorithm edit == |
|||
[[mw:Special:MyLanguage/Wikimedia Research|WMF Research Team]] |
|||
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) |
|||
<bdi lang="en" dir="ltr">[[User:BGerdemann (WMF)|BGerdemann (WMF)]] ([[User talk:BGerdemann (WMF)|talk]]) 19:28, 23 October 2024 (UTC) </bdi> |
|||
: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) |
|||
<!-- Message sent by User:UOzurumba (WMF)@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=UOzurumba_(WMF)/sandbox_Research_announcement_list_for_enwiki_Potential_Admins&oldid=27650229 --> |
|||
::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) |
Latest revision as of 10:49, 30 October 2024
Invitation to participate in a research
[edit]Hello,
The Wikimedia Foundation is conducting a survey of Wikipedians to better understand what draws administrators to contribute to Wikipedia, and what affects administrator retention. We will use this research to improve experiences for Wikipedians, and address common problems and needs. We have identified you as a good candidate for this research, and would greatly appreciate your participation in this anonymous survey.
You do not have to be an Administrator to participate.
The survey should take around 10-15 minutes to complete. You may read more about the study on its Meta page and view its privacy statement .
Please find our contact on the project Meta page if you have any questions or concerns.
Kind Regards,