<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Effectively calculable quantum mechanics · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1508.03879/</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/1508.03879/feed.xml" rel="self" type="application/rss+xml" /><item><title>Effectively calculable quantum mechanics — mentioned by naasking</title><link>https://news.ycombinator.com/item?id=13579310</link><guid isPermaLink="false">urn:hackerpapers:mention:1508.03879:13579310</guid><pubDate>Mon, 06 Feb 2017 13:45:04 GMT</pubDate><description>&lt;p&gt;Which is a property of our formalism, not reality. Any state we&amp;#x27;d care to actually observe necessarily has finite precision, so the internal mechanics of our formalism to model this process utilizing infinities is an artifact only of our formalism, not of reality. Furthermore, quantum computing and classical computing are known to have the same computational power, just different computational complexity, ie. any quantum system can be simulated by a classical system with exponential slowdown, at worst. There are plenty of papers exploring this territory [1,2,3] if you want further details.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1508.03879/"&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>
