IP Library › Granted Patent US 12,244,524
Granted Patent B2
US 12,244,524 · App. 17/797,077 · Granted Mar 4, 2025

Optimization function generation apparatus, optimization function generation method, and program

Inventors: Kazuhiro Miyahara (Tokyo, JP); Keitaro Horikawa (Tokyo, JP); Kinya Tomita (Tokyo, JP)
Assignee: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
H04L5/0023G06N10/60H04L5/006
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,244,524
App. No.
17/797,077
Granted
Mar 4, 2025
Kind
B2
Abstract

Provided is a technology for creating an optimization function for solving a bandwidth allocation plan problem for determining bandwidths to be allocated for respective paths under various constraints regarding the paths for which bandwidths are to be allocated, the optimization function relating to a variable that represents a quantum state. The technology includes: an input setting unit that sets a set Path of paths, a set Edge of edges, a maximum bandwidth Max, a bandwidth p.bandwidth required by a path p, and a set e.paths of paths that include an edge e, as input to a bandwidth allocation plan problem for creating a bandwidth allocation plan for paths so as to satisfy a condition of minimizing a bandwidth allocated for the paths of the set Path as a whole under a predetermined constraint condition; and an optimization function creation unit that creates the optimization function using the input.

Claims (26)

1. An optimization function creation apparatus comprising:

an input setting circuitry configured to set a set Path of paths, a set Edge of edges, a maximum bandwidth Max, a bandwidth p.bandwidth required by a path p(∈Path), and a set e.paths(⊆Path) of paths that include an edge e(∈Edge), as input to a bandwidth allocation plan problem for creating a bandwidth allocation plan for paths so as to satisfy a condition (hereinafter referred to as an “optimization condition”) of minimizing a bandwidth allocated for the paths of the set Path as a whole under a predetermined constraint condition;

an optimization function creation circuitry configured to create an optimization function for solving the bandwidth allocation plan problem using the input, the optimization function relating to a variable that represents a quantum state; and

another circuitry configured to allocate, based on the created optimization function, a minimized bandwidth allocated for the path of the set Path and transmit data through the path of the set Path.

2. The optimization function creation apparatus according to claim 1 , wherein

the constraint condition is a condition (hereinafter referred to as a “first constraint condition”) that |{p∈e.paths|bottom(p)≤b<bottom(p)+p.bandwidth}|≤1 (where bottom(p) represents the lower limit of a bandwidth allocated for the path p) is satisfied with respect to each band b up to the maximum bandwidth Max and each edge e∈Edge, and

the optimization function is a function designed so as to take the minimum value when the first constraint condition is satisfied.

3. The optimization function creation apparatus according to claim 2 , wherein

the variable that represents a quantum state is a quantum bit that represents a particular state by taking the value 1 and represents a state other than the particular state by taking the value 0,

the optimization function is an objective function of Quadratic Unconstrained Binary Optimization (QUBO) defined based on a function that expresses the first constraint condition and a function that expresses the optimization condition,

the function expressing the first constraint condition is a function that takes the value 0 when the first constraint condition is satisfied, and otherwise takes a value greater than 0, and

the function expressing the optimization condition is a function defined such that the value of the function decreases as the total value of bands each allocated for at least one path decreases.

4. The optimization function creation apparatus according to claim 3 , wherein

the variable that represents a quantum state is a variable that is defined so as to represent, with the value 1, a state where a band b is higher than or equal to the lower limit of a bandwidth allocated for a path p.

5. The optimization function creation apparatus according to claim 2 , wherein

the variable that represents a quantum state is a spin that represents a particular state by taking the value 1 and represents a state other than the particular state by taking the value −1,

the optimization function is an Ising Hamiltonian defined based on a function that expresses the first constraint condition and a function that expresses the optimization condition,

the function expressing the first constraint condition is a function that takes the value 0 when the first constraint condition is satisfied, and otherwise takes a value greater than 0, and

the function expressing the optimization condition is a function defined such that the value of the function decreases as a total value of bands each allocated for at least one path decreases.

6. The optimization function creation apparatus according to claim 5 , wherein

the variable that represents a quantum state is a variable that is defined so as to represent, with the value 1, a state where a band b is higher than or equal to the lower limit of a bandwidth allocated for a path p.

7. A non-transitory computer-readable recording medium storing a program for causing a computer to function as the optimization function creation apparatus according to claim 1 .

8. A method for creating an optimization function, comprising:

an input setting step of setting, by an optimization function creation apparatus, a set Path of paths, a set Edge of edges, a maximum bandwidth Max, a bandwidth p.bandwidth required by a path p(∈Path), and a set e.paths(⊆Path) of paths that include an edge e(∈Edge), as input to a bandwidth allocation plan problem for creating a bandwidth allocation plan for paths so as to satisfy a condition (hereinafter referred to as an “optimization condition”) of minimizing a bandwidth allocated for the paths of the set Path as a whole under a predetermined constraint condition;

an optimization function creating step of creating, by the optimization function creation apparatus, an optimization function for solving the bandwidth allocation plan problem using the input, the optimization function relating to a variable that represents a quantum state; and

an allocating and transmit step of allocating, based on the created optimization function, a minimized bandwidth allocated for the path of the set Path and transmit data through the path of the set Path.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 2, 2022
From: MIYAHARA, KAZUHIRO; HORIKAWA, KEITARO; TOMITA, KINYA
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 060701/0779 →
Continuity (1)
Related Publication 20230049956A1 · Feb 16, 2023
References Cited (8)
US 6912232B1 · Duffield · 2005 [cited by examiner]
US 20030009582A1 · Qiao · 2003 [cited by examiner]
US 20190164079A1 · Gambetta · 2019 [cited by examiner]
US 20200228264A1 · Kreienkamp · 2020 [cited by examiner]
A. Lucas (2014) “Ising formulations of many NP problems,” frontiers in Physics, [online], [searched on Jan. 17, 2020], Internet <URL: https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full>. [cited by applicant]
D-Wave Systems Inc, “The D-Wave 2000QTM Quantum Computer Technology Overview,” [online], [searched on Jan. 17, 2020], Internet <URL: https://www.dwavesys.com/sites/default/files/D-Wave%202000Q%20Tech%20Collateral_1029F.… [cited by applicant]
Inagaki et al. (2016) “A coherent Ising machine for 2000-node optimization problems,” Science, vol. 354, Issue 6312, pp. 603-606. [cited by applicant]
Yoshimura, et al. (2019) “An efficient Ising model mapping method to solve induced subgraph isomorphism problems using Ising machines,” Adiabatic Quantum Computing Conference. [cited by applicant]