TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

An Interactive Introduction to Quantum Computing

254 pointsby kevlenedover 7 years ago

7 comments

robertkrahn01over 7 years ago
Interesting in this regard might also be the talk that Robert Smith of Rigetti Computing recently gave: <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=f9vRcSAneiw" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=f9vRcSAneiw</a><p>Apart from praising Common Lisp he describes how they are building an assembler-like language for quantum computing.<p>The HN thread: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=15880172" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=15880172</a>
westurnerover 7 years ago
Part 2 mentions two quantum algorithms that could be used to break Bitcoin (and SSH and SSL&#x2F;TLS; and most modern cryptographic security systems): Shor&#x27;s algorithm for factorization and Grover&#x27;s search algorithm.<p>Part 2: <a href="http:&#x2F;&#x2F;davidbkemp.github.io&#x2F;QuantumComputingArticle&#x2F;part2.html" rel="nofollow">http:&#x2F;&#x2F;davidbkemp.github.io&#x2F;QuantumComputingArticle&#x2F;part2.ht...</a><p>Shor&#x27;s algorithm: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Shor%27s_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Shor%27s_algorithm</a><p>Grover&#x27;s algorithm: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Grover%27s_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Grover%27s_algorithm</a><p>I don&#x27;t know what heading I&#x27;d suggest for something about how concentration of quantum capabilities will create dangerous asymmetry. (That is why we need post-quantum (&quot;quantum resistant&quot;) hash, signature, and encryption algorithms in the near future.)
oneweekwonderover 7 years ago
&gt; Sorry, I but cannot assume you know nothing at all!<p>Make the witty text a hyperlink to <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Boolean_algebra" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Boolean_algebra</a> ?
评论 #15905213 未加载
avodonosovover 7 years ago
Long talk about superpositions of probabilities, but almost no explanation about how can that help in <i>computing</i>.<p>How can the probabilistic operations speedup computations? No explanation given.
评论 #15903073 未加载
评论 #15905119 未加载
评论 #15903609 未加载
评论 #15903710 未加载
mozumderover 7 years ago
I feel like theres potential here for quantum computers to represent perceptrons in neural networks, since they seem to both operate with rough states.
评论 #15904205 未加载
zimzimover 7 years ago
why Hadamard of 1 is diffrent from Hadmard of 0?
评论 #15905234 未加载
dvtover 7 years ago
&gt; Qubits represent 0 and 1 using quantum phenomenon like the nuclear spin direction of individual atoms.<p>Not trying to be <i>that guy</i> but this is so wrong&#x2F;misleading, it hurts (and I&#x27;m not even a physicist!). Spin isn&#x27;t a &quot;direction&quot; and atoms don&#x27;t &quot;spin&quot; -- well, they might, but the quantum kind of spin has nothing to do with angular momentum.
评论 #15903987 未加载
评论 #15905082 未加载