IP Library Granted Patent US 12,425,049
Granted Patent B2
US 12,425,049 · App. 18/323,797 · Granted Sep 23, 2025

Maximum-likelihood decoding of quantum codes

Inventor: Theodore James Yoder (White Plains, NY)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
H03M13/1125H03M13/01H03M13/09
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,425,049
App. No.
18/323,797
Granted
Sep 23, 2025
Kind
B2
Abstract

Techniques regarding quantum error correction are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise a maximum-likelihood decoder component that executes a maximum-likelihood decoding algorithm to determine an error correction based on a decoding hypergraph that characterizes error-sensitive events associated with a quantum error-correcting code executed on a quantum circuit.

Claims (48)

1. A system, comprising:

a memory that stores computer executable components; and

a processor, operably coupled to the memory, and that executes at least one of the computer executable components that:

executes, using a quantum processor comprising qubits, a quantum error-correcting code on a quantum circuit;

generates a decoding hypergraph by mapping error-sensitive events associated with quantum measurements from the executing of the quantum error-correcting code on the quantum circuit to Pauli faults of the quantum circuit, wherein the decoding hypergraph comprises:

nodes respectively corresponding to the error-sensitive events, and

hyperedges, wherein each hyperedge connects a respective subset of the nodes respectively representing error-sensitive events associated with a respective Pauli fault of the Pauli faults, and wherein each hyperedge associated with the respective Pauli fault is generated by tracing the respective Pauli fault through the quantum circuit to determine a respective subset of error-sensitive events that are triggered by the respective Pauli fault; and

determines, based on the decoding hypergraph, at least one error correction for at least one of the error-sensitive events.

2. The system of claim 1 , wherein the at least one of the computer executable components further:

assigns probability values to the hyperedges and generates a probability distribution based on the probability values.

3. The system of claim 1 , wherein the at least one of the computer executable components further:

identifies the error-sensitive events by performing a Gottesman-Knill simulation of the quantum circuit.

4. The system of claim 1 , wherein the at least one of the computer executable components further:

identifies the error-sensitive events by employing flag qubits associated with second errors originating from first errors, wherein a second error is weighted higher than a first error from which the second error originated.

5. The system of claim 1 , wherein the error-sensitive events comprise linear combinations of syndrome measurement bits that would equate to zero in an ideal quantum circuit operation.

6. The system of claim 1 , wherein the tracing employs a Pauli depolarizing noise model.

7. The system of claim 1 , wherein the tracing employs a Gottesman-Knill simulation.

8. A computer-implemented method, comprising:

executing, by a system operatively coupled to a processor, using a quantum processor comprising qubits, a quantum error-correcting code on a quantum circuit;

generating, by the system, a decoding hypergraph by mapping error-sensitive events associated with quantum measurements from the executing of the quantum error-correcting code on the quantum circuit to Pauli faults of the quantum circuit, wherein the decoding hypergraph comprises:

nodes respectively corresponding to the error-sensitive events, and

hyperedges, wherein each hyperedge connects a respective subset of the nodes respectively representing error-sensitive events associated with a respective Pauli fault of the Pauli faults, and wherein each hyperedge associated with the respective Pauli fault is generated by tracing the respective Pauli fault through the quantum circuit to determine a respective subset of error-sensitive events that are triggered by the respective Pauli fault; and

determining, based on the decoding hypergraph, at least one error correction for at least one of the error-sensitive events.

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

assigning, by the system, probability values to the hyperedges; and

generating, by the system, a probability distribution based on the probability values.

10. The computer-implemented method of claim 8 , further comprising:

identifying, by the system, the error-sensitive events by performing a Gottesman-Knill simulation of the quantum circuit.

11. The computer-implemented method of claim 8 , further comprising:

identifying, by the system, the error-sensitive events by employing flag qubits associated with second errors originating from first errors, wherein a second error is weighted higher than a first error from which the second error originated.

