<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: A great question</title>
	<atom:link href="http://dwave.wordpress.com/2007/02/01/a-great-question/feed/" rel="self" type="application/rss+xml" />
	<link>http://dwave.wordpress.com/2007/02/01/a-great-question/</link>
	<description></description>
	<lastBuildDate>Wed, 04 Nov 2009 04:15:07 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: pupkarik</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-19524</link>
		<dc:creator>pupkarik</dc:creator>
		<pubDate>Sat, 03 May 2008 06:52:07 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-19524</guid>
		<description>xdvdsfvd fdgsd 
fdsaiuwa dfgdsgfs</description>
		<content:encoded><![CDATA[<p>xdvdsfvd fdgsd<br />
fdsaiuwa dfgdsgfs</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 11 questions for Geordie D. Wave &#171; we don&#8217;t need no &#8220;sticking&#8221; room 408</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1449</link>
		<dc:creator>11 questions for Geordie D. Wave &#171; we don&#8217;t need no &#8220;sticking&#8221; room 408</dc:creator>
		<pubDate>Tue, 06 Mar 2007 02:22:46 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1449</guid>
		<description>[...] something so complicated. I actually talk a little bit about this in one of my blog posts (see here) although that focuses more on the big company vs. start up [...]</description>
		<content:encoded><![CDATA[<p>[...] something so complicated. I actually talk a little bit about this in one of my blog posts (see here) although that focuses more on the big company vs. start up [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matteo Martini</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1438</link>
		<dc:creator>Matteo Martini</dc:creator>
		<pubDate>Sun, 04 Mar 2007 12:07:36 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1438</guid>
		<description>Richard George wrote:
&quot; and a quantum computer is never going to compete for that application &quot;

Can not see why..

&quot; If I were someone at IBM or HP looking to make an extra billion of sales in five or ten years time, I’d be asking myself if I wanted to spend that $50M today on researching Quantum computing, or to use that money to try to win some of the existing market share off my competitors my improving my existing products. &quot;

I think you are missing few points:
1)     $50 million today may well be worth few &quot; extra billions &quot; of sales in 5 or 10 years time;
2)     Moore` s Law is in danger of stopping in 3-4 years, at the 22nm node, as nobody, at the moment, has a clear idea of how to proceed to an hypothetical 15nm node. Current silicon tech is probably not stretchable until 15nm, and no clear alternative has appeared so far..;  
3)     quantum computing does not seem 10 years away, as D-Wave is working on a 1kqbit QC in 1 1/2 year timeframe;  
4)     if $50M means $50M per year, D-Wave seems to have built a QC with less money than that</description>
		<content:encoded><![CDATA[<p>Richard George wrote:<br />
&#8221; and a quantum computer is never going to compete for that application &#8221;</p>
<p>Can not see why..</p>
<p>&#8221; If I were someone at IBM or HP looking to make an extra billion of sales in five or ten years time, I’d be asking myself if I wanted to spend that $50M today on researching Quantum computing, or to use that money to try to win some of the existing market share off my competitors my improving my existing products. &#8221;</p>
<p>I think you are missing few points:<br />
1)     $50 million today may well be worth few &#8221; extra billions &#8221; of sales in 5 or 10 years time;<br />
2)     Moore` s Law is in danger of stopping in 3-4 years, at the 22nm node, as nobody, at the moment, has a clear idea of how to proceed to an hypothetical 15nm node. Current silicon tech is probably not stretchable until 15nm, and no clear alternative has appeared so far..;<br />
3)     quantum computing does not seem 10 years away, as D-Wave is working on a 1kqbit QC in 1 1/2 year timeframe;<br />
4)     if $50M means $50M per year, D-Wave seems to have built a QC with less money than that</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Richard George</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1374</link>
		<dc:creator>Richard George</dc:creator>
		<pubDate>Wed, 21 Feb 2007 14:31:39 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1374</guid>
		<description>I think that IBM and HP make most of their revenue from selling machines to do really simple things with almost linear complexity (we&#039;ll say N.log(N) is about the worst case allowable)... but with very high reliability and well thought-out back-up and disaster recovery plans.

eg. automating the accounting at world banks, keeping inventories for the military such that they can process 1000&#039;s of transactions per second 365/24 even if there is an earthquake or a fire at one of the record centres. This is where most of the market for large computers is today, and a quantum computer is never going to compete for that application. 

If I were someone at IBM or HP looking to make an extra billion of sales in five or ten years time, I&#039;d be asking myself if I wanted to spend that $50M today on researching Quantum computing, or to use that money to try to win some of the existing market share off my competitors my improving my existing products.</description>
		<content:encoded><![CDATA[<p>I think that IBM and HP make most of their revenue from selling machines to do really simple things with almost linear complexity (we&#8217;ll say N.log(N) is about the worst case allowable)&#8230; but with very high reliability and well thought-out back-up and disaster recovery plans.</p>
<p>eg. automating the accounting at world banks, keeping inventories for the military such that they can process 1000&#8217;s of transactions per second 365/24 even if there is an earthquake or a fire at one of the record centres. This is where most of the market for large computers is today, and a quantum computer is never going to compete for that application. </p>
<p>If I were someone at IBM or HP looking to make an extra billion of sales in five or ten years time, I&#8217;d be asking myself if I wanted to spend that $50M today on researching Quantum computing, or to use that money to try to win some of the existing market share off my competitors my improving my existing products.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mag.e</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1364</link>
		<dc:creator>Mag.e</dc:creator>
		<pubDate>Mon, 19 Feb 2007 17:00:49 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1364</guid>
		<description>I just ran over this patent - it seems IBM IS investing in QM and it&#039;s exactly the D-wave technology they are interested in:
http://www.google.com/patents?vid=USPAT6495854&amp;id=luYKAAAAEBAJ</description>
		<content:encoded><![CDATA[<p>I just ran over this patent &#8211; it seems IBM IS investing in QM and it&#8217;s exactly the D-wave technology they are interested in:<br />
<a href="http://www.google.com/patents?vid=USPAT6495854&amp;id=luYKAAAAEBAJ" rel="nofollow">http://www.google.com/patents?vid=USPAT6495854&amp;id=luYKAAAAEBAJ</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous Coward</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1340</link>
		<dc:creator>Anonymous Coward</dc:creator>
		<pubDate>Fri, 16 Feb 2007 14:28:07 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1340</guid>
		<description>Thank you for your article. Your clarifications reminded of the following remark (paraphrased): &quot;if we ask the customers what they want, they&#039;d ask for a faster horse (instead of a car)&quot;. I don&#039;t know who to attribute this to.</description>
		<content:encoded><![CDATA[<p>Thank you for your article. Your clarifications reminded of the following remark (paraphrased): &#8220;if we ask the customers what they want, they&#8217;d ask for a faster horse (instead of a car)&#8221;. I don&#8217;t know who to attribute this to.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dmitry</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1338</link>
		<dc:creator>Dmitry</dc:creator>
		<pubDate>Fri, 16 Feb 2007 08:20:40 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1338</guid>
		<description>Also I agree with Matteo that improving solution performance of NPC problems is definitely not a niche market. Many of graph problems are NPC.
As a ph.d student who works on natural language processing, I encounter such problems at every point, since for now many language processing algorithms from parsing to semantic processing work on relatively small subgraphs. To improve semantic learning and processing approximations are good but not good enough.

Another domain which is filled with NPC problems is logical inference. Essentially many useful theorems could be proved if we could use such &quot;small&quot; quadratic speedup. For now, logical inference slowly crawls from pure research to practical applications, since it is not easily scalable. If they succeed to find QC algorithms which are quadratically speed up some types of logical inference, there should be a huge marked for this coming from database processing, web search and renewed expert systems.

Cant wait 2 years to see if you indeed succeed to scale it up :)</description>
		<content:encoded><![CDATA[<p>Also I agree with Matteo that improving solution performance of NPC problems is definitely not a niche market. Many of graph problems are NPC.<br />
As a ph.d student who works on natural language processing, I encounter such problems at every point, since for now many language processing algorithms from parsing to semantic processing work on relatively small subgraphs. To improve semantic learning and processing approximations are good but not good enough.</p>
<p>Another domain which is filled with NPC problems is logical inference. Essentially many useful theorems could be proved if we could use such &#8220;small&#8221; quadratic speedup. For now, logical inference slowly crawls from pure research to practical applications, since it is not easily scalable. If they succeed to find QC algorithms which are quadratically speed up some types of logical inference, there should be a huge marked for this coming from database processing, web search and renewed expert systems.</p>
<p>Cant wait 2 years to see if you indeed succeed to scale it up <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dmitry</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1335</link>
		<dc:creator>Dmitry</dc:creator>
		<pubDate>Fri, 16 Feb 2007 04:44:53 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1335</guid>
		<description>&gt; All QC’s could do is solve the problem a bit faster assuming that 
&gt; QC’s ran at the same clock speed

Maybe quadratic speedup is not great for pure theoreticans but it is not a BIT faster, it allows solving problems PRINCIPIALLY unsolvable by any linear-time computers. 
Consider 2^35=34*10^9 - this one easily enumeraged by today&#039;s computer. 
Now consider 2^70=12*10^20.
Even if you multiply current clock speed by 100 and run it on 1000 processors it will not help.
And the difference between 35 and 70 states in NPC problem is extremly significant for many real NPC graph problems.</description>
		<content:encoded><![CDATA[<p>&gt; All QC’s could do is solve the problem a bit faster assuming that<br />
&gt; QC’s ran at the same clock speed</p>
<p>Maybe quadratic speedup is not great for pure theoreticans but it is not a BIT faster, it allows solving problems PRINCIPIALLY unsolvable by any linear-time computers.<br />
Consider 2^35=34*10^9 &#8211; this one easily enumeraged by today&#8217;s computer.<br />
Now consider 2^70=12*10^20.<br />
Even if you multiply current clock speed by 100 and run it on 1000 processors it will not help.<br />
And the difference between 35 and 70 states in NPC problem is extremly significant for many real NPC graph problems.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jeremy</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1333</link>
		<dc:creator>Jeremy</dc:creator>
		<pubDate>Thu, 15 Feb 2007 23:13:06 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1333</guid>
		<description>Your Celera example isn&#039;t a very appropriate one. Celera produced a draft Whole Genome Shotgun of the human genome. There wasn&#039;t any confusion at the time about how long it would take to sequence the genome. The public effort&#039;s goals and timelines were related to producing an accurate and complete genome sequence. Celera&#039;s goal was to produce some amount of coverage over most of the genome.  There were few technological or scientific challenges that need to be overcome to produce a draft genome sequence (even at the time) because by the nature of the product, you ignore the hard or confusing stuff.  For a more current example you can look at the mouse sequencing project which produced a WGS and assembly just over 4 years ago.  Where is the complete mouse sequence? It is just about here now. The WGS approach (Celera) only changes the tyoe of collection to be broad covergae across the genome, rather than deep coverage of a specific portion of the genome in the BAC by BAC approach.  Any let me tell you, if you want a complete genome after you&#039;ve spent the money producing a WGS draft, it is 10-50x the work of producing a complete sequence from a BAC by BAC approach in the first place. This doesn&#039;t mean that WGS isn&#039;t applicable to a wide range of projects and because of the lower percieved cost it is used for many projects today, it just means that WGS is another tool that has its appropriate uses, and the human genome sequence really shouldn&#039;t have been one of them.</description>
		<content:encoded><![CDATA[<p>Your Celera example isn&#8217;t a very appropriate one. Celera produced a draft Whole Genome Shotgun of the human genome. There wasn&#8217;t any confusion at the time about how long it would take to sequence the genome. The public effort&#8217;s goals and timelines were related to producing an accurate and complete genome sequence. Celera&#8217;s goal was to produce some amount of coverage over most of the genome.  There were few technological or scientific challenges that need to be overcome to produce a draft genome sequence (even at the time) because by the nature of the product, you ignore the hard or confusing stuff.  For a more current example you can look at the mouse sequencing project which produced a WGS and assembly just over 4 years ago.  Where is the complete mouse sequence? It is just about here now. The WGS approach (Celera) only changes the tyoe of collection to be broad covergae across the genome, rather than deep coverage of a specific portion of the genome in the BAC by BAC approach.  Any let me tell you, if you want a complete genome after you&#8217;ve spent the money producing a WGS draft, it is 10-50x the work of producing a complete sequence from a BAC by BAC approach in the first place. This doesn&#8217;t mean that WGS isn&#8217;t applicable to a wide range of projects and because of the lower percieved cost it is used for many projects today, it just means that WGS is another tool that has its appropriate uses, and the human genome sequence really shouldn&#8217;t have been one of them.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ValleyProofs &#187; Quantum Computing Demo at the Computer History Museum</title>
		<link>http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1328</link>
		<dc:creator>ValleyProofs &#187; Quantum Computing Demo at the Computer History Museum</dc:creator>
		<pubDate>Thu, 15 Feb 2007 08:26:13 +0000</pubDate>
		<guid isPermaLink="false">http://dwave.wordpress.com/2007/02/01/a-great-question/#comment-1328</guid>
		<description>[...] Here&#8217;s also a link to dwave. So why is not IBM or Intel doing this? Good question read here for a take on [...]</description>
		<content:encoded><![CDATA[<p>[...] Here&#8217;s also a link to dwave. So why is not IBM or Intel doing this? Good question read here for a take on [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
