<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum Natural Language Processing on Near-Term Quantum Computers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2005.04147/</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/2005.04147/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantum Natural Language Processing on Near-Term Quantum Computers — mentioned by StackOverlord</title><link>https://news.ycombinator.com/item?id=36745828</link><guid isPermaLink="false">urn:hackerpapers:mention:2005.04147:36745828</guid><pubDate>Sun, 16 Jul 2023 11:33:56 GMT</pubDate><description>&lt;p&gt;What do you think of &amp;gt; In some of its applications, the original &amp;gt; Zeng-Coecke algorithm relies on the existence of a quantum random access memory (QRAM) [22], &amp;gt; which is not yet known to be efficiently implementable in the absence of fault tolerant scalable quantum &amp;gt; computers [1, 7]. Here we take a different approach, using the classical ansatz parameters to encode the ¨ &amp;gt; distributional embedding and avoiding the need for QRAM entirely. The cost function for the parameter &amp;gt; optimisation is informed by a corpus, already parsed and POS-tagged by classical means. Source: Quantum Natural…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2005.04147/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
