# US 2025/0148341 A1 · Optimization to mitigate frequency crowding in 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/0148341 A1
- Document ID: US20250148341A1
- Status: Published application
- Kind: A1
- Application number: 18/501,176
- Filed: 2023-11-03
- Published: 2025-05-08
- Earliest claimed: 2023-11-03
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Takashi Ido; NAOKI KANAZAWA; Jared Barney Hertzberg; Eric Zhang; Sami Rosenblatt; Jason S. Orcutt; Malcolm Scott Carroll
- Web page: https://patentgrep.com/patent/US20250148341A1

## 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/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06F 17/11: for solving equations {, e.g. nonlinear equations, general mathematical optimization problems (optimization specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Define a plurality of qubit collision types and a plurality of constraints. For a group of qubits, use a computerized mixed-integer programming solver to, subject to the constraints, iteratively minimize collisions by minimizing a sum of products of weights multiplied by an amount of frequency collisions for given ones of the constraints of each one of the collision types. Output a frequency tuning plan for the group of qubits, based on the iterative minimization. Facilitate tuning physical qubits in accordance with the frequency tuning plan.

## Claims

### Claim 1

A method comprising:
defining a plurality of qubit collision types and a plurality of constraints;
for a group of qubits, using a computerized mixed-integer programming solver to, subject to the constraints, iteratively minimize collisions by minimizing a sum of products of weights multiplied by an amount of frequency collisions for given ones of the constraints of each one of the collision types;
outputting a frequency tuning plan for the group of qubits, based on the iterative minimization; and
facilitating tuning physical qubits in accordance with the frequency tuning plan.

### Claim 2 (depends on 1)

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

### Claim 3 (depends on 2)

The method of claim 2, further comprising carrying out statistical modeling to assess yield associated with the frequency tuning plan, wherein the LASIQ (Laser Annealing of Stochastically Impaired Qubits) is carried out responsive to the statistical modeling indicating acceptable yield.

### Claim 4 (depends on 1)

The method of claim 1, further comprising, following the iterative minimization of collisions, for the group of qubits, using the computerized mixed-integer programming solver to iteratively maximize frequency margin, subject to the constraints.

### Claim 5 (depends on 4)

The method of claim 4, further comprising determining that a solution to the iterative minimization includes at least one collision, wherein the iterative maximization of the frequency margin is carried out responsive to the determining.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
accessing a specification of a qubit lattice;
selecting at least one sublattice shape;
generating sublattices, in accordance with the at least one sublattice shape, such that each individual qubit in the qubit lattice is covered by at least one of the sublattices;
wherein the group of qubits comprises one of the sublattices.

### Claim 7 (depends on 6)

The method of claim 6, further comprising repeating the step of iteratively minimizing collisions by minimizing the sum of products of weights multiplied by the amount of frequency collisions for given ones of the constraints of each one of the collision types, for additional groups of qubits corresponding to remaining ones of the sublattices.

### Claim 8 (depends on 7)

The method of claim 7, wherein selecting the at least one sublattice shape comprises selecting at least one of a nine qubit H-shape, an eleven qubit H-shape, a twelve qubit cycle shape, and a shape including each qubit and its neighboring qubits.

### Claim 9 (depends on 1)

The method of claim 1, wherein the iterative minimization includes applying scaling factors to increase or decrease collision bounds by type.

### Claim 10

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:
defining a plurality of qubit collision types and a plurality of constraints;
for a group of qubits, using a computerized mixed-integer programming solver to, subject to the constraints, iteratively minimize collisions by minimizing a sum of products of weights multiplied by an amount of frequency collisions for given ones of the constraints of each one of the collision types;
outputting a frequency tuning plan for the group of qubits, based on the iterative minimization; and
facilitating tuning physical qubits in accordance with the frequency tuning plan.

### Claim 11 (depends on 10)

The computer program product of claim 10, wherein the method performed by the processor further comprises, following the iterative minimization of collisions, for the group of qubits, using the computerized mixed-integer programming solver to iteratively maximize frequency margin, subject to the constraints.

### Claim 12

A system comprising:
a memory; and
at least one processor, coupled to said memory, and operative to:
define a plurality of qubit collision types and a plurality of constraints;
for a group of qubits, use a computerized mixed-integer programming solver to, subject to the constraints, iteratively minimize collisions by minimizing a sum of products of weights multiplied by an amount of frequency collisions for given ones of the constraints of each one of the collision types;
output a frequency tuning plan for the group of qubits, based on the iterative minimization; and
facilitate tuning physical qubits in accordance with the frequency tuning plan.

### Claim 13 (depends on 12)

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

### Claim 14 (depends on 13)

The system of claim 13, wherein the at least one processor is further operative to carry out statistical modeling to assess yield associated with the frequency tuning plan, wherein the LASIQ (Laser Annealing of Stochastically Impaired Qubits) is carried out responsive to the statistical modeling indicating acceptable yield.

### Claim 15 (depends on 12)

The system of claim 12, wherein the at least one processor is further operative to, following the iterative minimization of collisions, for the group of qubits, use the computerized mixed-integer programming solver to iteratively maximize frequency margin, subject to the constraints.

### Claim 16 (depends on 15)

The system of claim 15, wherein the at least one processor is further operative to determine that a solution to the iterative minimization includes at least one collision, wherein the iterative maximization of the frequency margin is carried out responsive to the determining.

### Claim 17 (depends on 12)

The system of claim 12, wherein the at least one processor is further operative to:
access a specification of a qubit lattice;
select at least one sublattice shape;
generate sublattices, in accordance with the at least one sublattice shape, such that each individual qubit in the qubit lattice is covered by at least one of the sublattices;
wherein the group of qubits comprises one of the sublattices.

### Claim 18 (depends on 17)

The system of claim 17, wherein the at least one processor is further operative to repeat the step of iteratively minimizing collisions by minimizing the sum of products of weights multiplied by the amount of frequency collisions for given ones of the constraints of each one of the collision types, for additional groups of qubits corresponding to remaining ones of the sublattices.

### Claim 18 (depends on 18)

The system of claim 18, wherein selecting the at least one sublattice shape comprises selecting at least one of a nine qubit H-shape, an eleven qubit H-shape, a twelve qubit cycle shape, and a shape including each qubit and its neighboring qubits.

### Claim 20 (depends on 12)

The system of claim 12, wherein the iterative minimization includes applying scaling factors to increase or decrease collision bounds by type.
