# US 2026/0073268 A1 · Gibbs State-Based Quantum Optimization for Combinatorial Optimization Problems

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

- Number: US 2026/0073268 A1
- Document ID: US20260073268A1
- Status: Published application
- Kind: A1
- Application number: 18/829,642
- Filed: 2024-09-10
- Published: 2026-03-12
- Earliest claimed: 2024-09-10
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Jae-Eun PARK; Vaibhaw KUMAR; Dimitrios ALEVRAS
- Web page: https://patentgrep.com/patent/US20260073268A1

## CPC

- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- 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: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems and techniques that facilitate Gibbs state-based quantum optimization for combinatorial optimization problems are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory that can execute at least one of the computer executable components that can prepare a Gibbs state of a quantum system that represents a combinatorial optimization problem, wherein the Gibbs state is a quantum state that minimizes free energy of the quantum system. The at least one of the computer executable components can further initialize a quantum optimization algorithm using a set of parameters that define the Gibbs state to solve the combinatorial optimization problem, wherein solving the combinatorial optimization problem comprises determining a ground state of a Hamiltonian of the quantum system.

## Claims

### Claim 1

A system, comprising:
a memory that stores computer executable components; and
a processor that executes at least one of the computer executable components that:
prepares a Gibbs state of a quantum system that represents a combinatorial optimization problem, wherein the Gibbs state is a quantum state that minimizes free energy of the quantum system; and
initializes a quantum optimization algorithm using a set of parameters that define the Gibbs state to solve the combinatorial optimization problem, wherein solving the combinatorial optimization problem comprises determining a ground state of a Hamiltonian of the quantum system.

### Claim 2 (depends on 1)

The system of claim 1, wherein preparing the Gibbs state of the quantum system comprises:
preparing an initial quantum state in a computational basis;
applying the variational quantum circuit to the initial quantum state;
obtaining measurements of the variational quantum circuit; and
generating a parameterized density matrix in the computational basis based on the measurements.

### Claim 3 (depends on 2)

The system of claim 2, wherein generating the parameterized density matrix comprises:
determining probabilities of observing respective bitstrings; and
generating the parameterized density matrix based on the probabilities of measuring the respective bitstrings.

### Claim 4 (depends on 2)

The system of claim 2, wherein at least one of the computer executable components further:
determines an expectation value of the Hamiltonian using the parameterized density matrix; and
determines an entropy term of the Gibbs state using the parameterized density matrix.

### Claim 5 (depends on 4)

The system of claim 4, wherein at least one of the computer executable components further:
determines the free energy of the quantum system based on the expectation value and the entropy term.

### Claim 6 (depends on 1)

The system of claim 1, wherein at least one of the computer executable components further:
creates a schedule of an inverse temperature parameter; and
iteratively prepares the Gibbs state over the schedule of the inverse temperature parameter.

### Claim 7 (depends on 1)

The system of claim 1, wherein at least one of the computer executable components further:
computes the expectation value or the entropy term using a real-amplitude ansatz.

### Claim 8

A computer-implemented method, comprising:
preparing, by a system operatively coupled to a processor, a Gibbs state of a quantum system that represents a combinatorial optimization problem, wherein the Gibbs state is a quantum state that minimizes free energy of the quantum system; and
initializing, by the system, a quantum optimization algorithm using a set of parameters that define the Gibbs state to solve the combinatorial optimization problem, wherein solving the combinatorial optimization problem comprises determining a ground state of a Hamiltonian of the quantum system.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein preparing the Gibbs state of the quantum system comprises:
preparing an initial quantum state in a computational basis;
applying the variational quantum circuit to the initial quantum state;
obtaining measurements of the variational quantum circuit; and
generating a parameterized density matrix in the computational basis based on the measurements.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein generating the parameterized density matrix comprises:
determining probabilities of observing respective bitstrings; and
generating the parameterized density matrix based on the probabilities of measuring the respective bitstrings.

### Claim 11 (depends on 9)

The computer-implemented method of claim 9, further comprising:
determining, by the system, an expectation value of the Hamiltonian using the parameterized density matrix; and
determining, by the system, an entropy term of the Gibbs state using the parameterized density matrix.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, further comprising:
determining, by the system, the free energy of the quantum system based on the expectation value and the entropy term.

### Claim 13 (depends on 8)

The computer-implemented method of claim 8, further comprising:
creating, by the system, a schedule of an inverse temperature parameter; and
iteratively preparing, by the system, the Gibbs state over the schedule of the inverse temperature parameter.

### Claim 14 (depends on 11)

The computer-implemented method of claim 11, further comprising:
computing, by the system, the expectation value or the entropy term using a real-amplitude ansatz.

### Claim 15

A computer program product for Gibbs state-based quantum optimization for combinatorial optimization problems, the 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:
prepare a Gibbs state of a quantum system that represents a combinatorial optimization problem, wherein the Gibbs state is a quantum state that minimizes free energy of the quantum system; and
initialize a quantum optimization algorithm using a set of parameters that define the Gibbs state to solve the combinatorial optimization problem, wherein solving the combinatorial optimization problem comprises determining a ground state of a Hamiltonian of the quantum system.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein preparing the Gibbs state of the quantum system comprises:
preparing an initial quantum state in a computational basis;
applying the variational quantum circuit to the initial quantum state;
obtaining measurements of the variational quantum circuit; and
generating a parameterized density matrix in the computational basis based on the measurements.

### Claim 17 (depends on 16)

The computer program product of claim 16, wherein generating the parameterized density matrix comprises:
determining probabilities of observing respective bitstrings; and
generating the parameterized density matrix based on the probabilities of measuring the respective bitstrings.

### Claim 18 (depends on 16)

The computer program product of claim 16, wherein the program instructions are further executable by the processor to cause the processor to:
determine an expectation value of the Hamiltonian using the parameterized density matrix; and
determine an entropy term of the Gibbs state using the parameterized density matrix.

### Claim 19 (depends on 18)

The computer program product of claim 18, wherein the program instructions are further executable by the processor to cause the processor to:
determines the free energy of the quantum system based on the expectation value and the entropy term.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the program instructions are further executable by the processor to cause the processor to:
create a schedule of an inverse temperature parameter; and
iteratively prepare the Gibbs state over the schedule of the inverse temperature parameter.