12. The computer-implemented method of claim 8 , wherein the error-sensitive events comprise linear combinations of syndrome measurement bits that would equate to zero in an ideal quantum circuit operation.

13. The computer-implemented method of claim 8 , wherein the tracing employs a Pauli depolarizing noise model.

14. The computer-implemented method of claim 8 , wherein the tracing employs a Gottesman-Knill simulation.

15. A computer program product for quantum error correction, the computer program product comprising a non-transitory computer readable medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

execute, using a quantum processor comprising qubits, a quantum error-correcting code on a quantum circuit;

generate a decoding hypergraph by mapping error-sensitive events associated with quantum measurements from the executing of the quantum error-correcting code on the quantum circuit to Pauli faults of the quantum circuit, wherein the decoding hypergraph comprises:

nodes respectively corresponding to the error-sensitive events, and

hyperedges, wherein each hyperedge connects a respective subset of the nodes respectively representing error-sensitive events associated with a respective Pauli fault of the Pauli faults, and wherein each hyperedge associated with the respective Pauli fault is generated by tracing the respective Pauli fault through the quantum circuit to determine a respective subset of error-sensitive events that are triggered by the respective Pauli fault; and

determining, based on the decoding hypergraph, at least one error correction for at least one of the error-sensitive events.

16. The computer program product of claim 15 , wherein the program instructions further cause the processor to:

assign probability values to the hyperedges; and

generate a probability distribution based on the probability values.

17. The computer program product of claim 15 , wherein the program instructions further cause the processor to:

identify the error-sensitive events by performing a Gottesman-Knill simulation of the quantum circuit.

18. The computer program product of claim 15 , wherein the program instructions further cause the processor to:

identify the error-sensitive events by employing flag qubits associated with second errors originating from first errors, wherein a second error is weighted higher than a first error from which the second error originated.

19. The computer program product of claim 15 , wherein the error-sensitive events comprise linear combinations of syndrome measurement bits that would equate to zero in an ideal quantum circuit operation.

