IP Library Granted Patent US 12,614,101
Granted Patent B2
US 12,614,101 · App. 18/669,113 · Granted Apr 28, 2026

Preprocessing for correlated topological quantum error correction

Inventors: Austin Fowler (Los Angeles, CA); Alexandru Paler (Bavaria, DE)
Assignee: GOOGLE LLC
G06N10/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,614,101
App. No.
18/669,113
Granted
Apr 28, 2026
Kind
B2
Abstract

A computer-implemented method for correcting one or more errors in a quantum computing system can include obtaining, by a computing system including one or more computing devices, a plurality of weighted detection graphs, each of the plurality of weighted detection graphs being descriptive of a plurality of error detection measurements and having a plurality of weights, each of the weights respectively determined according to an error probability. The method can include generating, by the computing system, a plurality of reweighted detection graphs based at least in part on a correlation between physical errors in the quantum computing system. The method can include correcting, by the computing system, one or more errors in a quantum computing system based at least in part on a global decoding of the plurality of reweighted detection graphs.

Claims (66)

1 . A computer-implemented method for correcting one or more errors in a quantum computing system, the method comprising:

obtaining, by a computing system comprising one or more computing devices, a plurality of error detection measurements;

storing, by the computing system, the plurality of error detection measurements in a processing queue that is configured to store a detection graph with chronological ordering of error detection measurements based on a detection time;

wherein the detection graph is based at least in part on a physical configuration of a respectively corresponding subset of qubits of the quantum computing system, the subset of qubits representing at least one data qubit and comprising one or more ancilla qubits configured to generate the plurality of error detection measurements;

prematching, by the computing system, a respective detection measurement;

streaming, by the computing system, data describing the prematched respective detection measurement to an error decoder for decoding errors in the subset of qubits of the quantum computing system; and

correcting, by the computing system, one or more errors in the quantum computing system based on the data describing the prematched respective detection measurement.

2 . The computer-implemented method of claim 1 , wherein prematching the respective detection measurement comprises:

storing, by the computing system, a respective prematching state of the respective detection measurement with respect to a paired respective detection measurement.

3 . The computer-implemented method of claim 2 , wherein prematching the respective detection measurement comprises:

prematching, by the computing system, the plurality of error detection measurements in the chronological ordering.

4 . The computer-implemented method of claim 3 , wherein prematching the plurality of error detection measurements in the chronological ordering comprises:

updating, by the computing system, respective prematching states only for paired detection measurements corresponding to contemporaneous and future times with respect to a respective measurement time of the respective detection measurement.

5 . The computer-implemented method of claim 2 , wherein prematching the respective detection measurement comprises:

computing, by the computing system, a likely pairing of the respective detection measurement with respect to the paired respective detection measurement, wherein the paired respective detection measurement corresponds to a future measurement time with respect to a respective measurement time of the respective detection measurement;

updating, by the computing system, a prematching state of the paired respective detection measurement; and

storing, by the computing system and in association with the paired respective detection measurement, a reference to the respective detection measurement.

6 . The computer-implemented method of claim 2 , wherein prematching the respective detection measurement comprises:

computing, by the computing system, a likely pairing of the respective detection measurement with respect to the paired respective detection measurement, wherein the paired respective detection measurement corresponds to a past measurement time with respect to a respective measurement time of the respective detection measurement;

updating, by the computing system, a prematching state of the respective detection measurement; and

storing, by the computing system and in association with the respective detection measurement, a reference to the paired respective detection measurement.

7 . The computer-implemented method of claim 2 , comprising:

computing, by the computing system, a likely pairing of the respective detection measurement with respect to the paired respective detection measurement;

wherein computing the likely pairing is based on one or more weights of one or more edges connecting the respective detection measurement to the paired respective detection measurement on the detection graph.

8 . The computer-implemented method of claim 7 , wherein the one or more weights correspond to a sum of the probabilities of one or more errors associated with the one or more edges.

9 . The computer-implemented method of claim 7 , comprising:

