IP Library Granted Patent US 12,373,724
Granted Patent B1
US 12,373,724 · App. 18/082,145 · Granted Jul 29, 2025

Low latency scalable parallel streaming matching for quantum computing systems

Inventors: Austin Fowler (Los Angeles, CA); Jonathan Gross (Venice, CA)
Assignee: GOOGLE LLC
G06N10/70G06N10/00
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,373,724
App. No.
18/082,145
Granted
Jul 29, 2025
Kind
B1
Abstract

Systems and methods for tracking errors in a quantum computing system are provided. In one example, a method can include matching data associated with one or more detection events associated with a quantum computing system using a successive pattern structure comprising a plurality of processing layers. Each processing layer in the plurality of processing layers can be associated with a pattern including a plurality of sections. Each section can be associated with a processing unit operable to match one or more detection events near a center of the section. The method can include tracking one or more errors of a quantum computing system based at least in part on a matching of one or more detection events.

Claims (57)

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

providing, by a computing system comprising one or more computing devices, a first output of a plurality of qubits to a plurality of processing units, the plurality of qubits sectioned into a first plurality of sections, each of the plurality of processing units associated with one of the first plurality of sections, wherein the first plurality of sections is associated with a first pattern;

for at least one first section of the first plurality of sections matching, by the computing system, one or more first detection events near a center of the at least one first section of the first plurality of sections with another detection event or an edge in a detection graph;

providing, by the computing system, a second output of the plurality of qubits to the plurality of processing units, the plurality of qubits sectioned into a second plurality of sections, each of the plurality of processing units associated with one of the second plurality of sections, wherein the second plurality of sections is associated with a second pattern; and

for at least one second section of the second plurality of sections matching, by the computing system, one or more second detection events near a center of the at least one second section of the second plurality of sections with another detection event or an edge in the detection graph;

mitigating one or more errors in the quantum computing system based at least in part on the one or more first detection events or second detection events.

2. The computer-implemented method of claim 1 , wherein the one or more first detection events near the center of the at least one first section is at least

d

2

2

+

4

away from an edge of the at least one first section, where d is a length of the edge.

3. The computer-implemented method of claim 1 , wherein the first pattern comprises a plurality of rectangular patches.

4. The computer-implemented method of claim 1 , wherein the first pattern comprises a plurality of hexagonal patches.

5. The computer-implemented method of claim 1 , wherein the at least one first section of the first plurality of sections comprises a patch of about ten qubits by about ten qubits.

6. The computer-implemented method of claim 1 , wherein an area of the at least one first section of the first plurality of sections is greater than an area of the at least one second section of the second plurality of sections.

7. The computer-implemented method of claim 1 , wherein an area of the at least one first section of the first plurality of sections is based at least in part on a limit of a processing unit of the plurality of processing units.

8. The computer-implemented method of claim 1 , wherein each section of the plurality of second sections is centered on corners of the first pattern.

9. The computer-implemented method of claim 1 , wherein the method further comprises:

providing, by the computing system, a third output of the plurality of qubits to the plurality of processing units, the plurality of qubits sectioned into a third plurality of sections, each of the plurality of processing units associated with one of the third plurality of sections, wherein the third plurality of sections is associated with a third pattern; and

for at least one third section of the third plurality of sections matching, by the computing system, one or more third detection events near a center of the at least one third section of the third plurality of sections with another detection event or an edge in the detection graph.

10. The computer-implemented method of claim 9 , wherein the method further comprises:

providing, by the computing system, a remaining unmatched output of the plurality of qubits to the plurality of processing units.

11. The computer-implemented method of claim 10 , wherein the plurality of processing units are configured to employ one or more space-time block algorithms to match the remaining unmatched output.

12. The computer-implemented method of claim 9 , wherein each section of the third plurality of sections of the third pattern is centered on edges of the first pattern.

13. The computer-implemented method of claim 1 , wherein the plurality of qubits comprises a plurality of qubits in a grid configuration.

14. The computer-implemented method of claim 13 , wherein the plurality of qubits comprises one or more data qubits and one or more measurement qubits.

15. A quantum computing system comprising:

quantum hardware comprising a qubit grid, the qubit grid comprising a plurality of qubits in a grid configuration; and

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