20. The computer program product of claim 15 , wherein the tracing employs a Pauli depolarizing noise model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 25, 2023
From: YODER, THEODORE JAMES
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 063764/0828 →
Continuity (2)
Continuation 17654545 · Mar 11, 2022
Related Publication 20230299791A1 · Sep 21, 2023
References Cited (59)
US 11334693B1 · Flammia · 2022 [cited by examiner]
US 20190044543A1 · Chamberland · 2019 [cited by examiner]
US 20200119748A1 · Lucarelli · 2020 [cited by applicant]
US 20200401927A1 · Nickerson · 2020 [cited by examiner]
US 20210019223A1 · Chamberland · 2021 [cited by examiner]
US 20210124640A1 · Nickerson · 2021 [cited by examiner]
US 20210194507A1 · Delfosse · 2021 [cited by examiner]
US 20210304053A1 · Pant · 2021 [cited by examiner]
US 20220101172A1 · Lee et al. · 2022 [cited by applicant]
US 20220180236A1 · Hann · 2022 [cited by examiner]
US 20220198312A1 · Delfosse · 2022 [cited by examiner]
US 20220216884A1 · Delfosse · 2022 [cited by examiner]
US 20230027698A1 · Hastings · 2023 [cited by examiner]
US 20230072535A1 · Upadhyay · 2023 [cited by examiner]
O. Fawzi, L. Groues and A. Leverrier, “Linear programming decoder for hypergraph product quantum codes,” 2020 IEEE Information Theory Workshop (ITW), Riva del Garda, Italy, 2021. [cited by examiner]
Poulin D., “Stabilizer Formalism for Operator Quantum Error Correction”, Physical Review Letters, vol. 95, 2005, 5 pages. [cited by applicant]
Dennis et al., “Topological Quantum Memory”, Journal of Mathematical Physics, vol. 43, No. 9, Sep. 2002, pp. 4452-4505. [cited by applicant]
Bombin et al., “Topological Quantum Distillation”, Physical Review Letters, vol. 97, 180501, 2006, 4 pages. [cited by applicant]
Piveteau et al., “Error Mitigation for Universal Gates on Encoded Qubits”, Physical Review Letters, vol. 127, Nov. 12, 2021, 11 pages. [cited by applicant]
Chamberland et al., “Fault-tolerant Quantum Computing in the Pauli or Clifford Frame With Slow Error Diagnostics”, Quantum, vol. 2, 2018, 11 pages. [cited by applicant]
Divincenzo et al., “Effective Fault-tolerant Quantum Computation With Slow Measurements”, Physical Review Letters, vol. 98, 2007, 4 pages. [cited by applicant]
Linke et al., “Fault-tolerant Quantum Error Detection”, Science Advances, vol. 3, No. 10, e1701074, Oct. 20, 2017, pp. 1-6. [cited by applicant]
Abobeih et al., “Fault-tolerant Operation of a Logical Qubit in a Diamond Quantum Processor”, arXiv:2108.01646 [condmat, physics:quant-ph], Aug. 3, 2021, 26 pages. [cited by applicant]
Takita et al., “Experimental Demonstration of Fault-tolerant State Preparation with Superconducting Qubits”, Physical Review Letters, vol. 119, Oct. 31, 2017, 11 pages. [cited by applicant]
Andersen et al., “Repeated Quantum Error Detection in a Surface Code”, Nature Physics, vol. 16, No. 8, 2020, 12 pages. [cited by applicant]
Chen et al., “Exponential Suppression of Bit or Phase Errors With Cyclic Error Correction”, Nature, vol. 595, Jul. 15, 2021, pp. 383-387. [cited by applicant]
Chen et al., “Calibrated Decoders for Experimental Quantum Error Correction”, arXiv preprint, arXiv:2110.04285v1 [quant-ph], Oct. 8, 2021, 17 pages. [cited by applicant]
Marques et al., “Logical-Qubit Operations in an Error-detecting Surface Code”, arXiv:2102.13071v1 [cond-mat, physics:quant-ph], Feb. 25, 2021, 16 pages. [cited by applicant]
Postler et al., “Demonstration of Fault-tolerant Universal Quantum Gate Operations”, arXiv:2111.12654v2 [quant-bh], Dec. 17, 2021, 14 pages. [cited by applicant]
Krinner et al., “Realizing Repeated Quantum Error Correction in a Distance-three Surface Code”, arXiv:2112.03708v1 [quant-ph], Dec. 7, 2021, 28 pages. [cited by applicant]
Zhao et al., “Realizing an Error-correcting Surface Code With Superconducting Qubits,” arXiv:2112.13505v2 [quant-oh], 2021, 10 pages. [cited by applicant]
Anderson et al., “Realization of Realtime Fault-tolerant Quantum Error Correction”, arXiv:2107.07505v1 [quant-ph], Jul. 15, 2021, 22 pages. [cited by applicant]
Egan et al., “Fault-tolerant Control of an Error-Corrected Qubit”, Nature, vol. 598, Oct. 14, 2021, pp. 281-286. [cited by applicant]
Bacon D., “Operator Quantum Error-correcting Subsystems for Self-correcting Quantum Memories”, Physical Review A, vol. 73, Jan. 30, 2006, 13 pages. [cited by applicant]
Chamberland et al., “Topological and Subsystem Codes on Low-degree Graphs With Flag Qubits”, Physical Review X, vol. 10, Jan. 31, 2020, 19 pages. [cited by applicant]
Fowler et al., “Towards Practical Classical Processing for the Surface Code”, Physical Review Letters, vol. 108, May 1, 2012, 4 pages. [cited by applicant]
Higgott O., “PyMatching: A Python Package for Decoding Quantum Codes With Minimum-weight Perfect Matching”. arXiv:2105.13082v2 [quant-ph], Jul. 12, 2021, 15 pages. [cited by applicant]
Dua et al., “Quantum Error Correction With Fractal Topological Codes”, arXiv:2201.03568v1, Jan. 10, 2022, 16 pages. [cited by applicant]
Higgott, et al., “Subsystem Codes with High Thresholds by Gauge Fixing and Reduced Qubit Overhead,” Phys. Rev. X 11, 031039—Published Aug. 19, 2021, 30 pages. [cited by applicant]
Mell et al., The NIST Definition of Cloud Computing, Recommendations of the National Institute of Standards and Technology, NIST Special Publication 800-145, Sep. 2011, 7 pages. [cited by applicant]
“Ibm Peekskill v2.0.0”, an IBM Quantum Falcon R8 processor, https://quantum-computing.ibm.com/, accessed Jan. 2022. [cited by applicant]
“IBM Quantum and Community”, Qiskit: An open-source framework for quantum computing, 2021. [cited by applicant]
Sundaresan et al., “Reducing Unitary and Spectator Errors in Cross Resonance with Optimized Rotary Echoes”, PRX Quantum, vol. 1, Dec. 7, 2020, 23 pages. [cited by applicant]
Byrd et al., “A Limited Memory Algorithm for Bound Constrained Optimization”, SIAM Journal on Scientific Computing, vol. 16, No. 5, Sep. 1995, pp. 1190-1208. [cited by applicant]
Hertzberg et al., “Laser-annealing Josephson Junctions for Yielding Scaled-up Superconducting Quantum Processors”, npj Quantum Information, vol. 7, 2021, 8 pages. [cited by applicant]
Wood et al., “Quantification and Characterization of Leakage Errors”, Physical Review A, vol. 97, Mar. 8, 2018, 17 pages. [cited by applicant]
Sank et al., “Measurement Induced State Transitions in a Superconducting Qubit: Beyond the Rotating Wave Approximation”, Physical Review Letters, vol. 117, Nov. 4, 2016, 6 pages. [cited by applicant]
Bravyi et al., “Mitigating Measurement Errors in Multiqubit Experiments”, Physical Review A, vol. 103, Apr. 9, 2021, 12 pages. [cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 17/654,545, dated Nov. 18, 2022, 86 pages. [cited by applicant]
Tillich et al., “Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to n 1/2”, Jan. 11, 2013, 21 pages. [cited by applicant]
Kovalev et al., “Improved Quantum Hypergraph-Product LDPC Codes,” IEEE International Symposium on Information Theory Proceedings, 2012, 5 pages. [cited by applicant]
Balakuntala et al., “Quantum Error Correction Using Hypergraph States”, PSG College of Technology, Department of Applied Mathematics and Computational Sciences, Sep. 12, 2017, 7 pages. [cited by applicant]
Garcia et al., “Quipu: High-performance Simulation of Quantum Circuits Using Stabilizer Frames,” IEEE, 2013, 7 pages. [cited by applicant]
Notice of Allowance received for U.S. Appl. No. 17/654,545, dated Mar. 15, 2023, 12 pages. [cited by applicant]
Pryadko Leonid P., “On Maximum-likelihood Decoding With Circuit Level Errors”, Quantum, vol. 4, Jul. 31, 2020, 15 pages. [cited by applicant]
Bravyi et al., “Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code”, Physical Review A, vol. 90, Sep. 25, 2014, 15 pages. [cited by applicant]
Gottesman Daniel, “The Heisenberg Representation of Quantum Computers”, arXiv preprint, quant-ph/9807006v1, Feb. 1, 2008, 20 pages. [cited by applicant]
Bravyi et al., “Doubled Color Codes”, arXiv:1509.03239v1 [quant-ph], Sep. 10, 2015, 53 pages. [cited by applicant]
Heim et al., “Optimal Circuit-Level Decoding for Surface Codes”, arXiv:1609.06373v1 [quantph], Sep. 20, 2016, 5 pages. [cited by applicant]