US 12,301,251 B2 · Scalable surface code decoders with parallelization in time

Abstract

Scalable, parallelizable quantum error correction on surface codes can be performed using a decoder graph. Overlapping decoder graph windows can be generated using the decoder graph. First corrections can be independently determined for each of the overlapping decoder graph windows. First core corrections can be retained for core regions of each of the overlapping decoder graph windows. Non-overlapping decoder graph windows can be generated using the decoder graph. The temporal boundaries of the non-overlapping decoder graph windows can be the temporal boundaries of the corrected core regions of the overlapping decoder graph windows. Second corrections can be independently determined for each of the non-overlapping decoder graph windows based on the temporal boundaries of the corrected core regions. The first core corrections and the second corrections can be combined to form a complete set of corrections for the decoder graph.

Claims20

Dependent claims

A method of quantum computation, comprising:

performing a quantum computation using a surface code, performance of the quantum computation including:
determination of error correction information for the quantum computation, the determination comprising:
obtaining multiple cycles of error syndromes for the surface code;
determining first corrections that annihilate faults within a first decoder window on a decoder graph generated using the error syndromes, the first decoder window having two open time boundaries;
retaining first corrections on a core region of the first decoder window, the core region having a first boundary;
determining second corrections that annihilate faults within a second decoder window on the decoder graph, the second decoder window having two closed time boundaries, a first one of the two closed time boundaries being the first boundary;
and
wherein the error correction information includes or depends upon the first and second corrections;
measuring a result of the quantum computation;
and
correcting the result of the quantum computation using the error correction information.

8 more elements

A system for quantum computation, comprising:

at least one processor;
and
at least one computer readable medium containing instructions that, when executed by the at least one processor, cause the system to perform a quantum computation using a surface code, performance of the quantum computation including:
determination of error correction information for the quantum computation, the determination comprising:
obtaining multiple cycles of error syndromes for the surface code;
determining first corrections that annihilate faults within a first decoder window on a decoder graph generated using the error syndromes, the first decoder window having two open time boundaries;
retaining first corrections on a core region of the first decoder window, the core region having a first boundary;
determining second corrections that annihilate faults within a second decoder window on the decoder graph, the second decoder window having two closed time boundaries, a first one of the two closed time boundaries being the first boundary;
and
wherein the error correction information includes or depends upon the first and second corrections;
measuring a result of the quantum computation;
and
correcting the result of the quantum computation using the error correction information.

10 more elements

Dependencies are inferred from the claim text.

Scalable surface code decoders with parallelization in time

Life of this patent

Scalable surface code decoders with parallelization in time

Life of this patent

Abstract

Claims20