<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Less Qubits needed to crack Shors Algorithm in Tech Talk</title>
    <link>https://community.isc2.org/t5/Tech-Talk/Less-Qubits-needed-to-crack-Shors-Algorithm/m-p/67879#M4317</link>
    <description>&lt;P&gt;Hi All&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;A new paper claims to reduce the qubits needed to run Shor's Algorithm. The updated approach requires fewer than 1,700 logical qubits to break a 2048-bit RSA key.&lt;BR /&gt;&lt;BR /&gt;Should we panic? Probably not.&lt;BR /&gt;&lt;BR /&gt;As with most attempts to optimise Shor's Algorithm, trade-offs are being made. In this case, the consequence of reducing logical qubits is a significant increase in gate count (by a factor of 1,000). So it's hard to judge whether "Y2Q" has gotten closer as a result.&lt;BR /&gt;&lt;BR /&gt;And yet, each paper like this is a reminder that science doesn't stand still. On the one hand, quantum computers are becoming more error-resistant and powerful each day. On the other hand, algorithm specialists are continually trying to optimise Shor's Algorithm with papers like this.&lt;BR /&gt;&lt;BR /&gt;All the more reason to take the quantum threat seriously and start planning!&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;Regards&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;Caute_Cautim&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Tue, 05 Mar 2024 01:13:37 GMT</pubDate>
    <dc:creator>Caute_cautim</dc:creator>
    <dc:date>2024-03-05T01:13:37Z</dc:date>
    <item>
      <title>Less Qubits needed to crack Shors Algorithm</title>
      <link>https://community.isc2.org/t5/Tech-Talk/Less-Qubits-needed-to-crack-Shors-Algorithm/m-p/67879#M4317</link>
      <description>&lt;P&gt;Hi All&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;A new paper claims to reduce the qubits needed to run Shor's Algorithm. The updated approach requires fewer than 1,700 logical qubits to break a 2048-bit RSA key.&lt;BR /&gt;&lt;BR /&gt;Should we panic? Probably not.&lt;BR /&gt;&lt;BR /&gt;As with most attempts to optimise Shor's Algorithm, trade-offs are being made. In this case, the consequence of reducing logical qubits is a significant increase in gate count (by a factor of 1,000). So it's hard to judge whether "Y2Q" has gotten closer as a result.&lt;BR /&gt;&lt;BR /&gt;And yet, each paper like this is a reminder that science doesn't stand still. On the one hand, quantum computers are becoming more error-resistant and powerful each day. On the other hand, algorithm specialists are continually trying to optimise Shor's Algorithm with papers like this.&lt;BR /&gt;&lt;BR /&gt;All the more reason to take the quantum threat seriously and start planning!&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;Regards&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;Caute_Cautim&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Tue, 05 Mar 2024 01:13:37 GMT</pubDate>
      <guid>https://community.isc2.org/t5/Tech-Talk/Less-Qubits-needed-to-crack-Shors-Algorithm/m-p/67879#M4317</guid>
      <dc:creator>Caute_cautim</dc:creator>
      <dc:date>2024-03-05T01:13:37Z</dc:date>
    </item>
  </channel>
</rss>

