<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficient estimation of Pauli observables by derandomization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2103.07510/</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/2103.07510/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficient estimation of Pauli observables by derandomization — mentioned by akasakahakada</title><link>https://news.ycombinator.com/item?id=36641567</link><guid isPermaLink="false">urn:hackerpapers:mention:2103.07510:36641567</guid><pubDate>Sat, 08 Jul 2023 05:22:44 GMT</pubDate><description>&lt;p&gt;Read a paper with few hundreds of cites. They proposed a new algorithm to solve eigenvalue problem. I look at it, decrypt the equations, and then notice that it is just basically a bunch of if-then condition like this: count = 0 for x in list: if x == 1: count +=1 if count != 0: return 3 else: return 1 Everything is simple, they try too hard to make things look mathematically rigorous but turn out stupid. if you want to see how cryptic it is: https://arxiv.org/abs/2103.07510&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2103.07510/"&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>
