The Google Willow Thing (scottaaronson.blog)

Article summary

Google has announced a new 105-qubit superconducting chip called Willow, which has demonstrated an error-corrected surface code qubit and a new quantum supremacy experiment based on Random Circuit Sampling. The experiment would take approximately 10^25 years to simulate classically, but the results cannot be directly verified by a classical computer. The achievement is seen as a significant milestone in the development of quantum computing. Google's progress is considered to be in line with expectations, but it's still a notable success for the field.

Main themes

• Quantum Computing
• Google Willow Chip
• Quantum Supremacy
• Error Correction
• Classical Verification
• Quantum Algorithms

What commenters say

• The choice of problems in quantum computing research is often driven by the ability to demonstrate quantum supremacy rather than solving practical problems with clear classical verification methods.
• There is a need for quantum algorithms that can be efficiently verified by classical computers to establish credibility and usefulness.
• Some argue that simulating physical systems, such as weather patterns or molecular interactions, could provide a way to validate quantum computing results without relying on classical computation.
• Others propose that problems with inherent structure, such as cryptographic hash functions, could enable classical verification of quantum computations despite the intermediate steps being intractable to simulate classically.
• The development of quantum computing has significant implications for cryptography, but the impact is not yet clear.
• The inability to directly verify the results of quantum computations is a major limitation of current quantum computing research.
• Some researchers believe that the focus on demonstrating quantum supremacy has led to a lack of attention on developing practical quantum algorithms with clear classical verification methods.
• The existence of problems that are both solvable with a quantum speedup and verifiable classically is still an open question.