Scalable surface code decoders with parallelization in time
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.
1. 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.
2. The method of claim 1 , wherein:
the decoder graph comprises includes vertices corresponding to real detectors, a first pair of the real detectors being connected by a first edge when a first fault in a first data qubit of the surface code flips a value of both real detectors in the first pair.
3. The method of claim 2 , wherein:
the decoder graph further includes vertices corresponding to imaginary detectors, a second pair including an imaginary detector and a real detector being connected by a second edge when a second fault in a second data qubit of the surface code flips, among the real detectors, only a value of the real detector in the second pair.
4. The method of claim 1 , wherein:
the decoder graph is a z-type decoder graph having closed temporal boundaries and open spatial boundaries.
5. The method of claim 1 , wherein:
retaining the first corrections on the core region of the first decoder window creates a fault on the first boundary; and
the second corrections annihilate the created fault on the first boundary.
6. The method of claim 1 , wherein:
the second decoder window is a 2D decoder graph.
7. The method of claim 1 , further comprising:
determining third corrections that annihilate faults within a third decoder window on the decoder graph, the third decoder window having two open time boundaries;
retaining third corrections on a core region of the third decoder window, the core region having a third boundary; and
wherein a second one of the two closed time boundaries is the third boundary.
8. The method of claim 7 , wherein:
the second one of the two closed time boundaries corresponds to an earlier cycle of detectors than the first one of the two closed time boundaries.
9. The method of claim 1 , wherein:
determining the first corrections comprises applying a union-find (UF) decoder or a minimum-weight perfect matching (MWPM) decoder to the first decoder window.
10. The method of claim 1 , further comprising:
determining corrections for multiple decoding windows having open temporal boundaries at least partially in parallel, the corrections including the first corrections.
11. 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.
12. The system of claim 11 , wherein:
the decoder graph comprises includes vertices corresponding to real detectors, a first pair of the real detectors being connected by a first edge when a first fault in a first data qubit of the surface code flips a value of both real detectors in the first pair.
13. The system of claim 12 , wherein:
the decoder graph further includes vertices corresponding to imaginary detectors, a second pair including an imaginary detector and a real detector being connected by a second edge when a second fault in a second data qubit of the surface code flips, among the real detectors, only a value of the real detector in the second pair.
14. The system of claim 11 , wherein:
the decoder graph is a z-type decoder graph having closed temporal boundaries and open spatial boundaries.
15. The system of claim 11 , wherein:
retaining the first corrections on the core region of the first decoder window creates a fault on the first boundary; and
the second corrections annihilate the created fault on the first boundary.
16. The system of claim 11 , wherein:
the second decoder window is a 2D decoder graph.
17. The system of claim 11 , wherein the performance of the quantum computation further includes:
determining third corrections that annihilate faults within a third decoder window on the decoder graph, the third decoder window having two open time boundaries;
retaining third corrections on a core region of the third decoder window, the core region having a third boundary; and
wherein a second one of the two closed time boundaries is the third boundary.
18. The system of claim 17 , wherein:
the second one of the two closed time boundaries corresponds to an earlier cycle of detectors than the first one of the two closed time boundaries.
19. The system of claim 11 , wherein:
determining the first corrections comprises applying a union-find (UF) decoder or a minimum-weight perfect matching (MWPM) decoder to the first decoder window.
20. The system of claim 11 , wherein the performance of the quantum computation further includes:
determining corrections for multiple decoding windows having open temporal boundaries at least partially in parallel, the corrections including the first corrections.