# US 2025/0199064 A1 · Detecting a Function Section in a Representation of a Quantum Circuit

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

- Number: US 2025/0199064 A1
- Document ID: US20250199064A1
- Status: Published application
- Kind: A1
- Application number: 19/053,410
- Filed: 2025-02-13
- Published: 2025-06-19
- Earliest claimed: 2022-08-04
- Assignees: Classiq Technologies Ltd.
- Applicants: Classiq Technologies LTD.
- Inventors: Amir Naveh; Shmuel Ur; Eyal Cornfeld; Ofek Kirzner; Nir Minerbi
- Web page: https://patentgrep.com/patent/US20250199064A1

## CPC

- G01R 31/31702: {Testing digital circuits including elements other than semiconductor transistors, e.g. biochips, nanofabrics, mems, chips with magnetic elements}
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 20/00: Machine learning
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method, apparatus, and product comprising: obtaining a representation of a quantum circuit; determining that a qubit is a candidate auxiliary qubit by estimating that a state of the qubit at a first cycle is identical to a state of the qubit at a second cycle; identifying a function section in the quantum circuit based on the qubit, the function section commencing at a beginning cycle, the beginning cycle is ordered before the second cycle, the function section ending at an ending cycle, the ending cycle is ordered after the first cycle, the ending cycle is ordered after the commencing cycle, the function section utilizing the qubit as an auxiliary qubit; and outputting an indication of the function section.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method comprising:
obtaining a representation of a quantum circuit, the quantum circuit is configured to manipulate a plurality of qubits over a plurality of cycles using a plurality of gates, the plurality of cycles comprising a first cycle and a second cycle, the second cycle is ordered after the first cycle, the plurality of qubits comprising a qubit;
detecting one or more swap and identity patterns in the quantum circuit;
identifying a function section in the quantum circuit based on a qubit, the function section commencing at a beginning cycle, the beginning cycle is ordered before the second cycle, the function section ending at an ending cycle, the ending cycle is ordered after the first cycle, the ending cycle is ordered after the commencing cycle, the function section utilizing the qubit as an auxiliary qubit, wherein said identifying the function section is performed while ignoring the one or more swap and identity patterns; and
outputting an indication of the function section.

### Claim 22 (depends on 21)

The method of claim 21, wherein the qubit is estimated to have a state at the first cycle that is identical to the state of the qubit at the second cycle.

### Claim 23 (depends on 21)

The method of claim 21, further comprises verifying that the qubit is an auxiliary qubit of the quantum circuit.

### Claim 24 (depends on 21)

The method of claim 21, further comprises providing a visual marking of the representation of the quantum circuit that identifies the one or more swap and identity patterns.

### Claim 25 (depends on 21)

The method of claim 21, wherein in response to said detecting, modifying the representation of the quantum circuit by removing the one or more swap and identity patterns from the representation of the quantum circuit.

### Claim 26 (depends on 21)

The method of claim 21, wherein said identifying the function section comprises performing a forward light-cone analysis of the qubit from the first cycle and a backward light-cone analysis of the qubit from the second cycle, the function section comprising an intersection between the forward light-cone analysis and the backward light-cone analysis.

### Claim 27 (depends on 26)

The method of claim 26, wherein said identifying the function section comprises:
iteratively searching for a next qubit that is associated with the intersection, the next qubit is characterized in being estimated to have a same value at a third cycle and at a fourth cycle, the fourth cycle is ordered after the third cycle, wherein at least one cycle between the third and fourth cycles is included in the intersection; and
performing a forward light-cone analysis of the next qubit from the third cycle and a backward light-cone analysis of the next qubit from the fourth cycle, whereby identifying a second intersection, the function section comprising the second intersection.

### Claim 28 (depends on 21)

The method of claim 21, wherein said identifying the function section comprises iteratively performing, starting with the qubit, a forward light-cone analysis of one or more qubits or gates included in the first cycle and a backward light-cone analysis of one or more qubits or gates included in the second cycle, until no additional qubits or gates are identified in an intersection of the forward light-cone analysis and the backward light-cone analysis, the function section comprising one or more qubits or gates identified in the intersection.

### Claim 29 (depends on 21)

