<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1910.09930/</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/1910.09930/feed.xml" rel="self" type="application/rss+xml" /><item><title>Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces — mentioned by abdullahkhalids</title><link>https://news.ycombinator.com/item?id=21471332</link><guid isPermaLink="false">urn:hackerpapers:mention:1910.09930:21471332</guid><pubDate>Thu, 07 Nov 2019 08:00:47 GMT</pubDate><description>&lt;p&gt;They [1] did not make not a quantum computer. They made a BosonSampler, which is a different way of demonstrating quantum supremacy. A BosonSampler is not a universal quantum computer because it&amp;#x27;s circuit depth and/or width would group exponentially in the size of BQP [2] problems. Very much like Google&amp;#x27;s chip, this machine is only good for solving one useless task: sampling from a probability distribution formed from the permanants of the nxn submatrices of a mxm unitary matrix, where m&amp;gt;n. This task is hard for classical computers but easy for quantum devices because you can just make this…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1910.09930/"&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>
