# US 2026/0094034 A1 · Systems and methods for sampling-based krylov quantum diagonalization

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

- Number: US 2026/0094034 A1
- Document ID: US20260094034A1
- Status: Published application
- Kind: A1
- Application number: 18/889,494
- Filed: 2024-09-19
- Published: 2026-04-02
- Earliest claimed: 2024-09-19
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Kunal Sharma; Minh Tran; Javier Robledo Moreno; Antonio Mezzacapo; William Kirby; Petar Jurcevic; Jeffery Yu; Joseph Iosue
- Web page: https://patentgrep.com/patent/US20260094034A1

## CPC

- 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

A system includes a processor that executes computer executable components stored in a memory. The computer executable components can comprise can comprise a reference component that selects reference state and applies time evolution with respect to a Hamiltonian for different times to prepare Krylov basis states on a quantum device; a base component that prepares the Krylov basis states to obtain a fixed number of samples by sampling from the prepared basis states to classically represent the original Hamiltonian; and a representation component that classically represents the original Hamiltonian in subspace generated by the fixed number of samples to diagonalize the Hamiltonian in a bitstring subspace to obtain an approximation of ground state energy of the original Hamiltonian.

## Claims

### Claim 1

A system, comprising:
a processor that executes computer executable components stored in memory, wherein the computer executable components comprise:
a reference component that selects reference state and applies time evolution with respect to a Hamiltonian for different times to prepare Krylov basis states on a quantum device;
a base component that prepares the Krylov basis states to obtain a fixed number of samples by sampling from the prepared basis states to classically represent the original Hamiltonian; and
a representation component that classically represents the original Hamiltonian in subspace generated by the fixed number of samples to diagonalize the Hamiltonian in a bitstring subspace to obtain an approximation of ground state energy of the original Hamiltonian.

### Claim 2 (depends on 1)

The system of claim 1, wherein the Hamiltonian is a general Hamiltonian H, wherein
H
=
∑
l
c
l
⁢
P
l
,
and wherein cl are real numbers and Pl denotes n-qubit Pauli matrices.

### Claim 3 (depends on 1)

The system of claim 1, wherein the reference state is further defined as: |ψref.

### Claim 4 (depends on 3)

The system of claim 3, wherein the Krylov basis states are further defined as |φj=exp(−ijδtH)|ψref, where j∈[−d, −d+1, . . . , d−1, d] takes D=2d+1 different values, and wherein d is a positive integer, t is a real number, and i denotes the imaginary unit.

### Claim 5 (depends on 4)

The system of claim 4, wherein L number of samples are obtained from each |φj by measuring a computational basis, and wherein L is an integer.

### Claim 6 (depends on 2)

The system of claim 2, wherein S denotes the subspace of the bitstrings such that
S
=
{
❘
"\[LeftBracketingBar]"
b
i
〉
}
i
=
1
LD
,
and wherein bi is an integer.

### Claim 7 (depends on 6)

The system of claim 6, wherein a new representation of H in the subspace S is obtained classically by invoking sparsity of Pauli operators Pl in computational basis.

### Claim 8 (depends on 7)

The system of claim 7, wherein the new representation of H is denoted as {tilde over (H)}.

### Claim 9 (depends on 8)

The system of claim 8, wherein a ground state energy of {tilde over (H)} is obtained by classical diagonalization which approximates the ground state energy of H.

### Claim 10

A computer-implemented method that utilizes a processor that executes computer executable components stored in memory to perform the following acts:
selecting a reference state and applying time evolution with respect to a Hamiltonian for different times to prepare Krylov basis states on a quantum device;
preparing the Krylov basis states on the quantum device to obtain a fixed number of samples by sampling from the prepared basis states in order to classically represent the original Hamiltonian; and
classically representing the original Hamiltonian in subspace generated by the fixed number of samples to diagonalize the Hamiltonian in a bitstring subspace to obtain an approximation of ground state energy of the original Hamiltonian.

### Claim 11 (depends on 10)

The method of claim 10, wherein the Hamiltonian is a general Hamiltonian H, wherein
H
=
∑
l
c
l
⁢
P
l
,
and wherein cl are real numbers and Pl denotes n-qubit Pauli matrices.

### Claim 12 (depends on 11)

The method of claim 11, wherein the reference state is further defined as: |ψref.

### Claim 13 (depends on 12)

The method of claim 12, wherein the Krylov basis states are further defined as |φj=exp(−ijδtH)|ψref, where j∈[−d, −d+1, . . . , d−1, d] takes D=2d+1 different values, and wherein d is a positive integer, t is a real number, and i denotes the imaginary unit.

### Claim 14 (depends on 13)

The method of claim 13, wherein L number of samples are obtained from each |φj by measuring a computational basis, and wherein L is an integer.

### Claim 15 (depends on 12)

The method of claim 12, wherein S denotes the subspace of the bitstrings such that
S
=
{
❘
"\[LeftBracketingBar]"
b
i
〉
}
i
=
1
LD
,
and wherein bi is an integer.

### Claim 16 (depends on 15)

The method of claim 15, wherein a new representation of H in the subspace S is obtained classically by invoking the sparsity of Pauli operators Pl in the computational basis.

### Claim 17 (depends on 16)

The method of claim 16, wherein the new representation of H is denoted as {tilde over (H)}.

### Claim 18 (depends on 17)

The method of claim 17, wherein a ground state energy of {tilde over (H)} is obtained by classical diagonalization which approximates the ground state energy of H.

### Claim 19

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:
select a reference state and apply time evolution with respect to the Hamiltonian for different times in order to prepare Krylov basis states on a quantum device;
prepare the Krylov basis states on the quantum device to obtain a fixed number of samples by sampling from the prepared basis states to classically represent the original Hamiltonian; and
classically represent the original Hamiltonian in subspace generated by the samples to diagonalize the Hamiltonian in a bitstring subspace to obtain an approximation of ground state energy of the original Hamiltonian.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein the Hamiltonian is a general Hamiltonian H, and wherein
H
=
∑
l
c
l
⁢
P
l
,
and wherein cl are real numbers and Pl denotes n-qubit Pauli matrices.