providing a first output of the qubit grid, sectioned into a first plurality of sections, to a plurality of processing units, each of the plurality of processing units associated with one of the first plurality of sections, wherein the first plurality of sections is associated with a first pattern;

for at least one first section of a first plurality of sections matching one or more first detection events near a center of at least one first section of the first plurality of sections with another detection event or an edge in a detection graph;

providing a second output of the qubit grid, sectioned into a second plurality of sections, to the plurality of processing units, each of the plurality of processing units associated with one of the second plurality of sections, wherein the second plurality of sections is associated with a second pattern; and

for at least one second section of the second plurality of sections matching one or more second detection events near a center of the at least one second section of the second plurality of sections with another detection event or an edge in a detection graph;

mitigating one or more errors in the quantum computing system based at least in part on the one or more first detection events or second detection events.

16. The quantum computing system of claim 15 , wherein a detection event near the center of a section is at least

d

2

2

+

4

away from an edge of the section, where d is a length of the edge.

17. The quantum computing system of claim 15 , wherein an area of the at least one first section of the first plurality of sections is based at least in part on a limit of a processing unit of the plurality of processing units.

18. The quantum computing system of claim 15 , wherein the operations further comprise:

providing a third output of the qubit grid, sectioned into a third plurality of sections, to the plurality of processing units, each of the plurality of processing units associated with one of the third plurality of sections, wherein the third plurality of sections is associated with a third pattern; and

for at least one third section of the third plurality of sections matching one or more third detection events near a center of the at least one third section of the third plurality of sections with another detection event or an edge in a detection graph.

19. One or more tangible non-transitory computer-readable media storing computer-readable instructions that when executed by one or more processors cause the one or more processors to perform operations, the operations comprising:

matching data associated with one or more detection events associated with a quantum computing system using a successive pattern structure comprising a plurality of processing layers, each processing layer in the plurality of processing layers associated with a pattern including a plurality of sections, each section associated with a processing unit operable to match the one or more detection events near a center of the section;

tracking one or more errors of a quantum computing system based at least in part on a matching of the one or more detection events; wherein the one or more errors are matched with the one or more detection events;

mitigating one or more errors in the quantum computing system based at least in part on the one or more detection events.

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

providing, by a computing system comprising one or more computing devices, a first output of a plurality of qubits to a plurality of processing units, the plurality of qubits sectioned into a first plurality of sections, each of the plurality of processing units associated with one of the first plurality of sections, wherein the first plurality of sections is associated with a first pattern;

for at least one first section of the first plurality of sections matching, by the computing system, one or more first detection events near a center of the at least one first section of the first plurality of sections with another detection event or an edge in a detection graph; and

mitigating one or more errors in the quantum computing system based at least in part on the one or more first detection events.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 8, 2023
From: FOWLER, AUSTIN; GROSS, JONATHAN
To: GOOGLE LLC
Reel/Frame 062632/0188 →
Continuity (1)
Provisional Application 63295545 · Dec 31, 2021
References Cited (10)
US 11449385B2 · Fowler · 2022 [cited by examiner]
US 11948045B2 · Kelly · 2024 [cited by examiner]
US 12026589B1 · Fowler · 2024 [cited by examiner]
US 20220374378A1 · Sivan · 2022 [cited by examiner]
Arute et al., “Supplementary Information for Quantum Supremacy Using a Programmable Superconducting Processor”, arXiv:1910.11333v2, Dec. 28, 2019, 67 pages. [cited by applicant]
Edmonds, “Paths, Trees and Flowers” Canadian Journal of Mathematics, Chapter 17, 1965, pp. 449-467. [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]
Fowler et al., “Towards Practical Classical Processing for the Surface Code: Timing Analysis”, arXiv:1202.5602v2, Oct. 15, 2012, 13 pages. [cited by applicant]
Fowler, “Minimum Weight Perfect Matching of Fault-Tolerant Topological Quantum Error Correction in Average O (1) Parallel Time”, arXiv:1307.1740v3, Oct. 10, 2014, 8 pages. [cited by applicant]
Paler et al., “Pipelined Correlated Minimum Weight Perfect Matching of the Surface Code”, arXiv:2205.09828v1, May 19, 2022, 6 pages. [cited by applicant]
Cited By (1)
US 12,530,609