<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_0405098/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/quant-ph_0405098/feed.xml" rel="self" type="application/rss+xml" /><item><title>Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation — mentioned by kmckiern</title><link>https://news.ycombinator.com/item?id=24500091</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0405098:24500091</guid><pubDate>Thu, 17 Sep 2020 01:13:03 GMT</pubDate><description>&lt;p&gt;false. https://arxiv.org/abs/quant-ph/0405098&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0405098/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation — mentioned by krastanov</title><link>https://news.ycombinator.com/item?id=10733614</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0405098:10733614</guid><pubDate>Mon, 14 Dec 2015 20:33:21 GMT</pubDate><description>&lt;p&gt;Here is one version of the proof: http://arxiv.org/abs/quant-ph/0405098 This is the original I think: http://arxiv.org/abs/quant-ph/0403090&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0405098/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation — mentioned by michael_nielsen</title><link>https://news.ycombinator.com/item?id=1403171</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0405098:1403171</guid><pubDate>Fri, 04 Jun 2010 01:04:46 GMT</pubDate><description>&lt;p&gt;This has almost certainly only been shown for a restricted class of adiabatic quantum computers. The full adiabatic quantum computing model is equivalent to ordinary quantum computing (http://arxiv.org/abs/quant-ph/0405098 ). If the linked article is literally correct, then that means quantum computers can efficiently solve NP-complete problems if and only if classical computers can efficiently solve NP-complete problems. That may be true, but I&amp;#x27;d be very surprised if someone has proved it. My guess: the paper under discussion probably shows that some particular adiabatic approach to solving…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0405098/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
