<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: Quantum Supremacy Achieved ?</title>
	<atom:link href="http://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/</link>
	<description>All about electronics and circuit design</description>
	<lastBuildDate>Fri, 17 Apr 2026 19:42:52 +0000</lastBuildDate>
		<sy:updatePeriod>hourly</sy:updatePeriod>
		<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.9.14</generator>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1662269</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Mon, 02 Dec 2019 00:10:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1662269</guid>
		<description><![CDATA[https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/]]></description>
		<content:encoded><![CDATA[<p><a href="https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/" rel="nofollow">https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1658593</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Wed, 06 Nov 2019 20:34:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1658593</guid>
		<description><![CDATA[“Google’s Potential Claim to the Throne of Quantum Supremacy: What does it mean for cybersecurity?”

https://cloudsecurityalliance.org/blog/2019/11/06/google-claim-to-quantum-supremacy-what-does-it-mean-for-cybersecurity/ #quantumcomputing #cryptography #infosec #research #innovation #physics]]></description>
		<content:encoded><![CDATA[<p>“Google’s Potential Claim to the Throne of Quantum Supremacy: What does it mean for cybersecurity?”</p>
<p><a href="https://cloudsecurityalliance.org/blog/2019/11/06/google-claim-to-quantum-supremacy-what-does-it-mean-for-cybersecurity/" rel="nofollow">https://cloudsecurityalliance.org/blog/2019/11/06/google-claim-to-quantum-supremacy-what-does-it-mean-for-cybersecurity/</a> #quantumcomputing #cryptography #infosec #research #innovation #physics</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1657708</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Fri, 01 Nov 2019 16:42:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1657708</guid>
		<description><![CDATA[The Race For Quantum Supremacy I VICE on HBO
https://m.youtube.com/watch?v=1lIfbqfoGMo

Computer giants are racing to build the first quantum computer, a device with millions of times more processing strength than all the computers currently on Earth combined.

VICE&#039;s Taylor Wilson meets the scientists at the cutting edge of this new age of computing.]]></description>
		<content:encoded><![CDATA[<p>The Race For Quantum Supremacy I VICE on HBO<br />
<a href="https://m.youtube.com/watch?v=1lIfbqfoGMo" rel="nofollow">https://m.youtube.com/watch?v=1lIfbqfoGMo</a></p>
<p>Computer giants are racing to build the first quantum computer, a device with millions of times more processing strength than all the computers currently on Earth combined.</p>
<p>VICE&#8217;s Taylor Wilson meets the scientists at the cutting edge of this new age of computing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1657380</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Tue, 29 Oct 2019 20:16:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1657380</guid>
		<description><![CDATA[Will the quantum economy change your business?
https://techcrunch.com/2019/10/28/will-the-quantum-economy-change-your-business/?tpcc=ECFB2019

Google  and NASA have demonstrated that quantum computing isn’t just a fancy trick, but almost certainly something actually useful — and they’re already working on commercial applications. What does that mean for existing startups and businesses? Simply put: nothing. But that doesn’t mean you can ignore it forever.

1. It’ll be a long time before anything really practical comes out of quantum computing.

2. Early applications will be incredibly domain-specific and not generalizable.]]></description>
		<content:encoded><![CDATA[<p>Will the quantum economy change your business?<br />
<a href="https://techcrunch.com/2019/10/28/will-the-quantum-economy-change-your-business/?tpcc=ECFB2019" rel="nofollow">https://techcrunch.com/2019/10/28/will-the-quantum-economy-change-your-business/?tpcc=ECFB2019</a></p>
<p>Google  and NASA have demonstrated that quantum computing isn’t just a fancy trick, but almost certainly something actually useful — and they’re already working on commercial applications. What does that mean for existing startups and businesses? Simply put: nothing. But that doesn’t mean you can ignore it forever.</p>
<p>1. It’ll be a long time before anything really practical comes out of quantum computing.</p>
<p>2. Early applications will be incredibly domain-specific and not generalizable.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1657309</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Tue, 29 Oct 2019 06:38:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1657309</guid>
		<description><![CDATA[https://techgrabyte.com/googles-quantum-computer-10k-year-calculation-200-sec/]]></description>
		<content:encoded><![CDATA[<p><a href="https://techgrabyte.com/googles-quantum-computer-10k-year-calculation-200-sec/" rel="nofollow">https://techgrabyte.com/googles-quantum-computer-10k-year-calculation-200-sec/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1657234</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Mon, 28 Oct 2019 11:44:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1657234</guid>
		<description><![CDATA[https://www.scottaaronson.com/blog/?p=4372]]></description>
		<content:encoded><![CDATA[<p><a href="https://www.scottaaronson.com/blog/?p=4372" rel="nofollow">https://www.scottaaronson.com/blog/?p=4372</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1657066</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Sun, 27 Oct 2019 05:44:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1657066</guid>
		<description><![CDATA[Code-breaking quantum computers are closer to reality than anyone suspected.

How a quantum computer could break 2048-bit RSA encryption in 8 hours
https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/

A new study shows that quantum technology will catch up with today’s encryption standards much sooner than expected. That should worry anybody who needs to store data securely for 25 years or so.

So computer scientists have attempted to calculate the resources such a quantum computer might need and then work out how long it will be until such a machine can be built. And the answer has always been decades.

Today, that thinking needs to be revised thanks to the work of Craig Gidney at Google in Santa Barbara and Martin Ekerå at the KTH Royal Institute of Technology in Stockholm, Sweden. These guys have found a more efficient way for quantum computers to perform the code-breaking calculations, reducing the resources they require by orders of magnitude.

Consequently, these machines are significantly closer to reality than anyone suspected. The result will make uncomfortable reading for governments, military and security organizations, banks, and anyone else who needs to secure data for 25 years or longer.

 practically impossible for a classical computer to factor numbers that are longer than 2048 bits, which is the basis of the most commonly used form of RSA encryption.

Shor showed that a sufficiently powerful quantum computer could do this with ease

noise becomes a significant problem for large quantum computers. And the best way currently to tackle noise is to use error-correcting codes that require significant extra qubits themselves

Now Gidney and Ekerå have shown how a quantum computer could do the calculation with just 20 million qubits. Indeed, they show that such a device would take just eight hours to complete the calculation.  “[As a result], the worst case estimate of how many qubits will be needed to factor 2048 bit RSA integers has dropped nearly two orders of magnitude,” they say.

Indeed, security experts have developed post-quantum codes that even a quantum computer will not be able to crack. 

For ordinary people, there is little risk. Most people use 2048-bit encryption

https://www.technologyreview.com/s/420287/1978-cryptosystem-resists-quantum-attack/]]></description>
		<content:encoded><![CDATA[<p>Code-breaking quantum computers are closer to reality than anyone suspected.</p>
<p>How a quantum computer could break 2048-bit RSA encryption in 8 hours<br />
<a href="https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/" rel="nofollow">https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/</a></p>
<p>A new study shows that quantum technology will catch up with today’s encryption standards much sooner than expected. That should worry anybody who needs to store data securely for 25 years or so.</p>
<p>So computer scientists have attempted to calculate the resources such a quantum computer might need and then work out how long it will be until such a machine can be built. And the answer has always been decades.</p>
<p>Today, that thinking needs to be revised thanks to the work of Craig Gidney at Google in Santa Barbara and Martin Ekerå at the KTH Royal Institute of Technology in Stockholm, Sweden. These guys have found a more efficient way for quantum computers to perform the code-breaking calculations, reducing the resources they require by orders of magnitude.</p>
<p>Consequently, these machines are significantly closer to reality than anyone suspected. The result will make uncomfortable reading for governments, military and security organizations, banks, and anyone else who needs to secure data for 25 years or longer.</p>
<p> practically impossible for a classical computer to factor numbers that are longer than 2048 bits, which is the basis of the most commonly used form of RSA encryption.</p>
<p>Shor showed that a sufficiently powerful quantum computer could do this with ease</p>
<p>noise becomes a significant problem for large quantum computers. And the best way currently to tackle noise is to use error-correcting codes that require significant extra qubits themselves</p>
<p>Now Gidney and Ekerå have shown how a quantum computer could do the calculation with just 20 million qubits. Indeed, they show that such a device would take just eight hours to complete the calculation.  “[As a result], the worst case estimate of how many qubits will be needed to factor 2048 bit RSA integers has dropped nearly two orders of magnitude,” they say.</p>
<p>Indeed, security experts have developed post-quantum codes that even a quantum computer will not be able to crack. </p>
<p>For ordinary people, there is little risk. Most people use 2048-bit encryption</p>
<p><a href="https://www.technologyreview.com/s/420287/1978-cryptosystem-resists-quantum-attack/" rel="nofollow">https://www.technologyreview.com/s/420287/1978-cryptosystem-resists-quantum-attack/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1656997</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Sat, 26 Oct 2019 17:33:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1656997</guid>
		<description><![CDATA[Quantum computing’s ‘Hello World’ moment
Certainty principle
https://techcrunch.com/2019/10/26/quantum-computings-hello-world-moment/

 quantum computing really exist? It’s fitting that for decades this field has been haunted by the fundamental uncertainty of whether it would, eventually, prove to be a wild goose chase. But Google has collapsed this nagging superposition with research not just demonstrating what’s called “quantum supremacy,” but more importantly showing that this also is only the very beginning of what quantum computers will eventually be capable of.]]></description>
		<content:encoded><![CDATA[<p>Quantum computing’s ‘Hello World’ moment<br />
Certainty principle<br />
<a href="https://techcrunch.com/2019/10/26/quantum-computings-hello-world-moment/" rel="nofollow">https://techcrunch.com/2019/10/26/quantum-computings-hello-world-moment/</a></p>
<p> quantum computing really exist? It’s fitting that for decades this field has been haunted by the fundamental uncertainty of whether it would, eventually, prove to be a wild goose chase. But Google has collapsed this nagging superposition with research not just demonstrating what’s called “quantum supremacy,” but more importantly showing that this also is only the very beginning of what quantum computers will eventually be capable of.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1656923</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Sat, 26 Oct 2019 14:19:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1656923</guid>
		<description><![CDATA[https://spectrum.ieee.org/tech-talk/computing/hardware/how-googles-quantum-supremacy-plays-into-quantum-computings-long-game]]></description>
		<content:encoded><![CDATA[<p><a href="https://spectrum.ieee.org/tech-talk/computing/hardware/how-googles-quantum-supremacy-plays-into-quantum-computings-long-game" rel="nofollow">https://spectrum.ieee.org/tech-talk/computing/hardware/how-googles-quantum-supremacy-plays-into-quantum-computings-long-game</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2019/10/23/quantum-supremacy-achieved/comment-page-1/#comment-1656690</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Fri, 25 Oct 2019 14:40:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=184619#comment-1656690</guid>
		<description><![CDATA[https://www.tiede.fi/artikkeli/uutiset/kvanttiherruus-nyt-saavutettu-virallisesti]]></description>
		<content:encoded><![CDATA[<p><a href="https://www.tiede.fi/artikkeli/uutiset/kvanttiherruus-nyt-saavutettu-virallisesti" rel="nofollow">https://www.tiede.fi/artikkeli/uutiset/kvanttiherruus-nyt-saavutettu-virallisesti</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
