Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
www.schneier.com
|
|
| | | | | A group of Chinese researchers have just published a paper claiming that they can-although they have not yet done so-break 2048-bit RSA. This is something to take seriously. It might not be correct, but it's not obviously wrong. We have long known from Shor's algorithm that factoring with a quantum computer is easy. But it takes a big quantum computer, on the orders of millions of qbits, to factor anything resembling the key sizes we use today. What the researchers have done is combine classical lattice ... | |
| | | | |
4gravitons.com
|
|
| | | | | Merging quantum mechanics and gravity is a famously hard physics problem. Explaining why merging quantum mechanics and gravity is hard is, in turn, a very hard science communication problem. The more popular descriptions tend to lead to misunderstandings, and I've posted many times over the years to chip away at those misunderstandings. Merging quantum mechanics... | |
| | | | |
windowsontheory.org
|
|
| | | | | (see also pdf version) Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question,... | |
| | | | |
www.philvenables.com
|
|
| | | Quantum computing is advancing rapidly. Innovations from Google, Microsoft, IBM and others are pushing the boundaries of not just the numbers of qubits but also their quality. We are well on our way to quantum computing being practical for real world problems. This also means we are also on the path to the existence of cryptanalytically relevant quantum computers (CRQCs) that can break a number of the algorithms much of modern security depends on.Opinions vary on the timeline of when a CRQC wil | ||