reweighting, by the computing system and using the data describing the prematched respective detection measurement, the detection graph.

10 . The computer-implemented method of claim 2 , wherein the data describing the prematched respective detection measurement comprises the respective prematching state.

11 . The computer-implemented method of claim 1 , wherein the detection graph is a local detection graph of a plurality of local detection graphs that collectively describe a global set of error detections for globally decoding errors in at least a portion of the quantum computing system, and wherein the method comprises:

generating, by the computing system in parallel, locally prematched detection measurement data for the plurality of local detection graphs.

12 . The computer-implemented method of claim 1 , wherein the plurality of error detection measurements are respectively associated with one or more quantum gates, and wherein the method comprises:

storing, by the computing system, a respective list of errors for each respective quantum gate; and

mapping, by the computing system, each error of the list of errors to a generating gate of the one or more quantum gates.

13 . An error correction system for correcting one or more errors in a quantum computing system, the error correction system comprising:

one or more classical processors; and

one or more non-transitory, computer-readable media storing instructions that are executable by the one or more classical processors to cause the error correction system to perform operations, the operations comprising:

obtaining a plurality of error detection measurements;

storing the plurality of error detection measurements in a processing queue that is configured to store a detection graph with chronological ordering of error detection measurements based on a detection time;

wherein the detection graph is based at least in part on a physical configuration of a respectively corresponding subset of qubits of the quantum computing system, the subset of qubits representing at least one data qubit and comprising one or more ancilla qubits configured to generate the plurality of error detection measurements;

prematching a respective detection measurement;

streaming data describing the prematched respective detection measurement to an error decoder for decoding errors in the subset of qubits of the quantum computing system;

correcting one or more errors in the quantum computing system based on the data describing the prematched respective detection measurement.

14 . The error correction system of claim 13 , wherein prematching the respective detection measurement comprises:

storing a respective prematching state of the respective detection measurement with respect to a paired respective detection measurement.

15 . The error correction system of claim 14 , wherein prematching the respective detection measurement comprises:

computing a likely pairing of the respective detection measurement with respect to the paired respective detection measurement, wherein the paired respective detection measurement corresponds to a future measurement time with respect to a respective measurement time of the respective detection measurement;

updating a prematching state of the paired respective detection measurement; and

storing, in association with the paired respective detection measurement, a reference to the respective detection measurement.

16 . The error correction system of claim 14 , wherein prematching the respective detection measurement comprises:

computing a likely pairing of the respective detection measurement with respect to the paired respective detection measurement, wherein the paired respective detection measurement corresponds to a past measurement time with respect to a respective measurement time of the respective detection measurement;

updating a prematching state of the respective detection measurement; and

storing, in association with the respective detection measurement, a reference to the paired respective detection measurement.

17 . The error correction system of claim 13 , wherein prematching the plurality of error detection measurements in the chronological ordering comprises:

updating respective prematching states only for paired detection measurements corresponding to contemporaneous and future times with respect to a respective measurement time of the respective detection measurement.

18 . The error correction system of claim 13 , wherein the detection graph is a local detection graph of a plurality of local detection graphs that collectively describe a global set of error detections for globally decoding errors in at least a portion of the quantum computing system, and wherein the operations comprise:

streaming, to the error decoder in parallel, locally prematched detection measurement data for the plurality of local detection graphs.

19 . A quantum computing system, comprising:

quantum hardware comprising a plurality of qubits; and

one or more classical processors;

wherein the one or more classical processors are configured to perform operations, the operations comprising:

obtaining a plurality of error detection measurements;

storing the plurality of error detection measurements in a processing queue that is configured to store a detection graph with chronological ordering of error detection measurements based on a detection time;

wherein the detection graph is based at least in part on a physical configuration of a respectively corresponding subset of qubits of the quantum computing system, the subset of qubits representing at least one data qubit and comprising one or more ancilla qubits configured to generate the plurality of error detection measurements;

prematching a respective detection measurement;