The method of claim 21, wherein the first and second cycles are not adjacent cycles, wherein at least one intermediate cycle separates the first and second cycles, wherein a state of the qubit at the at least one intermediate cycle is different from the state of the qubit at the first cycle.

### Claim 30 (depends on 21)

The method of claim 21, wherein the quantum circuit is a circuit being reverse engineered without having access to a quantum program from which the quantum circuit was synthesized.

### Claim 31

An apparatus comprising a processor and coupled memory, said processor being adapted to:
obtain a representation of a quantum circuit, the quantum circuit is configured to manipulate a plurality of qubits over a plurality of cycles using a plurality of gates, the plurality of cycles comprising a first cycle and a second cycle, the second cycle is ordered after the first cycle, the plurality of qubits comprising a qubit;
detect one or more swap and identity patterns in the quantum circuit;
identify a function section in the quantum circuit based on a qubit, the function section commencing at a beginning cycle, the beginning cycle is ordered before the second cycle, the function section ending at an ending cycle, the ending cycle is ordered after the first cycle, the ending cycle is ordered after the commencing cycle, the function section utilizing the qubit as an auxiliary qubit, wherein identifying the function section is performed while ignoring the one or more swap and identity patterns; and
output an indication of the function section.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein the qubit is estimated to have a state at the first cycle that is identical to the state of the qubit at the second cycle.

### Claim 33 (depends on 31)

The apparatus of claim 31, wherein said processor is further configured to verify that the qubit is an auxiliary qubit of the quantum circuit.

### Claim 34 (depends on 31)

The apparatus of claim 31, wherein said processor is further configured to provide a visual marking of the representation of the quantum circuit that identifies the one or more swap and identity patterns.

### Claim 35 (depends on 31)

The apparatus of claim 31, wherein said processor is configured to modify the representation of the quantum circuit by removing the one or more swap and identity patterns from the representation of the quantum circuit, wherein the representation of the quantum circuit is modified in response to the detection of the one or more swap and identity patterns.

### Claim 36 (depends on 31)

The apparatus of claim 31, wherein the function section is identified by performing a forward light-cone analysis of the qubit from the first cycle and a backward light-cone analysis of the qubit from the second cycle, the function section comprising an intersection between the forward light-cone analysis and the backward light-cone analysis.

### Claim 37 (depends on 36)

The apparatus of claim 36, wherein the function section is identified by:
iteratively searching for a next qubit that is associated with the intersection, the next qubit is characterized in being estimated to have a same value at a third cycle and at a fourth cycle, the fourth cycle is ordered after the third cycle, wherein at least one cycle between the third and fourth cycles is included in the intersection; and
performing a forward light-cone analysis of the next qubit from the third cycle and a backward light-cone analysis of the next qubit from the fourth cycle, whereby identifying a second intersection, the function section comprising the second intersection.

### Claim 38 (depends on 31)

The apparatus of claim 31, wherein the first and second cycles are not adjacent cycles, wherein at least one intermediate cycle separates the first and second cycles, wherein a state of the qubit at the at least one intermediate cycle is different from the state of the qubit at the first cycle.

### Claim 39 (depends on 31)

The apparatus of claim 31, wherein the quantum circuit is a circuit being reverse engineered without having access to a quantum program from which the quantum circuit was synthesized.

### Claim 40

SA computer program product comprising a non-transitory computer readable medium retaining program instructions, which program instructions when read by a processor, cause the processor to:
obtain a representation of a quantum circuit, the quantum circuit is configured to manipulate a plurality of qubits over a plurality of cycles using a plurality of gates, the plurality of cycles comprising a first cycle and a second cycle, the second cycle is ordered after the first cycle, the plurality of qubits comprising a qubit;
detect one or more swap and identity patterns in the quantum circuit;
identify a function section in the quantum circuit based on a qubit, the function section commencing at a beginning cycle, the beginning cycle is ordered before the second cycle, the function section ending at an ending cycle, the ending cycle is ordered after the first cycle, the ending cycle is ordered after the commencing cycle, the function section utilizing the qubit as an auxiliary qubit, wherein identifying the function section is performed while ignoring the one or more swap and identity patterns; and
output an indication of the function section.
