Granted Patent B2

US 12,437,227 · App. 18/536,051 · Granted Oct 7, 2025

Inventors: Vadym Kliuchnikov (Redmond, WA); Michael Edward Beverland (Seattle, WA)

Assignee: Microsoft Technology Licensing, LLC

G06N10/70G06N10/20G06N10/40

Abstract

Claims (101)

1. A computing system comprising:

one or more processing devices configured to:

identify one or more severe hook faults in a stabilizer channel configured to be implemented at a quantum computing device, wherein identifying the one or more severe hook faults includes:

receiving a circuit channel check matrix of the stabilizer channel, wherein:

columns of the circuit channel check matrix indicate values of checks associated with respective elementary faults of the stabilizer channel;

the checks specify parities of respective measurement outcome subsets of outcome vector elements included in a channel outcome vector of the stabilizer channel; and

each of the checks indicates whether the corresponding elementary fault has occurred at the stabilizer channel;

receiving a phenomenological channel check matrix of the stabilizer channel as a sub-matrix of the circuit channel check matrix;

receiving a logical effect matrix of the stabilizer channel;

receiving a weight vector that indicates respective probability weights of the elementary faults; and

based at least in part on the circuit channel check matrix, the logical effect matrix, the phenomenological channel check matrix, and the weight vector, computing one or more column indices of respective columns of the circuit channel check matrix that correspond to the one or more severe hook faults;

output an indication of the one or more severe hook faults; and

perform quantum error correction at the quantum computing device based at least in part on the indication of the one or more severe hook faults.

2. The computing system of claim 1 , wherein the one or more processing devices are configured to compute the one or more column indices at least in part by:

initializing a column index list as an empty list; and

for each of the columns of the circuit channel check matrix that are not columns of the phenomenological channel check matrix:

determining whether the elementary fault associated with that column is a severe hook fault; and

if the elementary fault is a severe hook fault, adding an index of that column to the column index list.

3. The computing system of claim 2 , wherein the one or more processing devices are configured to determine whether the elementary fault is a severe hook fault at least in part by:

based at least in part on the circuit channel check matrix, the logical effect matrix, and the weight vector, computing a respective probability weight of a minimal-weight non-trivial undetectable fault of the stabilizer channel;

computing a modified weight vector in which the probability weight corresponding to the elementary fault is divided by a predefined weight quotient;

computing a modified weight of the minimal-weight non-trivial undetectable fault based at least in part on the circuit channel check matrix, the logical effect matrix, and the modified weight vector; and

determine that the elementary fault is a severe hook fault if the modified weight is equal to the probability weight of the minimal-weight non-trivial undetectable fault, minus the probability weight of the elementary fault times one minus the predefined weight quotient.

4. The computing system of claim 3 , wherein the minimal-weight non-trivial undetectable fault is a fault with a lowest probability weight among the faults of the stabilizer channel that have syndromes equal to zero.

5. The computing system of claim 3 , wherein the one or more processing devices are configured to determine the probability weight of the minimal-weight non-trivial undetectable fault at least in part by:

computing a syndrome graph based at least in part on the circuit channel check matrix, wherein edges included in the syndrome graph have respective edge weights and error values; and

computing the probability weight of the minimal-weight non-trivial undetectable fault as a minimum edge weight of a cycle of the syndrome graph that has a nonzero total error value.

6. The computing system of claim 1 , wherein the one or more severe hook faults are one or more hook faults that overlap with one or more respective minimal-weight non-trivial undetectable faults.

7. The computing system of claim 6 , wherein:

the plurality of elementary faults of the stabilizer channel include a plurality of phenomenological noise elementary faults and a plurality of circuit noise elementary faults; and

the one or more hook faults are one or more circuit noise elementary faults that have respective syndromes and logical effects that differ from those of each of the phenomenological noise elementary faults.

8. The computing system of claim 7 , wherein:

the plurality of phenomenological noise elementary faults include:

a first plurality of one-qubit Pauli errors respectively associated with idle instructions; and

a first plurality of outcome flips respectively associated with measurement instructions; and

the plurality of circuit noise elementary faults include:

a second plurality of one-qubit Pauli errors respectively associated with single-qubit stabilizer instructions;

a plurality of two-qubit Pauli errors respectively associated with two-qubit stabilizer instructions; and

a second plurality of outcome flips respectively associated with measurement instructions.

9. The computing system of claim 1 , wherein:

the checks associated with the elementary faults are parities of respective measurement outcome subsets of the stabilizer channel; and

when no faults occur at the stabilizer channel:

each of the checks is equal to zero; or

each of the checks is equal to one.

10. The computing system of claim 1 , wherein the probability weights of the elementary faults are each computed as a difference between:

a logarithm of a probability that no fault occurs at the stabilizer channel; and

a logarithm of a probability that the elementary fault occurs at the stabilizer channel.

11. The computing system of claim 1 , wherein:

the logical effect matrix encodes a respective logical effect of each of the elementary faults of the stabilizer channel; and

each of the logical effects is a bit vector that encodes an effect of the corresponding elementary fault on logical information that is stored in output qubits of the stabilizer channel and is extracted via inferring logical measurements outcomes from circuit outcomes of the stabilizer channel.

12. A method for use with a computing system, the method comprising:

identifying one or more severe hook faults in a stabilizer channel configured to be implemented at a quantum computing device, wherein identifying the one or more severe hook faults includes:

