<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress.com" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>quantum-information-science &amp;laquo; WordPress.com Tag Feed</title>
	<link>http://en.wordpress.com/tag/quantum-information-science/</link>
	<description>Feed of posts on WordPress.com tagged "quantum-information-science"</description>
	<pubDate>Thu, 03 Dec 2009 10:36:55 +0000</pubDate>

	<generator>http://en.wordpress.com/tags/</generator>
	<language>en</language>

<item>
<title><![CDATA[Quantum coherence in photosynthetic complexes.]]></title>
<link>http://alan.aspuru.com/2009/05/05/quantum-coherence-in-photosynthetic-complexes/</link>
<pubDate>Wed, 06 May 2009 03:40:08 +0000</pubDate>
<dc:creator>aspuru</dc:creator>
<guid>http://alan.aspuru.com/2009/05/05/quantum-coherence-in-photosynthetic-complexes/</guid>
<description><![CDATA[A discusion of our work on quantum coherence has appeared in Shtetl Optimized, Scott Aaronson&#8217;]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>A discusion of our work on quantum coherence has appeared in <a href="http://scottaaronson.com/blog/?p=401">Shtetl Optimized</a>, Scott Aaronson&#8217;s blog. It was a lot of fun to present it at the last quantum information workshop organized by John Preskill. It was great to be able to share our results and also to provide an overview of the area of quantum computing and chemistry. In any case, I have to revive my own blog, that is a quite slow site. The action is mostly happening off it, every day in the lab with the great team of people that I get to &#8220;play in the blackboard&#8221; everyday with.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[A versatile quantum information scientist.]]></title>
<link>http://alan.aspuru.com/2008/09/07/a-versatile-quantum-information-scientist/</link>
<pubDate>Mon, 08 Sep 2008 01:36:54 +0000</pubDate>
<dc:creator>aspuru</dc:creator>
<guid>http://alan.aspuru.com/2008/09/07/a-versatile-quantum-information-scientist/</guid>
<description><![CDATA[I came to visit Dr. Marco Lanzagorta, a scientist from the Naval Reserach Lab who works on quantum i]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>I came to visit <a href="http://portal.acm.org/author_page.cfm?id=81100161363">Dr. Marco Lanzagorta</a>, a scientist from the Naval Reserach Lab who works on quantum information and other scientific computing topics. He&#8217;s also a Mexican working in the field. We had a good lunch, where he told me something that confirmed to me that quantum information scientists are great, creative people.</p>
<p>He and his friend <a href="http://www.cs.missouri.edu/index.php/Jeffrey-Uhlmann.html">Jeffrey Uhlmann</a> were intimately involved in the design, acting and development of the movie <a href="http://mmvsam.com">Mil Máscaras vs. the Aztec Mummy</a>. I&#8217;ll leave it as an exercise to the reader to find Marco in the  photo gallery for the movie.</p>
<p>Marco is going to lend me his copy, and I will try to have it screened with my group and friends, so they  too will be inspired by what quantum computer scientists can do in this world.</p>
<div id="attachment_22" class="wp-caption alignnone" style="width: 510px"><a href="http://aspuru.wordpress.com/files/2008/09/luchadorcharge_640_jpg.jpg"><img class="size-full wp-image-22" title="luchadorcharge_640_jpg" src="http://aspuru.wordpress.com/files/2008/09/luchadorcharge_640_jpg.jpg" alt="Luchadores al ataque!" width="500" height="235" /></a><p class="wp-caption-text">Luchadores al ataque!</p></div>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Quantum Monte Carlo for Adiabatic Quantum Computation]]></title>
<link>http://alan.aspuru.com/2008/06/11/quantum-monte-carlo-for-adiabatic-quantum-computation/</link>
<pubDate>Wed, 11 Jun 2008 03:10:02 +0000</pubDate>
<dc:creator>aspuru</dc:creator>
<guid>http://alan.aspuru.com/2008/06/11/quantum-monte-carlo-for-adiabatic-quantum-computation/</guid>
<description><![CDATA[It has been a while (almost a semester) since I last attended the excellent quantum computing group ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>It has been a while (almost a semester) since I last attended the excellent quantum computing group meetings organized by <a href="http://web.mit.edu/physics/facultyandstaff/faculty/edward_farhi.html">Eddie Farhi</a>. Many people from the Boston Area interested in quantum computing meet weekly at the institute for theoretical physics at MIT. These meetings have been important for my lab to remain connected with the quantum information community. There, I met Stephen Jordan and Seth Lloyd, who are now collaborators and co-authors on a few papers. I plan to attend as many meetings as I can from now on, when I am not on travel (next Monday, I will be in Urbana-Champaign). This semester, my laboratory took off with even more momentum, and I have been busy with in-house things, which has forced me to miss these meetings at MIT for one reason or other. Most often, it has been because we had been meeting with the DARPA SERS team (Ken Crozier and Eric Mazur).</p>
<p>Yesterday, <a href="http://http://physics.ucsc.edu/~peter/">Peter Young</a>, from UC Santa Cruz&#8217;s Physics department gave a talk about the <a href="http://complexity of the adiabatic quantum algorithm">complexity of the adiabatic quantum algorithm</a><a href="http://physics.ucsc.edu/~peter/talks/MIT.pdf"> (&#60;- click to download his slides)</a>. The <a href="http://www.qmcwiki.org/index.php/Quantum_Monte_Carlo_Wiki_Home">quantum Monte Carlo</a> (QMC) algorithm allowed him to test the gap for typical instances of the <a href="http://en.wikipedia.org/wiki/Exact_cover">exact cover</a> NP-hard problem for up to 128 spins. Peter Young and his co-authors found that up to 128 spins, the scaling is still polynomial. For classical algorithms like WALKSAT, he found a crossover from polynomial to exponential. The open question, of course, is if the adiabatic algorithm will have a cross over at a certain size. He is working on extending his QMC calculations to 256 spins. Hopefully,  it still has an advantage for that size.</p>
<p>This talk connects two of my interests: quantum information and quantum Monte Carlo.</p>
<p><strong>More QMC news:</strong> <a href="http://aspuru.chem.harvard.edu/People/Sangwoo_Shim/">Sangwoo Shim</a>, a graduate student in my laboratory, is gearing up to become our local Harvard Chemistry QMC expert, and he is attending <a href="http://www.vallico.net/tti/master.html?http://www.vallico.net/tti/qmcatcp_08/announcement.html">The Towler Institute Summer School of Quantum Monte Carlo</a>, organized by <a href="http://www.tcm.phy.cam.ac.uk/~mdt26/">Mike Towler</a>. Mike&#8217;s conferences are <strong>excellent.</strong> I had great fun at the TTI conference last year (as for example, <a href="http://www.tcm.phy.cam.ac.uk/~mdt26/tti_07_photos/TTI_Summer_2007/142.jpg">this photo</a> or <a href="http://www.tcm.phy.cam.ac.uk/~mdt26/tti_07_photos/TTI_Summer_2007/236.jpg">this one</a> attest), and plan to attend it bi-yearly to stay abreast with the field. Also, I saw the source code of what will soon become <a href="http://www.zori-code.com">Zori</a> 2.0. <a href="http://www.cchem.berkeley.edu/walgrp/brian.html">Brian Austin</a> did an excellent job and I am excited of trying it out. We are using <a href="http://assembla.com">Assembla.com</a> for most of our projects, and we love it. Zori 2.0 will be hosted using that service.</p>
<p><strong>Link:</strong> <a href="http://quantum_mc.blogspot.com/">Mark Dewing&#8217;s Quantum Monte Carlo blog</a>.</p>
</div>]]></content:encoded>
</item>

</channel>
</rss>
