# US 2025/0061359 A1 · Clifford circuit forecasting without forward fault propagation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0061359 A1
- Document ID: US20250061359A1
- Status: Published application
- Kind: A1
- Application number: 18/449,260
- Filed: 2023-08-14
- Published: 2025-02-20
- Earliest claimed: 2023-08-14
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Nicolas Guillaume DELFOSSE; Adam Edward PAETZNICK
- Web page: https://patentgrep.com/patent/US20250061359A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method to forecast the result of a Clifford circuit acting on the qubits comprises: for a fault operator F acting on the qubits, precomputing a backward cumulant of the fault operator for each row u of binary matrices Ms and Ml, the backward cumulant reflecting an effect f=effm(F) on measurement outcomes of the qubits according to the Clifford circuit and fault operator; sampling the fault operator F for the qubits according to the predetermined noise distribution in the Clifford circuit; computing a syndrome s=Msf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ms; computing a set of logical flips f=Mlf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ml; and returning the result based on the syndrome and on the set of logical flips.

## Claims

### Claim 1

A method to forecast a result of a Clifford circuit acting on a plurality of qubits of a quantum computer, the Clifford circuit being subject to noise, the method comprising:
for a fault operator F acting on the plurality of qubits according to a predetermined noise distribution, precomputing a backward cumulant of the fault operator for each row u of binary matrices Ms and Ml, the backward cumulant reflecting an effect f=effm(F) on measurement outcomes of the plurality of qubits according to the Clifford circuit and the fault operator;
sampling the fault operator F for the plurality of qubits according to the predetermined noise distribution in the Clifford circuit;
computing a syndrome s=Msf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ms;
computing a set of logical flips f=Mlf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ml; and
returning the result based on the syndrome and on the set of logical flips.

### Claim 2 (depends on 1)

The method of claim 1 wherein the fault operator is sampled repeatedly, and for each sample a bit of the syndrome is computed for each row of Ms and the set of logical flips is computed for each row of Ml.

### Claim 3 (depends on 1)

The method of claim 1 further comprising applying a decoder D(s) which maps each syndrome s to a corresponding correction, wherein returning the result includes:
returning an indication of success when D(s)=f; and
returning an indication of failure when D(s)≠f.

### Claim 4 (depends on 1)

The method of claim 1 further comprising classical post-processing based on the set of logical flips f.

### Claim 5 (depends on 1)

The method of claim 1 wherein the Clifford circuit equates to a low-density parity-check (LDPC) spacetime code.

### Claim 6 (depends on 1)

The method of claim 1 wherein the Clifford circuit comprises a repeated, constant-depth circuit.

### Claim 7 (depends on 1)

The method of claim 1 wherein the syndrome and the set of logical flips are computed without explicit computation of a forward cumulant {right arrow over (F)} of the fault operator.

### Claim 8 (depends on 1)

The method of claim 1 wherein the syndrome and the set of logical flips are computed without explicit computation of the effect f=effm(F).

### Claim 9

A quantum computer comprising:
a qubit register with a plurality of physical qubits;
an interface configured to measure each of the plurality of qubits, to thereby reveal a quantum state held in the qubit register; and
a controller coupled operatively to the interface and configured to direct the measurement according to a spacetime quantum code supporting quantum error correction, the spacetime quantum code qualified by:
for a fault operator F acting on the plurality of qubits according to a predetermined noise distribution, precomputing a backward cumulant of the fault operator for each row u of binary matrices Ms and Ml, the backward cumulant reflecting an effect f=effm(F) on measurement outcomes of the plurality of qubits according to the Clifford circuit and the fault operator;
sampling the fault operator F for the plurality of qubits according to the predetermined noise distribution in the Clifford circuit;
computing a syndrome s=Msf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ms;
computing a set of logical flips f=Mlf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ml; and
returning the result based on the syndrome and on the set of logical flips.

### Claim 10 (depends on 9)

The quantum computer of claim 9 wherein the controller is further configured to apply a decoder D(s) which maps each syndrome s to a corresponding correction, wherein returning the result includes:
returning an indication of success when D(s)=f; and
returning an indication of failure when D(s)≠f.

### Claim 11 (depends on 9)

The quantum computer of claim 9 wherein the Clifford circuit equates to a low-density parity-check (LDPC) spacetime code.

### Claim 12 (depends on 9)

The quantum computer of claim 9 wherein the Clifford circuit comprises a repeated, constant-depth circuit.

### Claim 13 (depends on 9)

The quantum computer of claim 9 wherein the syndrome and the set of logical flips are computed without explicit computation of a forward cumulant F of the fault operator.

### Claim 14 (depends on 9)

The quantum computer of claim 9 wherein the syndrome and the set of logical flips are computed without explicit computation of the effect f=effm(F).

### Claim 15

A method for operating a quantum computer, the method comprising:
supplying an error-correcting spacetime code to a controller coupled operatively to a qubit interface of the quantum computer, the spacetime code being qualified by:
for a fault operator F acting on the plurality of qubits according to a predetermined noise distribution, precomputing a backward cumulant of the fault operator for each row u of binary matrices Ms and Ml, the backward cumulant reflecting an effect f=effm(F) on measurement outcomes of the plurality of qubits according to the Clifford circuit and the fault operator;
sampling the fault operator F for the plurality of qubits according to the predetermined noise distribution in the Clifford circuit;
computing a syndrome s=Msf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ms;
computing a set of logical flips f=Mlf corresponding to the effect based on a commutator of the backward cumulant versus a row of the binary matrix Ml; and
returning the result based on the syndrome and on the set of logical flips.

### Claim 16 (depends on 15)

The method of claim 15 further comprising applying a decoder D(s) which maps each syndrome s to a corresponding correction, wherein returning the result includes:
returning an indication of success when D(s)=f; and
returning an indication of failure when D(s)≠f.

### Claim 17 (depends on 15)

The method of claim 15 wherein the Clifford circuit equates to a low-density parity-check (LDPC) spacetime code.

### Claim 18 (depends on 15)

The method of claim 15 wherein the Clifford circuit comprises a repeated, constant-depth circuit.

### Claim 19 (depends on 15)

The method of claim 15 wherein the syndrome and the set of logical flips are computed without explicit computation of a forward cumulant {right arrow over (F)} of the fault operator.

### Claim 20 (depends on 15)

The method of claim 15 wherein the syndrome and the set of logical flips are computed without explicit computation of the effect f=effm(F).
