# US 2026/0017547 A1 · Magnus expansion in interaction picture for quantum simulation

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

- Number: US 2026/0017547 A1
- Document ID: US20260017547A1
- Status: Published application
- Kind: A1
- Application number: 18/618,384
- Filed: 2024-03-27
- Published: 2026-01-15
- Earliest claimed: 2024-03-27
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Kunal Sharma; Minh Tran
- Web page: https://patentgrep.com/patent/US20260017547A1

## CPC

- 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 quantum simulation by using a Magnus expansion in an interaction picture are provided. 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 the computer executable components stored in memory. The computer executable components can comprise a quantum circuit generation component that generates a quantum circuit that represents a quantum model of a quantum system, wherein generating of the quantum circuit can comprise decomposing a time-independent Hamiltonian that describes the quantum system into a first Hamiltonian and a second Hamiltonian. Generating of the quantum circuit can further comprise employing a Magnus expansion in an interaction picture of the first Hamiltonian to approximate a time evolution of the quantum system under a time-dependent Hamiltonian.

## Claims

### Claim 1

A system, comprising: a memory that stores computer executable components; and
a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise:
a quantum circuit generation component that generates a quantum circuit that represents a quantum model of a quantum system, wherein generating of the quantum circuit comprises:
decomposing a time-independent Hamiltonian that describes the quantum system into a first Hamiltonian and a second Hamiltonian; and
employing a Magnus expansion in an interaction picture of the first Hamiltonian to approximate a time evolution of the quantum system under a time-dependent Hamiltonian.

### Claim 2 (depends on 1)

The system of claim 1, further comprising:
a truncation component that truncates the Magnus expansion by a truncation parameter to create a truncated Magnus expansion.

### Claim 3 (depends on 2)

The system of claim 2, wherein the truncation component identifies the truncation parameter informed by Lieb-Robinson bounds.

### Claim 4 (depends on 2)

The system of claim 2, wherein the truncation component generates a Pauli decomposition of the truncated Magnus expansion.

### Claim 5 (depends on 4)

The system of claim 4, further comprising:
an approximation component that reformulates the time evolution as a product of a first operator and a second operator, wherein the first operator describes a time evolution under the first Hamiltonian, and wherein the second operator is a time evolution generated by an interaction-picture Hamiltonian.

### Claim 6 (depends on 5)

The system of claim 5, wherein the approximation component employs the truncated Magnus expansion to approximate the time evolution generated by the interaction-picture Hamiltonian.

### Claim 7 (depends on 1)

The system of claim 1, wherein the first Hamiltonian and the second Hamiltonian are geometrically local Hamiltonians.

### Claim 8 (depends on 5)

The system of claim 5, further comprising:
an execution component that employs Trotter formulas to implement the time evolution under the first Hamiltonian and the Pauli decomposition of the truncated Magnus expansion corresponding to the interaction-picture Hamiltonian in the quantum circuit, and executes the quantum circuit using a quantum processor to simulate the quantum model of the quantum system.

### Claim 9

A computer-implemented method, comprising:
generating, by a system operatively coupled to a processor, a quantum circuit that represents a quantum model of a quantum system, wherein generating of the quantum circuit comprises:
decomposing, by the system, a time-independent Hamiltonian that describes the quantum system into a first Hamiltonian and a second Hamiltonian; and
employing, by the system, a Magnus expansion in an interaction picture of the first Hamiltonian to approximate a time evolution of the quantum system under a time-dependent Hamiltonian.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, further comprising:
truncating, by the system, the Magnus expansion by a truncation parameter to create a truncated Magnus expansion.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, further comprising:
identifying, by the system, the truncation parameter informed by Lieb-Robinson bounds.

### Claim 12 (depends on 10)

The computer-implemented method of claim 10, further comprising:
generating, by the system, a Pauli decomposition of the truncated Magnus expansion.

### Claim 13 (depends on 10)

The computer-implemented method of claim 10, further comprising:
reformulating, by the system, the time evolution as a product of a first operator and a second operator, wherein the first operator describes a time evolution under the first Hamiltonian, and wherein the second operator is a time evolution generated by an interaction-picture Hamiltonian.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, further comprising:
employing, by the system, the truncated Magnus expansion to approximate the time evolution generated by the interaction-picture Hamiltonian.

### Claim 15 (depends on 12)

The computer-implemented method of claim 12, further comprising:
employing, by the system, Trotter formulas to implement the time evolution under the first Hamiltonian and the Pauli decomposition of the truncated Magnus expansion in the quantum circuit; and
executing, by the system, the quantum circuit using a quantum processor to simulate the quantum model of the quantum system.

### Claim 16

A computer program product facilitating a process to reduce error of quantum simulation using Magnus expansion, 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:
generate, by the processor, a quantum circuit that represents a quantum model of a quantum system, wherein generating of the quantum circuit comprises:
decomposing, by the processor, a time-independent Hamiltonian that describes the quantum system into a first Hamiltonian and a second Hamiltonian; and
employing, by the processor, a Magnus expansion in an interaction picture of the first Hamiltonian to approximate a time evolution of the quantum system under a time-dependent Hamiltonian.

### Claim 17 (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:
truncate, by the processor, the Magnus expansion by a truncation parameter to create a truncated Magnus expansion; and
identify, by the processor, the truncation parameter informed by Lieb-Robinson bounds.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the program instructions are further executable by the processor to cause the processor to:
generate, by the processor, a Pauli decomposition of the truncated Magnus expansion.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein the program instructions are further executable by the processor to cause the processor to:
reformulate, by the processor, the time evolution as a product of a first operator and a second operator, wherein the first operator describes a time evolution under the first Hamiltonian, and wherein the second operator is a time evolution generated by an interaction-picture Hamiltonian; and
employ, by the processor, the truncated Magnus expansion to approximate the time evolution generated by the interaction-picture Hamiltonian.

### Claim 20 (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:
employ, by the processor, Trotter formulas to implement the time evolution under the first Hamiltonian and the Pauli decomposition of the truncated Magnus expansion in the quantum circuit; and
execute, by the processor, the quantum circuit using a quantum processor to simulate the quantum model of the quantum system.
