<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Factoring using 2n+2 qubits with Toffoli based modular multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1611.07995/</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/1611.07995/feed.xml" rel="self" type="application/rss+xml" /><item><title>Factoring using 2n+2 qubits with Toffoli based modular multiplication — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=30420151</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.07995:30420151</guid><pubDate>Mon, 21 Feb 2022 20:25:08 GMT</pubDate><description>&lt;p&gt;&amp;gt; your goals (e.g. compilation into realistic gates) are very different from the goals of these language designers (study of abstract structure of quantum algorithms) But the abstract structure of quantum algorithms is all about the carefully orchestrated structure within entanglement, not whether entanglement is present. Also, even just considering whether entanglement is present, the rules that they use in the language are far too weak. They basically amount to &amp;quot;if you do a two qubit operation it might be entangled&amp;quot;. How is something like that ever going to help verify, for example, that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.07995/"&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>
