# US 2025/0156742 A1 · Applying quantum gates inside wire cuts

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

- Number: US 2025/0156742 A1
- Document ID: US20250156742A1
- Status: Published application
- Kind: A1
- Application number: 18/510,611
- Filed: 2023-11-15
- Published: 2025-05-15
- Earliest claimed: 2023-11-15
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Stefan Woerner; David Sutter
- Web page: https://patentgrep.com/patent/US20250156742A1

## CPC

- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- H03K 17/92: by the use, as active elements, of superconductive devices
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)

## Abstract

A computer-implemented method for quantum circuit knitting can divide a quantum circuit into two or more sub-circuits. The method includes receiving, on a classical computer, a quantum circuit, and separating, also on the classical computer, the quantum circuit into a first quantum circuit and a second quantum circuit. The separation occurs along a quantum gate and the first quantum circuit and second quantum circuit do not include the quantum gate. On a quantum computer, the first quantum circuit can be performed and a result can be obtained. On the classical computer, the quantum gate can be applied to the result, creating a modified result and, on a quantum computer, the second quantum circuit can be performed using the modified result. The method can reduce the sampling cost for cutting the quantum circuit as compared to conventional quantum circuit cutting techniques.

## Claims

### Claim 1

A computer-implemented method for quantum circuit knitting to divide a quantum circuit into two or more sub-circuits, comprising:
receiving, on a classical computer, a quantum circuit;
separating, on the classical computer, the quantum circuit into a first quantum circuit and a second quantum circuit, wherein the separation occurs along a quantum gate, and wherein the first quantum circuit and second quantum circuit do not include the quantum gate;
performing, on a quantum computer, the first quantum circuit and measuring a result;
applying, on the classical computer, the quantum gate to the result creating a modified result; and
performing, on the quantum computer, the second quantum circuit using the modified result.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the quantum gate is a 2-quibit gate.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the separation includes decomposing, on the classical computer, each of the first quantum circuit and the second quantum circuit into a weighted sum of measure and prepare channels.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the quantum gate is a Clifford gate.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, further comprising permuting the prepare channels according to an action of the Clifford gate on Pauli matrices.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the quantum gate is a non-Clifford gate.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the quantum gate is a multi-qubit quantum gate.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, further comprising allowing classical communication between the first quantum circuit and the second quantum circuit to reduce a sampling computational overhead.

### Claim 9

A computing device configured to build a quantum circuit, comprising:
a processor operating a qubit circuit compiler engine; and
a memory coupled to the processor, the memory storing instructions to cause the processor to perform acts comprising:
receiving, on a classical computer, a quantum circuit;
separating, on the classical computer, the quantum circuit into a first quantum circuit and a second quantum circuit, wherein the separation occurs along a quantum gate, and wherein the first quantum circuit and second quantum circuit do not include the quantum gate;
performing, on a quantum computer, the first quantum circuit and measuring a result;
applying, on the classical computer, the quantum gate to the result creating a modified result; and
performing, on the quantum computer, the second quantum circuit using the modified result.

### Claim 10 (depends on 9)

The computing device of claim 9, wherein quantum gate is a 2-quibit gate.

### Claim 11 (depends on 9)

The computing device of claim 9, wherein the separation includes decomposing, on the classical computer, each of the first quantum circuit and the second quantum circuit into a weighted sum of measure and prepare channels.

### Claim 12 (depends on 11)

The computing device of claim 11, wherein the quantum gate is a Clifford gate.

### Claim 13 (depends on 12)

The computing device of claim 12, wherein the instructions are further configured to permute the prepare channels according to an action of the quantum gate on Pauli matrices.

### Claim 14 (depends on 9)

The computing device of claim 9, wherein the quantum gate is a non-Clifford gate.

### Claim 15 (depends on 9)

The computing device of claim 9, wherein the quantum gate is a multi-qubit quantum gate.

### Claim 16 (depends on 9)

The computing device of claim 9, wherein the instructions are further configured to allow classical communication between the first quantum circuit and the second quantum circuit to reduce a sampling computational overhead.

### Claim 17

A computer program product for quantum circuit knitting to divide a quantum circuit into two or more sub-circuits, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to:
receiving, on a classical computer, a quantum circuit;
separating, on the classical computer, the quantum circuit into a first quantum circuit and a second quantum circuit, wherein the separation occurs along a quantum gate, and wherein the first quantum circuit and second quantum circuit do not include the quantum gate;
performing, on a quantum computer, the first quantum circuit and measuring a result;
applying, on the classical computer, the quantum gate to the result creating a modified result; and
performing, on the quantum computer, the second quantum circuit using the modified result.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the separation includes decomposing, on the classical computer, each of the first quantum circuit and the second quantum circuit into a weighted sum of measure and prepare channels.

### Claim 19 (depends on 18)

The computer program product of claim 18, wherein:
the quantum gate is a Clifford gate; and
the prepare channels are permuted according to an action of the Clifford gate on Pauli matrices.

### Claim 20 (depends on 17)

The computer program product of claim 17, wherein the instructions are further configured to allow classical communication between the first quantum circuit and the second quantum circuit to reduce a sampling computational overhead.
