# US 2025/0094851 A1 · Multi-constraint qubit allocation method and quantum apparatus using the same

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

- Number: US 2025/0094851 A1
- Document ID: US20250094851A1
- Status: Published application
- Kind: A1
- Application number: 18/542,385
- Filed: 2023-12-15
- Published: 2025-03-20
- Earliest claimed: 2023-09-19
- Assignees: Postech Research and Business Development Foundation
- Applicants: POSTECH Research and Business Development Foundation
- Inventors: Seok Hyeong KANG; Sung Hye PARK; Jae Yoon SIM; Do Hun KIM
- Web page: https://patentgrep.com/patent/US20250094851A1

## 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
- 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

Disclosed is a multi-constraint qubit allocation method and a quantum apparatus using the same. The method comprises generating an interaction graph representing a quantum circuit on the basis of the number of two-qubit gates, determining edge weights between connected nodes in the interaction graph by introducing a fitting coefficient for a decay effect, searching for an isomorphic part, layout graph, between target hardware and the interaction graph by graph matching, and performing frequency matching for a layout graph by searching for frequency allocated to each location of qubits by limiting unidirectional movement on each of an x-axis and a y-axis of a hardware plane of the target hardware to a range from −1 to +1.

## Claims

### Claim 1

A multi-constraint qubit allocation (MCQA) method for a scalable quantum apparatus, the MCQA method comprising:
generating an interaction graph representing a quantum circuit on the basis of the number of two-qubit gates;
determining edge weights between connected nodes in the interaction graph by introducing a fitting coefficient for a decay effect;
searching for an isomorphic part, which is a layout graph, between a target hardware and the interaction graph by graph matching; and
performing frequency matching for a layout graph by searching for frequency patterns allocated to each location of qubits by limiting unidirectional movement on each of an x-axis and a y-axis of a hardware plane of the target hardware to a range from −1 to +1.

### Claim 2 (depends on 1)

The MCQA method of claim 1, wherein the searching for the isomorphic part comprises repeatedly searching for physical locations of logical qubits of the quantum circuit in descending order of edge weight.

### Claim 3 (depends on 1)

The MCQA method of claim 1, wherein the searching for the isomorphic part comprises repeatedly searching for physical locations of child nodes connected to a logical center node of a breadth-first search queue.

### Claim 4 (depends on 1)

The MCQA method of claim 1, wherein the performing of the frequency matching comprises additionally considering a layout graph which is symmetrical to the layout graph about the y-axis of the hardware plane.

### Claim 5 (depends on 1)

The MCQA method of claim 1, wherein the performing of the frequency matching comprises calculating a frequency allocated to each location of qubits based on the frequency period by repeating the arrangement of each frequency pattern.

### Claim 6 (depends on 5)

The MCQA method of claim 5, further comprising predicting a degree of parallelism of gates which are executable for all graphs obtained from searching for frequency patterns allocated to each location of qubits.

### Claim 7 (depends on 1)

The MCQA method of claim 1, further comprising determining an order of gates to be executed in a main mapping.

### Claim 8 (depends on 7)

The MCQA method of claim 7, wherein the determining of the order of the gates to be executed comprises determining the order of the gates to be executed using a qubit-based gate dependency list for the quantum circuit,
the gate dependency list, having connection lists with the same number as logical qubits, may include indices of gates and durations of the gates, and
the connection lists represent topological relationships between gates in the corresponding qubits.

### Claim 9 (depends on 8)

The MCQA method of claim 8, further comprising, when at least one gate of the quantum circuit does not satisfy a connectivity constraint, adding a swap gate or a move gate in front of the gate not satisfying the connectivity constraint.

### Claim 10 (depends on 9)

The MCQA method of claim 9, further comprising selecting a gate, either a swap gate or move gate, having a higher one of costs calculated for all candidate swap gates and move gates.

### Claim 11 (depends on 9)

The MCQA method of claim 9, further comprising, when at least one gate of the quantum circuit does not satisfy the connectivity constraint, converting the gate not satisfying the connectivity constraint into a bridge gate.

### Claim 12 (depends on 11)

The MCQA method of claim 11, wherein the bridge gate has a physical distance of 2.

### Claim 13 (depends on 7)

The MCQA method of claim 7, further comprising determining whether scheduled gates in the quantum circuit including the gates of which the order is determined are executable in a current time step.

### Claim 14 (depends on 13)

The MCQA method of claim 13, further comprising, when a frozen duration (FD) flag introduced to each logical qubit is 0, indicating that the corresponding qubit is not currently executing any scheduled gates, processing the corresponding qubit as the current scheduled gate, allowing it to proceed to the next gate execution.

### Claim 15 (depends on 13)

The MCQA method of claim 13, further comprising giving relatively high priority to two-qubit gates among the scheduled gates.

### Claim 16 (depends on 13)

The MCQA method of claim 13, further comprising giving relatively high priority to a gate having the longest critical path among the same type of gates in the scheduled gates.

### Claim 17 (depends on 13)

The MCQA method of claim 13, further comprising initializing frozen frequency (FF) flags introduced for physical qubits of quantum hardware to −1 and updating the FF flags according to frequency states.

### Claim 18 (depends on 17)

The MCQA method of claim 17, further comprising scheduling a two-qubit gate which is selected according to a priority of the FD flags, according to preset frequency adjustment rules.

### Claim 19 (depends on 18)

The MCQA method of claim 18, wherein the scheduling of the single-qubit gate comprises:
recording a first gate type of each frequency group;
updating the FF flags for all qubits belonging to the same frequency group;
comparing subsequent gates with the previously recorded gate type to determine whether the subsequent gates are of the previously recorded gate type and whether the FF flags are correctly set; and
scheduling only executable gates according to determination results.

### Claim 20 (depends on 7)

The MCQA method of claim 7, further comprising, before the generating of the interaction graph on the basis of the number of two-qubit gates, pre-processing an input or, after the main mapping, post-processing main mapping results,
wherein the pre-processing of the input or the post-processing of the main mapping results comprises converting two rotation operators applied to single qubits having different signs about the same axis of the Bloch sphere into an identity gate; or replacing consecutive rotation operators with a single rotation operator in which a sum of angles of gates forms a new angle.
