<?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 query complexity</title>
	<atom:link href="http://cstheory.blogoverflow.com/2011/07/quantum-query-complexity/feed/" rel="self" type="application/rss+xml" />
	<link>http://cstheory.blogoverflow.com/2011/07/quantum-query-complexity/</link>
	<description>The Theoretical Computer Science Stack Exchange Blog</description>
	<lastBuildDate>Fri, 16 Mar 2012 13:55:29 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Lower bounds by negative adversary method &#171; Stack Exchange Theoretical Computer Science Blog</title>
		<link>http://cstheory.blogoverflow.com/2011/07/quantum-query-complexity/#comment-18</link>
		<dc:creator>Lower bounds by negative adversary method &#171; Stack Exchange Theoretical Computer Science Blog</dc:creator>
		<pubDate>Thu, 04 Aug 2011 00:01:55 +0000</pubDate>
		<guid isPermaLink="false">http://cstheory.blogoverflow.com/?p=18#comment-18</guid>
		<description>&lt;p&gt;[...] time we quantified hardness of answering a question with a quantum computer as the quantum query complexity. We promised that this model would allow us to develop techniques for proving lower bounds. In [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] time we quantified hardness of answering a question with a quantum computer as the quantum query complexity. We promised that this model would allow us to develop techniques for proving lower bounds. In [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Quantized Thoughts &#187; Blog Archive &#187; TCS Community Blog</title>
		<link>http://cstheory.blogoverflow.com/2011/07/quantum-query-complexity/#comment-11</link>
		<dc:creator>Quantized Thoughts &#187; Blog Archive &#187; TCS Community Blog</dc:creator>
		<pubDate>Thu, 21 Jul 2011 14:41:00 +0000</pubDate>
		<guid isPermaLink="false">http://cstheory.blogoverflow.com/?p=18#comment-11</guid>
		<description>&lt;p&gt;[...] went up earlier in the week, but we now have the first technical post, from Artem Kaznatcheev on Quantum Query Complexity. The blog will mix happenings on the CSTheory site (interesting questions or answers that have [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] went up earlier in the week, but we now have the first technical post, from Artem Kaznatcheev on Quantum Query Complexity. The blog will mix happenings on the CSTheory site (interesting questions or answers that have [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: First technical post now up on CSTheory Community Blog &#124; Nanoexplanations</title>
		<link>http://cstheory.blogoverflow.com/2011/07/quantum-query-complexity/#comment-10</link>
		<dc:creator>First technical post now up on CSTheory Community Blog &#124; Nanoexplanations</dc:creator>
		<pubDate>Thu, 21 Jul 2011 14:20:53 +0000</pubDate>
		<guid isPermaLink="false">http://cstheory.blogoverflow.com/?p=18#comment-10</guid>
		<description>&lt;p&gt;[...] first technical post is now up on the CSTheory Community Blog.  It is Quantum Query Complexity, by Artem Kaznatcheev.  Artem is currently working on a followup post on the &#8220;negative [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] first technical post is now up on the CSTheory Community Blog.  It is Quantum Query Complexity, by Artem Kaznatcheev.  Artem is currently working on a followup post on the &#8220;negative [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
<!-- This Quick Cache file was built for (  cstheory.blogoverflow.com/2011/07/quantum-query-complexity/feed/ ) in 0.62437 seconds, on May 20th, 2012 at 1:36 am UTC. -->
<!-- This Quick Cache file will automatically expire ( and be re-built automatically ) on May 20th, 2012 at 1:36 am UTC -->