receiving a circuit channel check matrix of the stabilizer channel, wherein:

columns of the circuit channel check matrix indicate values of checks associated with respective elementary faults of the stabilizer channel;

the checks specify parities of respective measurement outcome subsets of outcome vector elements included in a channel outcome vector of the stabilizer channel; and

each of the checks indicates whether the corresponding elementary fault has occurred at the stabilizer channel;

receiving a phenomenological channel check matrix of the stabilizer channel as a sub-matrix of the circuit channel check matrix;

receiving a logical effect matrix of the stabilizer channel;

receiving a weight vector that indicates respective probability weights of the elementary faults; and

based at least in part on the circuit channel check matrix, the logical effect matrix, the phenomenological channel check matrix, and the weight vector, computing one or more column indices of respective columns of the circuit channel check matrix that correspond to the one or more severe hook faults;

outputting an indication of the one or more severe hook faults; and

performing quantum error correction at the quantum computing device based at least in part on the indication of the one or more severe hook faults.

13. The method of claim 12 , wherein computing the one or more column indices includes:

initializing a column index list as an empty list; and

for each of the columns of the circuit channel check matrix that are not columns of the phenomenological channel check matrix:

determining whether the elementary fault associated with that column is a severe hook fault; and

if the elementary fault is a severe hook fault, adding an index of that column to the column index list.

14. The method of claim 13 , wherein determining whether the elementary fault is a severe hook fault includes:

based at least in part on the circuit channel check matrix, the logical effect matrix, and the weight vector, computing a respective probability weight of a minimal-weight non-trivial undetectable fault of the stabilizer channel;

computing a modified weight vector in which the probability weight corresponding to the elementary fault is divided by a predefined weight quotient;

computing a modified weight of the minimal-weight non-trivial undetectable fault based at least in part on the circuit channel check matrix, the logical effect matrix, and the modified weight vector; and

determining that the elementary fault is a severe hook fault if the modified weight is equal to the probability weight of the minimal-weight non-trivial undetectable fault, minus the probability weight of the elementary fault times one minus the predefined weight quotient.

15. The method of claim 14 , wherein the minimal-weight non-trivial undetectable fault is a fault with a lowest probability weight among the faults of the stabilizer channel that have syndromes equal to zero.

16. The method of claim 14 , wherein determining the probability weight of the minimal-weight non-trivial undetectable fault includes:

computing a syndrome graph based at least in part on the circuit channel check matrix, wherein edges included in the syndrome graph have respective edge weights and error values; and

computing the probability weight of the minimal-weight non-trivial undetectable fault as a minimum edge weight of a cycle of the syndrome graph that has a nonzero total error value.

17. The method of claim 12 , wherein:

the one or more severe hook faults are one or more hook faults that overlap with one or more respective minimal-weight non-trivial undetectable faults;

the plurality of elementary faults of the stabilizer channel include a plurality of phenomenological noise elementary faults and a plurality of circuit noise elementary faults; and

the one or more hook faults are one or more circuit noise elementary faults that have respective syndromes and logical effects that differ from those of each of the phenomenological noise elementary faults.

18. The method of claim 12 , wherein the probability weights of the elementary faults are each computed as a difference between:

a logarithm of a probability that no fault occurs at the stabilizer channel; and

a logarithm of a probability that the elementary fault occurs at the stabilizer channel.

19. The method of claim 12 , wherein:

the logical effect matrix encodes a respective logical effect of each of the elementary faults of the stabilizer channel; and

each of the logical effects is a bit vector that encodes an effect of the corresponding elementary fault on logical information that is stored in output qubits of the stabilizer channel and is extracted via inferring logical measurements outcomes from circuit outcomes of the stabilizer channel.

20. A computing system comprising:

one or more processing devices configured to:

identify one or more severe hook faults in a stabilizer channel configured to be implemented at a quantum computing device, wherein identifying the one or more severe hook faults includes:

receiving a circuit channel check matrix of the stabilizer channel, wherein:

columns of the circuit channel check matrix indicate values of checks associated with respective circuit noise elementary faults of the stabilizer channel;

the checks specify parities of respective measurement outcome subsets of outcome vector elements included in a channel outcome vector of the stabilizer channel; and

each of the checks indicates whether the corresponding elementary fault has occurred at the stabilizer channel;

receiving a phenomenological channel check matrix of the stabilizer channel as a sub-matrix of the circuit channel check matrix, wherein columns of the phenomenological channel check matrix indicate values of checks associated with respective phenomenological noise elementary faults of the stabilizer channel;

receiving a logical effect matrix of the stabilizer channel;

receiving a weight vector that indicates respective probability weights of the elementary faults; and

based at least in part on the circuit channel check matrix, the logical effect matrix, the phenomenological channel check matrix, and the weight vector, computing one or more column indices of respective columns of the circuit channel check matrix that correspond to the one or more severe hook faults, wherein computing the one or more column indices includes:

identifying one or more columns of the circuit channel check matrix that are not columns of the phenomenological channel check matrix; and

for each of the one or more identified columns of the circuit channel check matrix, determining whether the corresponding circuit noise elementary fault is a severe hook fault based at least in part on the probability weight of that circuit noise elementary fault;

output an indication of the one or more severe hook faults; and

perform quantum error correction at the quantum computing device based at least in part on the indication of the one or more severe hook faults.

Assignments (1)

Continuity (1)

References Cited (16)