# US 2023/0267166 A1 · Parallel Simulation of Large-Scale Dynamical Systems Using Tensor Network

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

- Number: US 2023/0267166 A1
- Document ID: US20230267166A1
- Status: Published application
- Kind: A1
- Application number: 18/099,400
- Filed: 2023-01-20
- Published: 2023-08-24
- Earliest claimed: 2022-01-20
- Assignees: EFSolutions GbR
- Applicants: EFSolutions GbR
- Inventors: Stefano Elefante; Raffaele Iervolino
- Web page: https://patentgrep.com/patent/US20230267166A1

## CPC

- G06F 17/13: Differential equations (using digital differential analysers G06F7/64)
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A system includes a memory storing computer-readable instructions and at least one processor to execute the instructions to perform at least one tensor network method to numerically solve at least one differential equation.

## Claims

### Claim 1

A system comprising:
a memory storing computer-readable instructions; and
at least one processor to execute the instructions to:
perform at least one tensor network method to numerically solve at least one differential equation;
build a mathematical representation of one of a physical, economic, and engineering problem using the at least one differential equation;
determine a graph that defines connections between states of the problem and determine an adjacency matrix;
subdivide a matrix into n sets of matrices whose elements commute with each other while at least one element of a set does not commute with at least one element of another set;
implement a Suzuki Trotter decomposition using singular value decomposition to reduce data transfer among cores of the at least one processor on the n sets of matrices with a given time interval δ and a predefined p expansion order;
evaluate the problem at a time T=Nδ by iteratively performing the Suzuki Trotter decomposition N times; and
generate simulation results for the problem within an error of order of No (δp+1).

### Claim 2 (depends on 1)

The system of claim 1, wherein the at least one differential equation comprises one of a linear differential equation and a non-linear differential equation.

### Claim 3 (depends on 1)

The system of claim 1, wherein the at least one differential equation comprises one of a linear time variant differential equation and a non-linear time variant differential equation.

### Claim 4 (depends on 1)

The system of claim 1, wherein the tensor network method comprises a time-evolving block decimation (TEBD) method.

### Claim 5 (depends on 1)

The system of claim 1, further comprising at least one graphical processing unit (GPU) to execute the instructions.

### Claim 6 (depends on 1)

The system of claim 1, wherein the at least one processor numerically solves the at least one differential equation sequentially.

### Claim 7 (depends on 1)

The system of claim 1, wherein the at least one processor numerically solves the at least one differential equation in parallel.

### Claim 8

A method, comprising:
performing, by at least one processor, at least one tensor network method to numerically solve at least one differential equation;
building, by the at least one processor, a mathematical representation of one of a physical, economic, and engineering problem using the at least one differential equation;
determining, by the at least one processor, a graph that defines connections between states of the problem and determining an adjacency matrix;
subdividing, by the at least one processor, a matrix into n sets of matrices whose elements commute with each other while at least one element of a set does not commute with at least one element of another set;
implementing, by the at least one processor, a Suzuki Trotter decomposition using singular value decomposition to reduce data transfer among cores of the at least one processor on the n sets of matrices with a given time interval δ and a predefined p expansion order;
evaluating, by the at least one processor, the problem at a time T=Nδ by iteratively performing the Suzuki Trotter decomposition N times; and
generating, by the at least one processor, simulation results for the problem within an error of order of No(δp+1).

### Claim 9 (depends on 8)

The method of claim 8, wherein the at least one differential equation comprises one of a linear differential equation and a non-linear differential equation.

### Claim 10 (depends on 8)

The method of claim 8, wherein the at least one differential equation comprises one of a linear time variant differential equation and a non-linear time variant differential equation.

### Claim 11 (depends on 8)

The method of claim 8, wherein the tensor network method comprises a time-evolving block decimation (TEBD) method.

### Claim 12 (depends on 8)

The method of claim 8, wherein the at least one processor comprises at least one graphical processing unit (GPU).

### Claim 13 (depends on 8)

The method of claim 8, further comprising numerically solving the at least one differential equation sequentially.

### Claim 14 (depends on 8)

The method of claim 8, further comprising numerically solving the at least one differential equation in parallel.

### Claim 15

A non-transitory computer-readable storage medium comprising instructions stored thereon that, when executed by a computing device cause the computing device to perform operations, the operations comprising:
performing, at least one tensor network method to numerically solve at least one differential equation;
building a mathematical representation of one of a physical, economic, and engineering problem using the at least one differential equation;
determining a graph that defines connections between states of the problem and determining an adjacency matrix;
subdividing a matrix into n sets of matrices whose elements commute with each other while at least one element of a set does not commute with at least one element of another set;
implementing a Suzuki Trotter decomposition using singular value decomposition to reduce data transfer among cores of the at least one processor on the n sets of matrices with a given time interval δ and a predefined p expansion order;
evaluating the problem at a time T=Nδ by iteratively performing the Suzuki Trotter decomposition N times; and
generating simulation results for the problem within an error of order of No(δp+1).

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the at least one differential equation comprises one of a linear differential equation and a non-linear differential equation.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the at least one differential equation comprises one of a linear time variant differential equation and a non-linear time variant differential equation.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the tensor network method comprises a time-evolving block decimation (TEBD) method.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the at least one computing device comprises at least one graphical processing unit (GPU).

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, the operations further comprising numerically solving the at least one differential equation sequentially.

### Claim 21 (depends on 15)

The non-transitory computer-readable medium of claim 15, the operations further comprising numerically solving the at least one differential equation in parallel.
