# US 2025/0148335 A1 · Frequency plan generator for multi-qubit processors

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

- Number: US 2025/0148335 A1
- Document ID: US20250148335A1
- Status: Published application
- Kind: A1
- Application number: 18/501,113
- Filed: 2023-11-03
- Published: 2025-05-08
- Earliest claimed: 2023-11-03
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Eric Zhang; Jared Barney Hertzberg; Jason S. Orcutt
- Web page: https://patentgrep.com/patent/US20250148335A1

## CPC

- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

With a computerized frequency plan generator, for each node in a quantum lattice: determine a list of possible frequencies subject to at least one of nearest neighbor and next nearest neighbor collision constraints; and assign a highest possible frequency; apply a collision cleaning routine to the quantum lattice with the assigned frequencies until at least one of a condition where there are no remaining collisions and a condition where collision count ceases to improve; and apply a frequency perturbation routine to the collision-cleaned quantum lattice to move apart at least one of a high-risk nearest neighbor collision and a high risk next nearest neighbor collision.

## Claims

### Claim 1

A method comprising, with a computerized frequency plan generator:
for each node in a quantum lattice:
determining a list of possible frequencies subject to at least one of nearest neighbor and next nearest neighbor collision constraints; and
assigning a highest possible frequency;
applying a collision cleaning routine to the quantum lattice with the assigned frequencies until at least one of a condition where there are no remaining collisions and a condition where collision count ceases to improve; and
applying a frequency perturbation routine to the collision-cleaned quantum lattice to move apart at least one of a high-risk nearest neighbor collision and a high risk next nearest neighbor collision.

### Claim 2 (depends on 1)

The method of claim 1, further comprising, subsequent to application of the collision cleaning routine, and prior to the application of the frequency perturbation routine, carrying out a tuning minimization routine on the quantum lattice to minimize a required tuning distance.

### Claim 3 (depends on 2)

The method of claim 2, wherein the nodes comprise individual qubits, and wherein the tuning minimization routine comprises:
ranking each qubit in the quantum lattice in order of tuning distance to obtain a ranked list;
for each given qubit in the ranked list, beginning with a top ranked qubit, iteratively assigning a highest frequency level to the given qubit that is possible to achieve without introducing additional collisions, and removing the qubit from the ranked list, to obtain a minimum frequency assignment.

### Claim 4 (depends on 1)

The method of claim 1, wherein the collision cleaning routine comprises:
listing all collision pairs for the quantum lattice for a plurality of user-defined collision types;
for each collision pair in the list of collision pairs, beginning with a top collision pair:
listing possible collision-free frequency levels;
assigning a highest viable frequency that reduces collision count; and
removing the corresponding collision pair from the list of collision pairs.

### Claim 5 (depends on 1)

The method of claim 1, wherein the frequency perturbation routine comprises, for a predetermined number of iterations:
performing a Monte Carlo collision analysis on the quantum lattice to identify a most significant collision type;
for the identified most significant collision type, identifying at least one of a highest risk nearest neighbor pair and a highest risk next nearest neighbor pair based on a corresponding frequency difference; and
perturbing the identified at least one of a highest risk nearest neighbor pair and a highest risk next nearest neighbor pair by a predetermined incremental frequency subject to a corresponding qubit frequency tuning range.

### Claim 6 (depends on 1)

The method of claim 1, further comprising carrying out tuning plan initialization prior to the determining and assigning steps, by
determining the quantum lattice and an adjacency matrix based on a template file, such that lattice size, geometry, and connectivity are determined;
specifying:
tuning parameters, which determine how the frequencies are to be assigned, and
frequency predictions based on junction resistances; and
specifying collision parameters providing collision types and bounds for the collisions.

### Claim 7 (depends on 1)

The method of claim 1, wherein the determining and assigning steps for each node in the quantum lattice are carried out in accordance with a recursive lattice stepping routine that enhances continuity of a stepping path through the quantum lattice.

### Claim 8 (depends on 1)

