<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: D-Wave&#8217;s Quantum Computers are the Real Deal</title>
	<atom:link href="http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/feed/" rel="self" type="application/rss+xml" />
	<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/</link>
	<description>Chinese, Linguistics, Science, Cultural Observations and whatever else I feel like writing about</description>
	<pubDate>Fri, 22 Aug 2008 02:59:02 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: Mark</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-140010</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Sun, 11 May 2008 19:58:54 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-140010</guid>
		<description>I have become somewhat concerned by the D-Wave blog's frequent suggestions that a quantum computer would revolutionize the calculation of NP-complete problems.  From what I understand, q-bits allow factorization (e.g. RSA breaking) in polynomial time, but NP-complete problems are a completely different beast.  Most likely a quantum computer would only reduce the time to square root of that required by a conventional one.  For a 1000 point traveling salesman problem, the a quantum computer would require 2&lt;sup&gt;500&lt;/sup&gt; steps, rather than 2&lt;sup&gt;1000&lt;/sup&gt;.  In other words, NP-complete problems would still be essentially unsolvable. 

http://www.scottaaronson.com/writings/limitsqc-draft.pdf

I'm still convinced that D-Wave has a true break-through, but these kinds of unsubstantiated claims are a pretty big red flag.</description>
		<content:encoded><![CDATA[<p>I have become somewhat concerned by the D-Wave blog&#8217;s frequent suggestions that a quantum computer would revolutionize the calculation of NP-complete problems.  From what I understand, q-bits allow factorization (e.g. RSA breaking) in polynomial time, but NP-complete problems are a completely different beast.  Most likely a quantum computer would only reduce the time to square root of that required by a conventional one.  For a 1000 point traveling salesman problem, the a quantum computer would require 2<sup>500</sup> steps, rather than 2<sup>1000</sup>.  In other words, NP-complete problems would still be essentially unsolvable. </p>
<p><a href="http://www.scottaaronson.com/writings/limitsqc-draft.pdf" rel="nofollow">http://www.scottaaronson.com/writings/limitsqc-draft.pdf</a></p>
<p>I&#8217;m still convinced that D-Wave has a true break-through, but these kinds of unsubstantiated claims are a pretty big red flag.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: todd</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-114101</link>
		<dc:creator>todd</dc:creator>
		<pubDate>Thu, 27 Dec 2007 20:15:21 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-114101</guid>
		<description>I have a bunch of data and photos that I encrypted with
DH/DSS 1024/2048 and I forgot my passphrase.  So I'm
rooting for DWave so I can get my stuff back! :-)
I bet they'll have a 1024 qbit prototype in a less than
3 years!</description>
		<content:encoded><![CDATA[<p>I have a bunch of data and photos that I encrypted with<br />
DH/DSS 1024/2048 and I forgot my passphrase.  So I&#8217;m<br />
rooting for DWave so I can get my stuff back! <img src='http://toshuo.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /><br />
I bet they&#8217;ll have a 1024 qbit prototype in a less than<br />
3 years!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: trevelyan</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-104207</link>
		<dc:creator>trevelyan</dc:creator>
		<pubDate>Wed, 14 Nov 2007 12:53:43 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-104207</guid>
		<description>I was under the impression (from reading some of Schneier's stuff) that quantum computing made it expontentially easier to solve certain types of factoring problems (ie. breaking RSA), but would not instantly obliviate other sorts of encryption algorithms.

The potential for these devices for pattern recognition and neural networks is very cool.</description>
		<content:encoded><![CDATA[<p>I was under the impression (from reading some of Schneier&#8217;s stuff) that quantum computing made it expontentially easier to solve certain types of factoring problems (ie. breaking RSA), but would not instantly obliviate other sorts of encryption algorithms.</p>
<p>The potential for these devices for pattern recognition and neural networks is very cool.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-104072</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Wed, 14 Nov 2007 05:57:12 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-104072</guid>
		<description>512-qbits can do quite a bit in terms of encryption breaking and 1024-qbits would far, far outstrip any other computer on the planet.

Dr. Rose said on his blog that they should be able to factor RSA-704 once they hit 512-qbits.  Read the 12th and 13th comments to the post on his blog that I cited for the picture of the chip.</description>
		<content:encoded><![CDATA[<p>512-qbits can do quite a bit in terms of encryption breaking and 1024-qbits would far, far outstrip any other computer on the planet.</p>
<p>Dr. Rose said on his blog that they should be able to factor RSA-704 once they hit 512-qbits.  Read the 12th and 13th comments to the post on his blog that I cited for the picture of the chip.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sanktnelson</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-103916</link>
		<dc:creator>sanktnelson</dc:creator>
		<pubDate>Wed, 14 Nov 2007 00:16:42 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-103916</guid>
		<description>Actually, D-wave's Geordie Rose has said repeatedly that the type of Quantum computer that they're currently building is not suitable to break encryption. Although their adiabatic approach can be extended to be computationally equivalent to the gate-model approach, this seems to be not planned at the moment.</description>
		<content:encoded><![CDATA[<p>Actually, D-wave&#8217;s Geordie Rose has said repeatedly that the type of Quantum computer that they&#8217;re currently building is not suitable to break encryption. Although their adiabatic approach can be extended to be computationally equivalent to the gate-model approach, this seems to be not planned at the moment.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt Ball</title>
		<link>http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-103865</link>
		<dc:creator>Matt Ball</dc:creator>
		<pubDate>Tue, 13 Nov 2007 21:21:53 +0000</pubDate>
		<guid isPermaLink="false">http://toshuo.com/2007/d-waves-quantum-computers-are-the-real-deal/#comment-103865</guid>
		<description>Well since you put my name in the 'Tags', I've got to at least say something!  So here we go...

Last I had heard, it was unclear whether quantum computers can easily scale.  There's a problem with keeping the qubits stable for the duration of the calculation.  As you add more qubits, the problem gets worse.

The other thing I heard was that you need A LOT of qubits to solve meaningful cryptographic problems.  I believe that even with 500 qubits, a cluster of computers (for a fraction of the cost) can still out-perform the quantum computer for its proficient calculations.

As an investment option, I would be very hesitant to go with D-Wave, but if they are able to scale the qubits gracefully, the potential is very large.  Maybe a 90% chance they go bust, but a 10% chance they give a decent return. In any case, it's cool technology to follow, and I'm happy to see it get funding.</description>
		<content:encoded><![CDATA[<p>Well since you put my name in the &#8216;Tags&#8217;, I&#8217;ve got to at least say something!  So here we go&#8230;</p>
<p>Last I had heard, it was unclear whether quantum computers can easily scale.  There&#8217;s a problem with keeping the qubits stable for the duration of the calculation.  As you add more qubits, the problem gets worse.</p>
<p>The other thing I heard was that you need A LOT of qubits to solve meaningful cryptographic problems.  I believe that even with 500 qubits, a cluster of computers (for a fraction of the cost) can still out-perform the quantum computer for its proficient calculations.</p>
<p>As an investment option, I would be very hesitant to go with D-Wave, but if they are able to scale the qubits gracefully, the potential is very large.  Maybe a 90% chance they go bust, but a 10% chance they give a decent return. In any case, it&#8217;s cool technology to follow, and I&#8217;m happy to see it get funding.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
