<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2104.05122/</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/2104.05122/feed.xml" rel="self" type="application/rss+xml" /><item><title>Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem — mentioned by ehvatum</title><link>https://news.ycombinator.com/item?id=29888423</link><guid isPermaLink="false">urn:hackerpapers:mention:2104.05122:29888423</guid><pubDate>Tue, 11 Jan 2022 06:54:49 GMT</pubDate><description>&lt;p&gt;“So what is the goddamn solution???” It’s on page four: https://arxiv.org/pdf/2104.05122.pdf It might not mean much to you unless you take a deep excursion into rigorous math with Dirac notation and Hilbert spaces and God-knows-what. The quanta magazine article is there for you if you’re somewhat generally interested and don’t have years to invest in study.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2104.05122/"&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>Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem — mentioned by emptybits</title><link>https://news.ycombinator.com/item?id=29888116</link><guid isPermaLink="false">urn:hackerpapers:mention:2104.05122:29888116</guid><pubDate>Tue, 11 Jan 2022 05:59:22 GMT</pubDate><description>&lt;p&gt;The 1779 Euler puzzle: &amp;quot;Six army regiments each have six officers of six different ranks. Can the 36 officers be arranged in a 6-by-6 square so that no row or column repeats a rank or regiment?&amp;quot; Euler said it&amp;#x27;s impossible. The 1960 proof by mathematicians and computers: &amp;quot;It&amp;#x27;s impossible.&amp;quot;[0] The 2022 solution(?): &amp;quot;In a paper posted online and submitted to Physical Review Letters, a group of quantum physicists in India and Poland demonstrates that it is possible to arrange 36 officers in a way that fulfills Euler’s criteria — so long as the officers can have a quantum mixture of ranks and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2104.05122/"&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>Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem — HN submission</title><link>https://news.ycombinator.com/item?id=29876227</link><guid isPermaLink="false">urn:hackerpapers:submission:2104.05122:29876227</guid><pubDate>Mon, 10 Jan 2022 15:24:45 GMT</pubDate><description>&lt;p&gt;Thirty-six entangled officers of Euler: Quantum solution&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2104.05122/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