streaming data describing the prematched respective detection measurement to an error decoder for decoding errors in the subset of qubits of the quantum computing system; and

correcting one or more errors in the quantum hardware based on the data describing the prematched respective detection measurement.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2024
From: FOWLER, AUSTIN; PALER, ALEXANDRU
To: GOOGLE LLC
Reel/Frame 068590/0164 →
Continuity (3)
Continuation 17698051 · Mar 18, 2022
Provisional Application 63162624 · Mar 18, 2021
Related Publication 20260010816A1 · Jan 8, 2026
References Cited (24)
US 7966549B2 · Hollenberg · 2011 [cited by examiner]
US 11574030B1 · Harrigan · 2023 [cited by examiner]
US 11700020B2 · Delfosse · 2023 [cited by examiner]
US 20220216884A1 · Delfosse · 2022 [cited by examiner]
US 20220382632A1 · Fowler · 2022 [cited by examiner]
US 20230004849A1 · Jang · 2023 [cited by examiner]
US 20230040234A1 · Aspuru-Guzik · 2023 [cited by examiner]
Andrist et al., “Optimal Error Correction in Topological Subsystem Codes”, arXiv:1204.1838v2, May 14, 2012, 4 pages. [cited by applicant]
Baireuther et al., “Neural Network Decoder for Topological Color Codes with Circuit Level Noise”, arXiv:1804.02926v2, Oct. 18, 2018, 10 pages. [cited by applicant]
Bravyi et al., “Quantum Codes on a Lattice with Boundary”, arXiv:quant-ph/9811052v1, Nov. 20, 1998, 6 pages. [cited by applicant]
Dennis et al., “Topological Quantum Memory”, arXiv:quant-ph/0110143v1, Oct. 24, 2001, 39 pages. [cited by applicant]
Duclos-Cianci et al., “Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes”, arXiv:1304.6100v1, Apr. 22, 2013, 11 pages. [cited by applicant]
Edmonds, “Maximum Matching and a Polyhedron With O,1-Vertices”, Journal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics vol. 69B, Nos. 1 and 2, Jan.-Jun. 1965, pp. 125-130. [cited by applicant]
Edmonds, “Paths, Trees and Flowers”, Canadian Journal of Mathematics, Chapter 17, 1965, pp. 449-467. [cited by applicant]
Fowler et al., “Low Overhead Quantum Computation Using Lattice Surgery”, arXiv:1808.06709v4, Aug. 30, 2019, 15 pages. [cited by applicant]
Fowler et al., “Surface Codes: Towards Practical Large-Scale Quantum Computation”, arXiv:1208.0928, Oct. 27, 2012, 54 pages. [cited by applicant]
Fowler, “Optimal Complexity Correction of Correlated Errors in the Surface Code”, arXiv:1310.0863v1, Oct. 2, 2013, 6 pages. [cited by applicant]
Gidney et al., “Flexible Layout of Surface Code Computations Using Autocoz States”, arXiv:1905.08916v1, May 22, 2019, 17 pages. [cited by applicant]
Hutter et al., “An Efficient Markov Chain Monte Carlo Algorithm for the Surface Code”, arXiv:1302.2669v2, Aug. 8, 2013, 10 pages. [cited by applicant]
Kivlichan et al., “Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization”, arXiv:1902.10673v4, Jul. 13, 2020, 45 pages. [cited by applicant]
Litinski, “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, arXiv:1808.02892v3, Feb. 3, 2019, 37 pages. [cited by applicant]
Raussendorf et al., “Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions”, arXiv:quant-ph/0610082v2, May 14, 2007, 4 pages. [cited by applicant]
Raussendorf et al., “Topological Fault-Tolerance in Cluster State Quantum Computation”, arXiv:quant-ph/0703143v1, Mar. 16, 2007, 20 pages. [cited by applicant]
Wootton, “A Simple Decoder for Topological Codes”, arXiv:1310.2393v4, Apr. 9, 2015, 13 pages. [cited by applicant]