<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Automated Search for new Quantum Experiments · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1509.02749/</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/1509.02749/feed.xml" rel="self" type="application/rss+xml" /><item><title>Automated Search for new Quantum Experiments — mentioned by gus_massa</title><link>https://news.ycombinator.com/item?id=27731939</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.02749:27731939</guid><pubDate>Sun, 04 Jul 2021 19:19:41 GMT</pubDate><description>&lt;p&gt;Research paper: https://arxiv.org/pdf/1509.02749.pdf The algorithm is not very clear. Is the code available? It looks like a mix of randomized brute force, with some heuristic to keep some &amp;quot;interesting&amp;quot; examples. From the article: &amp;gt; S7) Learning algorithm &amp;gt; In the second example involving cyclic operations, the algorithm extends its own set of basic elements autonomously, based on the properties of the longest cycle. It saves elements that have large cycles and experiments with non-trivial coupling between different degrees-of-freedom. Additionally, elements already learned can be forgotten…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.02749/"&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>
