<?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 for Quantum Bayesian Networks</title>
	<atom:link href="http://qbnets.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://qbnets.wordpress.com</link>
	<description></description>
	<lastBuildDate>Wed, 11 Nov 2009 16:48:19 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Useful Quantum Computers Are 200 Years Away by Geordie</title>
		<link>http://qbnets.wordpress.com/2009/11/10/useful-quantum-computers-wont-be-built-for-another-200-years/#comment-203</link>
		<dc:creator>Geordie</dc:creator>
		<pubDate>Wed, 11 Nov 2009 16:48:19 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1675#comment-203</guid>
		<description>Hi Bob

I can guarantee with 100% certainty that your timing estimate is wrong :)</description>
		<content:encoded><![CDATA[<p>Hi Bob</p>
<p>I can guarantee with 100% certainty that your timing estimate is wrong <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The MCMC Revolution by physicsandcake</title>
		<link>http://qbnets.wordpress.com/2009/10/28/the-mcmc-revolution/#comment-196</link>
		<dc:creator>physicsandcake</dc:creator>
		<pubDate>Thu, 29 Oct 2009 09:32:31 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1542#comment-196</guid>
		<description>Looks very interesting, thanks. I&#039;ll have a read over lunch :)</description>
		<content:encoded><![CDATA[<p>Looks very interesting, thanks. I&#8217;ll have a read over lunch <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on New Quantum Computer Algorithm is So-so by Jack Woehr</title>
		<link>http://qbnets.wordpress.com/2009/10/19/new-quantum-computer-algorithm-is-so-so/#comment-191</link>
		<dc:creator>Jack Woehr</dc:creator>
		<pubDate>Sun, 25 Oct 2009 04:44:30 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1482#comment-191</guid>
		<description>I vote for Prof. Moriarty since he is Conan Doyle&#039;s Schroedinger&#039;s Cat.</description>
		<content:encoded><![CDATA[<p>I vote for Prof. Moriarty since he is Conan Doyle&#8217;s Schroedinger&#8217;s Cat.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quantum Cryptography, Why Do We Fund It? by rrtucci</title>
		<link>http://qbnets.wordpress.com/2008/10/17/quantum-cryptography-why-do-we-fund-it/#comment-189</link>
		<dc:creator>rrtucci</dc:creator>
		<pubDate>Thu, 15 Oct 2009 19:36:09 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=325#comment-189</guid>
		<description>See also my more recent post:

&lt;a href=&quot;http://qbnets.wordpress.com/2009/08/29/quantum-internet-snake-oil/&quot; rel=&quot;nofollow&quot;&gt;Quantum Internet Snake Oil&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>See also my more recent post:</p>
<p><a href="http://qbnets.wordpress.com/2009/08/29/quantum-internet-snake-oil/" rel="nofollow">Quantum Internet Snake Oil</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quantum Cryptography Snake Oil by rrtucci</title>
		<link>http://qbnets.wordpress.com/2009/06/26/quantum-cryptography-snakeoil/#comment-152</link>
		<dc:creator>rrtucci</dc:creator>
		<pubDate>Mon, 07 Sep 2009 20:11:20 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1016#comment-152</guid>
		<description>Tae, I disagree with Dan Simon. An area of quantum computing that interests me greatly is the use of a quantum computer to do MCMC. Dan Simon doesn&#039;t seem to be aware of very encouraging discoveries that have been made in that area. My objections to quantum crypto are based on an important fact; namely, that there are known classical cryptographic codes that cannot be broken by a quantum computer. Dan Simon&#039;s objections to quantum computing seem to be merely his own personal predictions of the future.</description>
		<content:encoded><![CDATA[<p>Tae, I disagree with Dan Simon. An area of quantum computing that interests me greatly is the use of a quantum computer to do MCMC. Dan Simon doesn&#8217;t seem to be aware of very encouraging discoveries that have been made in that area. My objections to quantum crypto are based on an important fact; namely, that there are known classical cryptographic codes that cannot be broken by a quantum computer. Dan Simon&#8217;s objections to quantum computing seem to be merely his own personal predictions of the future.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quantum Cryptography Snake Oil by Tae Song</title>
		<link>http://qbnets.wordpress.com/2009/06/26/quantum-cryptography-snakeoil/#comment-151</link>
		<dc:creator>Tae Song</dc:creator>
		<pubDate>Mon, 07 Sep 2009 18:37:55 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1016#comment-151</guid>
		<description>http://www.networkworld.com/weblogs/security/004842.html
&quot;Comprehending quantum crypto is not for the weak. It&#039;s said not to be quantum computing but is part of quantum mechanics.&quot;

http://www.educatedguesswork.org/2009/03/dan_simon_on_quantum_crypto.html
&quot;Basically, there is one thing that quantum computers have been found to be capable of doing much better than classical computers. That one thing has been characterized variously as &quot;finding hidden subgroups&quot;, &quot;solving the abelian stabilizer problem&quot;, or &quot;finding periodicities in abelian groups&quot;. Because this one thing happens to lead to polynomial-time algorithms for integer factoring and discrete log, quantum computers have been bandied about as an incredible new computing technology, but the truth is that this one thing is really very limited in scope, and in a decade and a half, nobody&#039;s found another significant application for it.

Moreover, there are lots of (admittedly informal) reasons for believing that quantum computers can&#039;t really do anything interesting beyond this one thing. So we&#039;re left with a technology that, even if perfected*, is unlikely to be able to accomplish anything of interest beyond solving a certain narrow class of number theory problems.**&quot;</description>
		<content:encoded><![CDATA[<p><a href="http://www.networkworld.com/weblogs/security/004842.html" rel="nofollow">http://www.networkworld.com/weblogs/security/004842.html</a><br />
&#8220;Comprehending quantum crypto is not for the weak. It&#8217;s said not to be quantum computing but is part of quantum mechanics.&#8221;</p>
<p><a href="http://www.educatedguesswork.org/2009/03/dan_simon_on_quantum_crypto.html" rel="nofollow">http://www.educatedguesswork.org/2009/03/dan_simon_on_quantum_crypto.html</a><br />
&#8220;Basically, there is one thing that quantum computers have been found to be capable of doing much better than classical computers. That one thing has been characterized variously as &#8220;finding hidden subgroups&#8221;, &#8220;solving the abelian stabilizer problem&#8221;, or &#8220;finding periodicities in abelian groups&#8221;. Because this one thing happens to lead to polynomial-time algorithms for integer factoring and discrete log, quantum computers have been bandied about as an incredible new computing technology, but the truth is that this one thing is really very limited in scope, and in a decade and a half, nobody&#8217;s found another significant application for it.</p>
<p>Moreover, there are lots of (admittedly informal) reasons for believing that quantum computers can&#8217;t really do anything interesting beyond this one thing. So we&#8217;re left with a technology that, even if perfected*, is unlikely to be able to accomplish anything of interest beyond solving a certain narrow class of number theory problems.**&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quantum (Zeno, Anti-Zeno, Hamlet) Effects by rrtucci</title>
		<link>http://qbnets.wordpress.com/2009/08/25/quantum-zeno-anti-zeno-hamlet-effects/#comment-144</link>
		<dc:creator>rrtucci</dc:creator>
		<pubDate>Fri, 28 Aug 2009 18:27:47 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1247#comment-144</guid>
		<description>Product of squared cosines. Very true, Chris.</description>
		<content:encoded><![CDATA[<p>Product of squared cosines. Very true, Chris.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quantum (Zeno, Anti-Zeno, Hamlet) Effects by Chris B</title>
		<link>http://qbnets.wordpress.com/2009/08/25/quantum-zeno-anti-zeno-hamlet-effects/#comment-143</link>
		<dc:creator>Chris B</dc:creator>
		<pubDate>Fri, 28 Aug 2009 14:01:22 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1247#comment-143</guid>
		<description>... and even if one might be able to perform the measurements in the proposed way, it is clear that the obtained effect is directly introduced by the performed approximations, as what is being calculated/approximated is nothing else than an infinite product of squared cosines(!), which of course cannot diverge. The divergence is just an artefact from the Taylor expansion &amp; the special construction of the time-intervals. I think calculated correctly to product should converge towards 0. The problem with Pankovic&#039;s approximation of course is, that the product of the approximations is not an approximation of the product.</description>
		<content:encoded><![CDATA[<p>&#8230; and even if one might be able to perform the measurements in the proposed way, it is clear that the obtained effect is directly introduced by the performed approximations, as what is being calculated/approximated is nothing else than an infinite product of squared cosines(!), which of course cannot diverge. The divergence is just an artefact from the Taylor expansion &amp; the special construction of the time-intervals. I think calculated correctly to product should converge towards 0. The problem with Pankovic&#8217;s approximation of course is, that the product of the approximations is not an approximation of the product.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The X-Prize for Quantum Computing, Why Not? by Jack Woehr</title>
		<link>http://qbnets.wordpress.com/2009/08/23/the-x-prize-for-quantum-computing-why-not/#comment-141</link>
		<dc:creator>Jack Woehr</dc:creator>
		<pubDate>Mon, 24 Aug 2009 13:35:54 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1213#comment-141</guid>
		<description>No problem, and thanks. Love your idea of an X-Prize. That might stir things up. Went and read the proposer pages, and apparently the app form to propose an X-Prize sort of assumes that the proposer is going to kick in some funding!</description>
		<content:encoded><![CDATA[<p>No problem, and thanks. Love your idea of an X-Prize. That might stir things up. Went and read the proposer pages, and apparently the app form to propose an X-Prize sort of assumes that the proposer is going to kick in some funding!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The X-Prize for Quantum Computing, Why Not? by rrtucci</title>
		<link>http://qbnets.wordpress.com/2009/08/23/the-x-prize-for-quantum-computing-why-not/#comment-140</link>
		<dc:creator>rrtucci</dc:creator>
		<pubDate>Mon, 24 Aug 2009 13:16:52 +0000</pubDate>
		<guid isPermaLink="false">http://qbnets.wordpress.com/?p=1213#comment-140</guid>
		<description>Sorry Jack. I now realize that my intro was &quot;putting words in your mouth&quot;. I rewrote the intro of the blog post so as to more clearly separate your opinions from mine.</description>
		<content:encoded><![CDATA[<p>Sorry Jack. I now realize that my intro was &#8220;putting words in your mouth&#8221;. I rewrote the intro of the blog post so as to more clearly separate your opinions from mine.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
