IP Library Granted Patent US 12,462,183
Granted Patent B2
US 12,462,183 · App. 18/055,488 · Granted Nov 4, 2025

Decoding quantum error correction codes

Inventors: Ben Andrew Barber (Cambridge, GB); Kenton Michael Barnes (Cambridge, GB)
Assignee: RIVERLANE LTD
G06N10/70G06N10/20
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,462,183
App. No.
18/055,488
Granted
Nov 4, 2025
Kind
B2
Abstract

A computer-implemented method for use in decoding syndromes of a quantum error correction code, the syndromes comprising measurement data from a quantum computer comprising a plurality of syndrome qubits and a plurality of data qubits. The method comprises: processing the syndromes to identify defects; recording, in a data structure, respective locations for each defect; and determining a respective radius, for each respective defect, of a ball surrounding the respective location of the respective defect, and recording each respective radius with its respective location in the data structure, wherein each respective radius is determined by iteratively increasing a length of the respective radius until each respective radius defines a ball touching or overlapping at least one other ball surrounding another of the respective locations, such that each respective location belongs to a cluster consisting of an even number of the locations of the defects; wherein the data structure thereby enables decoding of the quantum error correction code.

Claims (28)

1 . A computer-implemented quantum error correction method for use in decoding syndromes of a quantum error correction code, the syndromes comprising measurement data from a quantum computer comprising a plurality of syndrome qubits and a plurality of data qubits, the method comprising:

receiving syndromes comprising measurement data from a quantum computer comprising a plurality of syndrome qubits and a plurality of data qubits;

processing the syndromes to identify defects;

recording, in a data structure, respective locations for each defect;

determining a respective radius, for each respective defect, of a ball surrounding the respective location of the respective defect, and recording each respective radius with its respective location in the data structure, wherein each respective radius is determined by iteratively increasing a length of the respective radius until each respective radius defines a ball touching or overlapping at least one other ball surrounding another of the respective locations, such that each respective location belongs to a cluster consisting of an even number of the locations of defects;

decoding the one or more clusters; and

implementing an error correction wherein the data structure thereby enables decoding of the quantum error correction code.

2 . The method of claim 1 , wherein when at a particular iteration an odd number of the locations join a pre-existing cluster consisting of an even number of locations thereby forming a new cluster, the method further comprises, at the next iteration, increasing the length of each radius of the new cluster.

3 . The method of claim 1 , wherein the length of a particular radius is determined based on a number of times that the particular radius has been incrementally increased.

4 . The method of claim 1 , wherein the plurality of syndrome qubits form a physical array with locations of the plurality of syndrome qubits corresponding to respective positions of the plurality of syndrome qubits in a graph representation of the array.

5 . The method of claim 4 , wherein the length of each radius is determined according to a metric of the graph.

6 . The method of claim 5 , wherein the metric of the graph varies within the graph.

7 . The method of claim 5 , wherein the metric of the graph is an L 1 metric.

8 . The method of claim 4 , wherein each iterative increase in the length of the respective radius is an increase of half the edge length between nearest neighbor locations of the graph.

9 . The method of claim 4 , wherein the touching or overlapping of the ball with the other ball is determined based on the sum of the radius length of the ball and the radius length of the other ball being at least equal to the graph distance between the ball and the other ball.

10 . The method of claim 1 , wherein the quantum error correction code is a surface code.

11 . The method of claim 10 , wherein the surface code is a rotated surface code or an unrotated surface code.

12 . The method of claim 1 , further comprising performing error correction for each data qubit containing an error.

13 . The method of claim 1 , wherein the syndromes comprise multiple rounds of syndrome measurement data, and the error syndrome bits further comprise measurement data relevant to decoding measurement errors.

14 . The method of claim 13 , wherein the syndromes correspond to a spatio-temporal graph and the one or more clusters are configured to enable decoding of both data qubit errors and measurement errors.

15 . A decoder apparatus for use in decoding a quantum error correction code from a quantum computer, the decoder apparatus configured to:

receive syndromes comprising measurement data from a quantum computer, the quantum computer comprising a plurality of syndrome qubits and a plurality of data qubits;

process the syndromes to identify defects;

record, in a data structure, respective locations for each defect;

determine a respective radius, for each respective defect, of a ball surrounding the respective location of the respective defect;

record each respective radius in association with its respective location in the data structure, wherein each respective radius is determined by iteratively increasing a length of the respective radius until each respective radius defines a ball touching or overlapping at least one other ball surrounding another of the respective locations, such that each respective location belongs to a cluster consisting of an even number of the locations of the identified syndrome qubits, and wherein the data structure thereby comprises one or more clusters of the locations of the defects, the one or more clusters for decoding the syndromes of the quantum error correction code

decode the one or more clusters; and

implement an error correction.

Assignments (2)
CHANGE OF NAME Recorded Feb 28, 2024
From: RIVER LANE RESEARCH LTD.
To: RIVERLANE LTD
Reel/Frame 066592/0500 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 21, 2022
From: BARBER, BEN ANDREW; BARNES, KENTON MICHAEL
To: RIVER LANE RESEARCH LTD.
Reel/Frame 061842/0952 →
Continuity (1)
Related Publication 20240169246A1 · May 23, 2024
References Cited (20)
US 11901915B1 · Campbell · 2024 [cited by examiner]
US 12147874B2 · Barber · 2024 [cited by examiner]
US 20210042650A1 · Das et al. · 2021 [cited by applicant]
US 20210124640A1 · Nickerson et al. · 2021 [cited by applicant]
US 20220198311A1 · Delfosse · 2022 [cited by examiner]
US 20220216884A1 · Delfosse et al. · 2022 [cited by applicant]
US 20220269963A1 · Delfosse et al. · 2022 [cited by applicant]
US 20240062092A1 · Delfosse · 2024 [cited by examiner]
US 20240160988A1 · Barber · 2024 [cited by examiner]
WO 2019002934A1 · 2019 [cited by applicant]
WO 2022150079A1 · 2022 [cited by applicant]
UK Search report mailed May 17, 2024 in GB2310012.6. [cited by applicant]
UK Search report mailed May 17, 2024 in GB2309996.3. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/GB2023/051972 mailed Oct. 9, 2023. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/GB2023/051971 mailed Oct. 12, 2023. [cited by applicant]
Xinyu Tan et al: “Scalable surface code decoders with parallelization in time”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Sep. 19, 2022 (23 Pages). [cited by applicant]
Shilin Huang et al: “Fault-Tolerant Weighted Union-Find Decoding on the Torie Code”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853 Apr. 9, 2020 (6 Pages). [cited by applicant]
Nicolas Delfosse et al: “Almost-linear time decoding algorithm for topological codes”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Nov. 23, 2021 (12 Pages). [cited by applicant]
Das Poulami et al: “AFS: Accurate, Fast, and Scalable Error-Decoding for Fault-Tolerant Quantum Computers”, 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), IEEE, Apr. 2, 2022 (15 Page… [cited by applicant]
U.S. Appl. No. 18/055,529, filed Nov. 15, 2022, Titled: Decoding Quantum Error Correction Codes, 32 pgs. [cited by applicant]