Google Quantum AI

We demonstrated verifiable quantum advantage with Quantum Echoes. Running 13,000x faster than leading supercomputers, this represents a significant step toward real-world applications. Watch → goo.gle/48Gnbtl

Our team ran a verifiable quantum algorithm that probes how parts of a quantum system interact, from molecules to magnets and beyond. On our Willow chip, it ran 13,000× faster than the best classical supercomputers. A first in quantum computing → goo.gle/42z9E2d

How do quantum algorithms become real-world tools? This five-stage framework maps the progression from discovery to deployment, showing where applications demonstrate advantage, can be further optimized, and hold the greatest potential. Learn more → goo.gle/4exsT3s

Submit proposals for early access to the Willow quantum processor through the 2026 Willow Early Access Program before the May 15 deadline. Learn more → goo.gle/4sEyQzW

In honor of World Quantum Day, we’re heading onto our campus to answer the top trending questions people are searching for. Join Jenna and Andrew from our team as they break down the basics of quantum and what these systems could actually be used for → goo.gle/4mw6zJy

Happy World Quantum Day! Today’s #GoogleDoodle represents the potential of the qubit. We’re harnessing its unique quantum properties to build systems capable of solving problems that remain intractable for classical computers → goo.gle/4ckighH

@ETH_en Aniket's thesis @Yale: Controlling and Protecting Quantum Information in Superconducting Oscillators: goo.gle/4carbCb

Nathan's thesis @ETH_en: Quantum Error Correction with Superconducting Circuits: goo.gle/4mi9dCG

Last month at the 2026 APS Global Physics Summit, two Google Quantum AI researchers were recognized as DQI Best Thesis finalists. Congratulations Nathan Lacroix (Winner) and Aniket Maiti (Finalist) on their work!

Google Quantum AI is now accepting proposals for the Willow Early Access Program. We are seeking proposals for experiments that can be run on our Willow processor that have the potential to produce foundational, high-quality results. Learn more → goo.gle/4sEyQzW

Google Quantum AI is expanding to include neutral atom research with our superconducting program. Complementary paths will accelerate our mission to build a large-scale, error-corrected quantum computer—an engineering challenge we are excited to tackle. goo.gle/40TycSV

Discover the latest quantum computing research at APS Global Physics Summit 2026, March 16–19. From optimized algorithms to superconducting qubits and error characterization, there’s a lot to explore → goo.gle/46UJFoI

Join us at APS Global Physics Summit 2026 (Mar 16–19) to see the latest in quantum error correction, algorithms, and scalable systems from Google Quantum AI. Which session are you excited for most? Schedule: goo.gle/46UJFoI

Did you know quantum processors must be kept near absolute zero, colder than deep space? These temperatures reduce noise and maintain quantum coherence, making quantum computing possible.

Yesterday we co-hosted a roundtable with Google Quantum AI on the future of quantum applications. Leaders from industry and government discussed algorithm + hardware progress, smart policy, real-world use cases, and scientific cooperation. Thanks to Google and all who joined.

The XPRIZE Quantum Applications competition is looking for teams turning quantum ideas into practical applications. See what qualified the 2025 Phase I finalists and what to expect as Phase II and wildcard entries open ↓ goo.gle/3NAEYti

Building a long-lived logical qubit is essential for the next stage of quantum computing—and our next milestone. In our "Hard Quantum Words" series, our team takes on the challenge of simplifying the concept. Who explained it best?

Four decades ago, R. Feynman envisioned quantum processors for quantum simulation. In this article, our research scientists discuss instances where these processors have enabled small discoveries—“discoverino.” → science.org/doi/10.1126/sc… → arxiv.org/abs/2512.08293

Explaining quantum computing is a challenge. Explaining Out-of-Time-Ordered Correlators (OTOCs) is on a whole other level. our Hard Quantum Words series, we asked our researchers to break down the algorithm behind Quantum Echoes.

Quantum advantage is a core concept in quantum computing, but can it be explained in simple terms? In our new series, Hard Quantum Words, watch to see our researchers take on the challenge.

Happy holidays from the Google Quantum AI team! As qubits entangle and coherence holds, we look forward to what the new year has in store.