<?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/"
		>
<channel>
	<title>Comments on: How to build a million-qubit quantum computer</title>
	<atom:link href="http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/feed" rel="self" type="application/rss+xml" />
	<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer</link>
	<description>Accelerating Intelligence</description>
	<lastBuildDate>Thu, 20 Jun 2013 09:23:34 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.1</generator>
	<item>
		<title>By: libra9</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-84242</link>
		<dc:creator>libra9</dc:creator>
		<pubDate>Sat, 05 Jan 2013 17:52:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-84242</guid>
		<description>Sorry, that is &quot;tim&quot; the realist.</description>
		<content:encoded><![CDATA[<p>Sorry, that is &#8220;tim&#8221; the realist.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: libra9</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-84241</link>
		<dc:creator>libra9</dc:creator>
		<pubDate>Sat, 05 Jan 2013 17:51:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-84241</guid>
		<description>I am impressed with the sophistication and civility of the dialogue between GAUSS and time the realist.

Perhaps there IS some hope for mankind.</description>
		<content:encoded><![CDATA[<p>I am impressed with the sophistication and civility of the dialogue between GAUSS and time the realist.</p>
<p>Perhaps there IS some hope for mankind.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GAUSS</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-63574</link>
		<dc:creator>GAUSS</dc:creator>
		<pubDate>Thu, 06 Dec 2012 18:02:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-63574</guid>
		<description>Ok, I see.  You&#039;re essentially describing quantum Monte Carlo methods.  It could work, you&#039;d just never know if you had *the* optimal solution unless you had a purely deterministic quantum computer (functionally 100% accurate).  Even so, it&#039;s a great idea, and one worth exploring. :)</description>
		<content:encoded><![CDATA[<p>Ok, I see.  You&#8217;re essentially describing quantum Monte Carlo methods.  It could work, you&#8217;d just never know if you had *the* optimal solution unless you had a purely deterministic quantum computer (functionally 100% accurate).  Even so, it&#8217;s a great idea, and one worth exploring. :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tim the realist</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-63408</link>
		<dc:creator>tim the realist</dc:creator>
		<pubDate>Thu, 06 Dec 2012 13:27:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-63408</guid>
		<description>You are missing the point.
Traveling slaesman is exactly the type of problem that only requires a 1% accuracy ot be successful. Only run 10,000 times on a quantum computer and pick out the best path it comes up with.  With 10,000 answers from the quantum computer with a 1% chance any one of them is actually correct there is only a 2.24877E-44 probability you won&#039;t have the absolute best answer contained within the answer set.  Going up to 1,000,000 or so runs lower the probability so low that it basically can&#039;t happen. This is close enough for the best solution from the data set to be used as the actual solution for these type of problems</description>
		<content:encoded><![CDATA[<p>You are missing the point.<br />
Traveling slaesman is exactly the type of problem that only requires a 1% accuracy ot be successful. Only run 10,000 times on a quantum computer and pick out the best path it comes up with.  With 10,000 answers from the quantum computer with a 1% chance any one of them is actually correct there is only a 2.24877E-44 probability you won&#8217;t have the absolute best answer contained within the answer set.  Going up to 1,000,000 or so runs lower the probability so low that it basically can&#8217;t happen. This is close enough for the best solution from the data set to be used as the actual solution for these type of problems</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GAUSS</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-63213</link>
		<dc:creator>GAUSS</dc:creator>
		<pubDate>Thu, 06 Dec 2012 07:17:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-63213</guid>
		<description>Ex: Traveling Salesman Problem.  A quantum computer would likely be very good at this, but it would take most classical computers on the order of several million years to check a calculation.  There are proofs for this, but I won&#039;t invoke them here. ;)</description>
		<content:encoded><![CDATA[<p>Ex: Traveling Salesman Problem.  A quantum computer would likely be very good at this, but it would take most classical computers on the order of several million years to check a calculation.  There are proofs for this, but I won&#8217;t invoke them here. ;)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: YeahYeahYeah</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62951</link>
		<dc:creator>YeahYeahYeah</dc:creator>
		<pubDate>Wed, 05 Dec 2012 22:57:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62951</guid>
		<description>Anthrobotic, this guy disagrees with you: http://www.technologyreview.com/view/508246/why-the-universe-is-not-a-computer-after-all/</description>
		<content:encoded><![CDATA[<p>Anthrobotic, this guy disagrees with you: <a href="http://www.technologyreview.com/view/508246/why-the-universe-is-not-a-computer-after-all/" rel="nofollow">http://www.technologyreview.com/view/508246/why-the-universe-is-not-a-computer-after-all/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tim the realist</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62851</link>
		<dc:creator>tim the realist</dc:creator>
		<pubDate>Wed, 05 Dec 2012 19:55:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62851</guid>
		<description>Please provide an example where a classical computer cannot verify if one proposed solution to a computational problem is &quot;better&quot; than another.  &quot;Better&quot; may mean more precise, shorter path, lower cost, etc.  

Usually the number of possible solutions to an NP problem is very large and requires checking all of them to find the best.  

Using a low reilability quantum computer to provide a set of possible answers to check can quickly reduce the size of the solution space.</description>
		<content:encoded><![CDATA[<p>Please provide an example where a classical computer cannot verify if one proposed solution to a computational problem is &#8220;better&#8221; than another.  &#8220;Better&#8221; may mean more precise, shorter path, lower cost, etc.  </p>
<p>Usually the number of possible solutions to an NP problem is very large and requires checking all of them to find the best.  </p>
<p>Using a low reilability quantum computer to provide a set of possible answers to check can quickly reduce the size of the solution space.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GAUSS</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62719</link>
		<dc:creator>GAUSS</dc:creator>
		<pubDate>Wed, 05 Dec 2012 16:14:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62719</guid>
		<description>After a certain point, you wouldn&#039;t be able to use classical computers to verify any answers.  The problems, especially in discrete optimization, just get too big for any i7, GPU, or otherwise. :(</description>
		<content:encoded><![CDATA[<p>After a certain point, you wouldn&#8217;t be able to use classical computers to verify any answers.  The problems, especially in discrete optimization, just get too big for any i7, GPU, or otherwise. :(</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tim the realist</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62594</link>
		<dc:creator>tim the realist</dc:creator>
		<pubDate>Wed, 05 Dec 2012 13:13:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62594</guid>
		<description>Can anyone explain to me why reliability is so important in these types of computing architectures?   My understanding is that this type of computer would be used primarily for NP type problems.

Why can&#039;t these architectures simply be scaled up at the cost of reliability and have the program run multiple times.  If it&#039;s right ~1% of the time, then that should be plenty good enough to use classical computers to analyse thousands or millions of result states to see if they are any better than standard classical solutions.

Factoring large numbers for instance is easy to check potential answers.  So if you get hundreds or thousands of potential answers they can all be quickly checked using classical architecture to identify the final correct solution.  Many NP problems are like this.</description>
		<content:encoded><![CDATA[<p>Can anyone explain to me why reliability is so important in these types of computing architectures?   My understanding is that this type of computer would be used primarily for NP type problems.</p>
<p>Why can&#8217;t these architectures simply be scaled up at the cost of reliability and have the program run multiple times.  If it&#8217;s right ~1% of the time, then that should be plenty good enough to use classical computers to analyse thousands or millions of result states to see if they are any better than standard classical solutions.</p>
<p>Factoring large numbers for instance is easy to check potential answers.  So if you get hundreds or thousands of potential answers they can all be quickly checked using classical architecture to identify the final correct solution.  Many NP problems are like this.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anthrobotic</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62075</link>
		<dc:creator>anthrobotic</dc:creator>
		<pubDate>Wed, 05 Dec 2012 00:52:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62075</guid>
		<description>Apologies, mistaken link in comment #2. For the correct link to a simulation theory piece with a dusting of quantum mechanics/computing flavor: http://goo.gl/ZD9cJ</description>
		<content:encoded><![CDATA[<p>Apologies, mistaken link in comment #2. For the correct link to a simulation theory piece with a dusting of quantum mechanics/computing flavor: <a href="http://goo.gl/ZD9cJ" rel="nofollow">http://goo.gl/ZD9cJ</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anthrobotic</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-62072</link>
		<dc:creator>anthrobotic</dc:creator>
		<pubDate>Wed, 05 Dec 2012 00:50:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-62072</guid>
		<description>AHHHHHH!!  WRONG LINK!!!
Apologies. For the correct link to a simulation theory piece: http://goo.gl/ZD9cJ</description>
		<content:encoded><![CDATA[<p>AHHHHHH!!  WRONG LINK!!!<br />
Apologies. For the correct link to a simulation theory piece: <a href="http://goo.gl/ZD9cJ" rel="nofollow">http://goo.gl/ZD9cJ</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: eldras</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-61881</link>
		<dc:creator>eldras</dc:creator>
		<pubDate>Tue, 04 Dec 2012 18:44:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-61881</guid>
		<description>Planck (inventor of quantum theory) was a crackpot who believed there was a divine intelligence controlling everything. we dont know much about QT and are using trial and error a lot.</description>
		<content:encoded><![CDATA[<p>Planck (inventor of quantum theory) was a crackpot who believed there was a divine intelligence controlling everything. we dont know much about QT and are using trial and error a lot.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GAUSS</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-61824</link>
		<dc:creator>GAUSS</dc:creator>
		<pubDate>Tue, 04 Dec 2012 17:23:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-61824</guid>
		<description>Not a cat lady! Noooooo!</description>
		<content:encoded><![CDATA[<p>Not a cat lady! Noooooo!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anthrobotic</title>
		<link>http://www.kurzweilai.net/how-to-build-a-million-qubit-quantum-computer/comment-page-1#comment-61756</link>
		<dc:creator>anthrobotic</dc:creator>
		<pubDate>Tue, 04 Dec 2012 15:43:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.kurzweilai.net/?p=172881#comment-61756</guid>
		<description>With advances in quantum computing, possible &quot;pixelation&quot; of the universe, and some supremely annoying probability, seems reality most likely is a computer simulation.

God, an intensely needy &amp; cosmically powerful cat lady, is just playing the latest release of &quot;Semi-Conscious Hairless Primates.&quot;

Yep. 
More: http://goo.gl/2wkcN


-Reno at Anthrobotic.com</description>
		<content:encoded><![CDATA[<p>With advances in quantum computing, possible &#8220;pixelation&#8221; of the universe, and some supremely annoying probability, seems reality most likely is a computer simulation.</p>
<p>God, an intensely needy &amp; cosmically powerful cat lady, is just playing the latest release of &#8220;Semi-Conscious Hairless Primates.&#8221;</p>
<p>Yep.<br />
More: <a href="http://goo.gl/2wkcN" rel="nofollow">http://goo.gl/2wkcN</a></p>
<p>-Reno at Anthrobotic.com</p>
]]></content:encoded>
	</item>
</channel>
</rss>
