New Google Patents · Filed Dec 23, 2024 · Published Aug 20, 2026 · verified — real USPTO data

QUANTUM ERROR CORRECTION

Quantum computers make errors constantly, and fixing them fast enough to be useful is one of the hardest problems in computing. Google's latest patent proposes a chip architecture where neighboring processor cores can reach directly into each other's memory to speed that correction up.

Detailed three-dimensional topological lattice network used for quantum error correction in advanced quantum computing systems. Drawing from patent filing US 2026/0244973 A1.
Detailed three-dimensional topological lattice network used for quantum error correction in advanced quantum computing systems.
See all 8 drawings from this filing ↓
Publication number US 2026/0244973 A1
Applicant Google LLC
Filing date Dec 23, 2024
Publication date Aug 20, 2026
Inventors Austin Greig Fowler
CPC classification 714/752
Grant likelihood Low
Examiner CHASE, SHELLY A (Art Unit 2112)
Status Non Final Action Mailed (Jun 3, 2026)
Parent application is a Continuation of 18220752 (filed 2023-07-11)
Document 22 claims

What Google's shared-memory quantum chip actually does

Every time a quantum computer tries to run a calculation, tiny physical disturbances cause errors to creep in at a rate that would make any regular computer useless. Catching and fixing those errors in real time is the whole ballgame for making quantum computing practical.

Google's patent describes a grid of processor cores, each sitting on a chip with its own fast memory, all wired together so that any core can peek into its neighbor's memory directly. The idea is that error-correction calculations often need data from nearby cores, and waiting for that data to travel through slower paths wastes precious time.

Think of it like a team of fact-checkers sitting in the same room and passing notes by hand, rather than emailing each other and waiting for a reply. By letting each core grab what it needs from its neighbor without going through a central inbox, the whole correction process can keep up with the quantum computer it's serving.

From the filing · THE ABSTRACT
Apparatus for quantum error correction is disclosed. The apparatus includes an array of processing cores, each processing core comprising: a processor on a first chip; and a processor cache on the first chip; and a bus for interconnecting neighbouring processing cores in the array of processing cores; …

Translation: The system uses connected chips to help fix errors in quantum computers.

How neighboring cores share cache to catch quantum errors

The patent centers on an array of processing cores, each built around a processor and a fast processor cache (a small pool of on-chip memory that holds data the processor uses most often) on a single chip.

The key twist is the interconnect: a bus (a dedicated communication channel, like a private highway between chips) links each core to its immediate neighbors in the array. The control code running on each processor is explicitly allowed to access a neighboring core's cache directly, not just its own.

  • Local cache access: each core reads and writes its own fast memory as usual.
  • Cross-core cache access: each core can also read from a neighbor's cache over the bus, skipping slower memory paths.
  • Neighbor-aware processing: the control logic routes requests to whichever adjacent core holds the needed data.

In quantum error correction, the algorithms (called decoders) need to look at syndrome data, which is the pattern of detected errors from nearby physical qubits. Because that data is spatially local, letting neighboring cores share it directly maps neatly onto the geometry of a qubit array and cuts the latency (delay) that would otherwise slow the correction cycle down.

What this means for the future of quantum hardware

Quantum error correction is a speed problem as much as an accuracy problem. Qubits degrade so fast that the correction hardware has to keep pace in near real time, and memory bottlenecks are a real ceiling on how fast any decoder can run. An architecture that lets adjacent chips share memory directly removes one layer of that bottleneck without requiring a central, high-bandwidth hub that could itself become a chokepoint.

The design does give something up: letting one core write into a neighbor's cache introduces coordination complexity, and any bug in that cross-core access logic could corrupt the very data it's trying to use for correction. Whether that tradeoff reads as worth it depends entirely on how well the bus and cache-coherence logic are implemented, details the patent leaves to the implementation. Quantum chip architecture is one of the more technically dense areas covered among new Big Tech patents, and Google's focus here on the classical control hardware, not the qubits themselves, signals that the bottleneck the company is racing to fix right now is on the silicon side.

Google's 11th filing we've tracked since July in the AI chip wars watchlist follows one on compressing model data and one on a battery-saving noise chip, adding another piece to the picture.

Editorial take

When several processor cores try to grab data from the same shared memory pool at the same instant, they form a traffic jam. The whole point of sharing that pool was speed, but a traffic jam kills the speed advantage while keeping all the added complexity.

The design is a fair engineering gamble. The patent just never explains how the traffic jam actually gets cleared.

There are more where this came from

We read every patent application Big Tech publishes and send you the ones worth knowing. Plain English, free, every week.

The drawings

8 drawing sheets from US 2026/0244973 A1 · click any drawing to enlarge

Patent filing page

Source. Full patent text and figures from the official USPTO publication PDF.