The method of claim 1, wherein the nodes in the quantum lattice include qubits and at least one tunable element other than a qubit, further comprising defining lattice characteristics, including at least the collision constraints, which take into account operating characteristics of both the qubits and the at least one tunable element other than a qubit.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
for each chip of a plurality of available chips to be populated into a modular device, repeating the determining, assigning, collision cleaning, and frequency perturbation steps to obtain a frequency plan for each chip of the plurality of available chips;
based on the frequency plans for each chip of the plurality of available chips, ranking the plurality of available chips based on yield;
assigning a top-ranked one of the chips to the modular device; and
iteratively, until the modular device is completely populated with chips, for each remaining chip of the plurality of available chips, finding a highest-ranked neighbor candidate compatible with the top-ranked one of the chips and assigning the highest-ranked neighbor candidate to the modular device.

### Claim 10 (depends on 1)

The method of claim 1, further comprising facilitating tuning physical qubits in accordance with a frequency tuning plan based on the quantum lattice with the frequency perturbation routine applied.

### Claim 11 (depends on 10)

The method of claim 10, wherein the tuning comprises LASIQ (Laser Annealing of Stochastically Impaired Qubits) tuning.

### Claim 12

A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
for each node in a quantum lattice:
determining a list of possible frequencies subject to at least one of nearest neighbor and next nearest neighbor collision constraints; and
assigning a highest possible frequency;
applying a collision cleaning routine to the quantum lattice with the assigned frequencies until at least one of a condition where there are no remaining collisions and a condition where collision count ceases to improve; and
applying a frequency perturbation routine to the collision-cleaned quantum lattice to move apart at least one of a high-risk nearest neighbor collision and a high risk next nearest neighbor collision.

### Claim 13

A system comprising:
a memory; and
at least one processor, coupled to said memory, and operative to:
for each node in a quantum lattice:
determine a list of possible frequencies subject to at least one of nearest neighbor and next nearest neighbor collision constraints; and
assign a highest possible frequency;
apply a collision cleaning routine to the quantum lattice with the assigned frequencies until at least one of a condition where there are no remaining collisions and a condition where collision count ceases to improve; and
apply a frequency perturbation routine to the collision-cleaned quantum lattice to move apart at least one of a high-risk nearest neighbor collision and a high risk next nearest neighbor collision.

### Claim 14 (depends on 13)

The system of claim 13, wherein the at least one processor is further operative to, subsequent to application of the collision cleaning routine, and prior to the application of the frequency perturbation routine, carry out a tuning minimization routine on the quantum lattice to minimize a required tuning distance.

### Claim 15 (depends on 14)

The system of claim 14, wherein the nodes comprise individual qubits, and wherein the tuning minimization routine comprises:
ranking each qubit in the quantum lattice in order of tuning distance to obtain a ranked list;
for each given qubit in the ranked list, beginning with a top ranked qubit, iteratively assigning a highest frequency level to the given qubit that is possible to achieve without introducing additional collisions, and removing the qubit from the ranked list, to obtain a minimum frequency assignment.

### Claim 16 (depends on 13)

The system of claim 13, wherein the collision cleaning routine comprises:
listing all collision pairs for the quantum lattice for a plurality of user-defined collision types;
for each collision pair in the list of collision pairs, beginning with a top collision pair:
listing possible collision-free frequency levels;
assigning a highest viable frequency that reduces collision count; and
removing the corresponding collision pair from the list of collision pairs.

### Claim 17 (depends on 13)

The system of claim 13, wherein the frequency perturbation routine comprises, for a predetermined number of iterations:
performing a Monte Carlo collision analysis on the quantum lattice to identify a most significant collision type;
for the identified most significant collision type, identifying at least one of a highest risk nearest neighbor pair and a highest risk next nearest neighbor pair based on a corresponding frequency difference; and
perturbing the identified at least one of a highest risk nearest neighbor pair and a highest risk next nearest neighbor pair by a predetermined incremental frequency subject to a corresponding qubit frequency tuning range.

### Claim 18 (depends on 13)

The system of claim 13, wherein the determining and assigning steps for each node in the quantum lattice are carried out in accordance with a recursive lattice stepping routine that enhances continuity of a stepping path through the quantum lattice.

### Claim 19 (depends on 13)

The system of claim 13, wherein the nodes in the quantum lattice include qubits and at least one tunable element other than a qubit, and wherein the at least one processor is further operative to define lattice characteristics, including at least the collision constraints, which take into account operating characteristics of both the qubits and the at least one tunable element other than a qubit.

### Claim 20 (depends on 13)

The system of claim 13, wherein the at least one processor is further operative to facilitate tuning physical qubits in accordance with a frequency tuning plan based on the quantum lattice with the frequency perturbation routine applied.
