<?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: Quantum computing for everyone</title>
	<atom:link href="http://michaelnielsen.org/blog/quantum-computing-for-everyone/feed/" rel="self" type="application/rss+xml" />
	<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/</link>
	<description></description>
	<lastBuildDate>Tue, 09 Mar 2010 22:14:18 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Alexander</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26562</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Wed, 16 Dec 2009 17:16:43 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26562</guid>
		<description>Do You know any application of quantum games or quantum random walks in finance ?</description>
		<content:encoded><![CDATA[<p>Do You know any application of quantum games or quantum random walks in finance ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ali Fasihi</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26554</link>
		<dc:creator>Ali Fasihi</dc:creator>
		<pubDate>Sat, 12 Dec 2009 04:44:15 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26554</guid>
		<description>Dear Prof.Nielsen,

Thanks a lot for your beutiful book.
Please let me know do you have the solution for the problem of your book &quot;Quantum information and quantum computation&quot;?
In case you have I would very appreciate if you possibly let me know how can I get it.

Sincerely your,
Fasihi</description>
		<content:encoded><![CDATA[<p>Dear Prof.Nielsen,</p>
<p>Thanks a lot for your beutiful book.<br />
Please let me know do you have the solution for the problem of your book &#8220;Quantum information and quantum computation&#8221;?<br />
In case you have I would very appreciate if you possibly let me know how can I get it.</p>
<p>Sincerely your,<br />
Fasihi</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alexander</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26503</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Fri, 27 Nov 2009 23:50:34 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26503</guid>
		<description>May I ask  do quantum games reflect the process of evoultion ?</description>
		<content:encoded><![CDATA[<p>May I ask  do quantum games reflect the process of evoultion ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Asko Gabriel Tuurna</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26478</link>
		<dc:creator>Asko Gabriel Tuurna</dc:creator>
		<pubDate>Mon, 23 Nov 2009 10:29:36 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26478</guid>
		<description>I am thinking about &quot;universality&quot;... 

Thay said in 2008 that there exist more than 12 ways to use qubits in quantum computing. 

http://mags.acm.org/communications/200807/?pg=14

But just recenty they announced the first &quot;universal&quot; quantum processor that is cabable to perform whatever computing operation. Before that it was possible to operate only with some algorithms by using qubits.

http://physicsworld.com/cws/article/news/40949

May I ask how do you prefer the QM interpretation, Copenhagen or Everett?</description>
		<content:encoded><![CDATA[<p>I am thinking about &#8220;universality&#8221;&#8230; </p>
<p>Thay said in 2008 that there exist more than 12 ways to use qubits in quantum computing. </p>
<p><a href="http://mags.acm.org/communications/200807/?pg=14" rel="nofollow">http://mags.acm.org/communications/200807/?pg=14</a></p>
<p>But just recenty they announced the first &#8220;universal&#8221; quantum processor that is cabable to perform whatever computing operation. Before that it was possible to operate only with some algorithms by using qubits.</p>
<p><a href="http://physicsworld.com/cws/article/news/40949" rel="nofollow">http://physicsworld.com/cws/article/news/40949</a></p>
<p>May I ask how do you prefer the QM interpretation, Copenhagen or Everett?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ChicagoPat</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26475</link>
		<dc:creator>ChicagoPat</dc:creator>
		<pubDate>Sun, 22 Nov 2009 19:38:42 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26475</guid>
		<description>I&#039;m reminded of Dougla Adam&#039;s description of the discovery of the inifinite improbability drive: &quot;The Infinite Improbability Drive is a wonderful new method of crossing vast intersteller distances in a mere nothingth of a second without all that tedious mucking about in hyperspace.It was discovered by a lucky chance, and then developed into a governable form of propulsion by the Galactic Government&#039;s research team on Damogran.This, briefly, is the story of its discovery.The principle of generating small amounts of finite improbability by simply hooking the logic circuits of a Bambleweeny 57 sub-meson Brain to an atomic vector plotter suspended in a strong Brownian Motion producer (say a nice hot cup of tea) were of course well understood - and such generators were often used to break the ice at parties by making all the molicules in the hostess&#039;s undergarments leap simultaneously one foot to the left, in accordance with the Theory of Indeterminacy.Many respectable physicists said that they weren&#039;t going to stand for this - partly because it was a debasement of science, but mostly because they didn&#039;t get invited to those sort of parties.Another thing they couldn&#039;t stand was the perpetual failure they encountered in trying to construct a machine which could generate the infinite improbability field needed to flip a spaceship across the mind-paralysing distances between the furthest stars, and in the end they grumpily announced that such a machine was virtually imposssible.Then, one day, a student who had been left to sweep up the lab after a particulary unsuccessful party found himself reasoning this way:If, he thought to himself, such amachine is a virtual impossibility, then it must logically be a finite improbability. So all I have to do in order to make one, is to work out exactly how improbable it is, feed that figure into the finite improbability generator, give it a fresh cup of really hot tea ... and turn it on!He did this, and was rather startled to discover that he had managed to create the long sought after golden Infinite Improbability generater out of thin air.It startled him even more when just after he was awarded the Galactic Institute&#039;s Prize for Extreme Cleverness he got lynced by a rampaging mob of respectable physicists who had finally realized that the one thing they really couldn&#039;t stand was a smartass.&quot;</description>
		<content:encoded><![CDATA[<p>I&#8217;m reminded of Dougla Adam&#8217;s description of the discovery of the inifinite improbability drive: &#8220;The Infinite Improbability Drive is a wonderful new method of crossing vast intersteller distances in a mere nothingth of a second without all that tedious mucking about in hyperspace.It was discovered by a lucky chance, and then developed into a governable form of propulsion by the Galactic Government&#8217;s research team on Damogran.This, briefly, is the story of its discovery.The principle of generating small amounts of finite improbability by simply hooking the logic circuits of a Bambleweeny 57 sub-meson Brain to an atomic vector plotter suspended in a strong Brownian Motion producer (say a nice hot cup of tea) were of course well understood &#8211; and such generators were often used to break the ice at parties by making all the molicules in the hostess&#8217;s undergarments leap simultaneously one foot to the left, in accordance with the Theory of Indeterminacy.Many respectable physicists said that they weren&#8217;t going to stand for this &#8211; partly because it was a debasement of science, but mostly because they didn&#8217;t get invited to those sort of parties.Another thing they couldn&#8217;t stand was the perpetual failure they encountered in trying to construct a machine which could generate the infinite improbability field needed to flip a spaceship across the mind-paralysing distances between the furthest stars, and in the end they grumpily announced that such a machine was virtually imposssible.Then, one day, a student who had been left to sweep up the lab after a particulary unsuccessful party found himself reasoning this way:If, he thought to himself, such amachine is a virtual impossibility, then it must logically be a finite improbability. So all I have to do in order to make one, is to work out exactly how improbable it is, feed that figure into the finite improbability generator, give it a fresh cup of really hot tea &#8230; and turn it on!He did this, and was rather startled to discover that he had managed to create the long sought after golden Infinite Improbability generater out of thin air.It startled him even more when just after he was awarded the Galactic Institute&#8217;s Prize for Extreme Cleverness he got lynced by a rampaging mob of respectable physicists who had finally realized that the one thing they really couldn&#8217;t stand was a smartass.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Nielsen</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26383</link>
		<dc:creator>Michael Nielsen</dc:creator>
		<pubDate>Sun, 15 Nov 2009 14:46:42 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26383</guid>
		<description>Pau Velando - I don&#039;t know of any application of quantum computing yet in this vein (e.g., data mining).</description>
		<content:encoded><![CDATA[<p>Pau Velando &#8211; I don&#8217;t know of any application of quantum computing yet in this vein (e.g., data mining).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pau Velando &#62; Applied QC</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26368</link>
		<dc:creator>Pau Velando &#62; Applied QC</dc:creator>
		<pubDate>Thu, 12 Nov 2009 12:19:15 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26368</guid>
		<description>Thanks for these &quot;simple&quot; explanations. Although I have an engineering background I can&#039;t easily manage the mathematicae behind QC and it seems to me that there might be huge opportunities applying QC to business information systems.

I am a business consultant and usually deal with dataming problems and stochastic rules for managing complex business processes. Any advance on these fields based on QC? I can roughly imagine &quot;unimaginable&quot; possibilities: management of huge amounts of unstructured data, simulation of thousands of business scenarios with just a mouse-click...

Further explanations, blogs or papers with regard to these issues would be very welcome. Thanks in advance!</description>
		<content:encoded><![CDATA[<p>Thanks for these &#8220;simple&#8221; explanations. Although I have an engineering background I can&#8217;t easily manage the mathematicae behind QC and it seems to me that there might be huge opportunities applying QC to business information systems.</p>
<p>I am a business consultant and usually deal with dataming problems and stochastic rules for managing complex business processes. Any advance on these fields based on QC? I can roughly imagine &#8220;unimaginable&#8221; possibilities: management of huge amounts of unstructured data, simulation of thousands of business scenarios with just a mouse-click&#8230;</p>
<p>Further explanations, blogs or papers with regard to these issues would be very welcome. Thanks in advance!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Nielsen</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26333</link>
		<dc:creator>Michael Nielsen</dc:creator>
		<pubDate>Thu, 05 Nov 2009 19:56:46 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26333</guid>
		<description>Sam Kohn - The links to the lectures should now be fixed.</description>
		<content:encoded><![CDATA[<p>Sam Kohn &#8211; The links to the lectures should now be fixed.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sam Kohn</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26322</link>
		<dc:creator>Sam Kohn</dc:creator>
		<pubDate>Fri, 30 Oct 2009 18:58:29 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26322</guid>
		<description>Will the Introductory lecture notes on quantum information and computation be made available again.

Sam Kohn</description>
		<content:encoded><![CDATA[<p>Will the Introductory lecture notes on quantum information and computation be made available again.</p>
<p>Sam Kohn</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alexander</title>
		<link>http://michaelnielsen.org/blog/quantum-computing-for-everyone/comment-page-1/#comment-26035</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Sat, 12 Sep 2009 14:58:32 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=459#comment-26035</guid>
		<description>Dear Mr. Nielsen,

Is the statement &#039;Quantum information theory is generalisation of classical Information theory&#039; scientific fact or just something  what is believed in and needs a proof ? If it is proven, which scientific method is used (mathematical, physical or their combination) ?

With highest respect,
Alexander</description>
		<content:encoded><![CDATA[<p>Dear Mr. Nielsen,</p>
<p>Is the statement &#8216;Quantum information theory is generalisation of classical Information theory&#8217; scientific fact or just something  what is believed in and needs a proof ? If it is proven, which scientific method is used (mathematical, physical or their combination) ?</p>
<p>With highest respect,<br />
Alexander</p>
]]></content:encoded>
	</item>
</channel>
</rss>
