# US 2026/0094045 A1 · Quantum-inspired tensor network simulator of quantum computers and method associated therewith

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

- Number: US 2026/0094045 A1
- Document ID: US20260094045A1
- Status: Published application
- Kind: A1
- Application number: 18/955,166
- Filed: 2024-11-21
- Published: 2026-04-02
- Earliest claimed: 2024-09-27
- Assignees: Multiverse Computing S.L.
- Applicants: Multiverse Computing, S.L.
- Inventors: Siddhartha PATRA; Sukhbinder SINGH; Saeed JAHROMI; Roman ORUS
- Web page: https://patentgrep.com/patent/US20260094045A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/80: Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing
- 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

Simulating a quantum computer by generating a dynamic tensor network according to a structure of a quantum circuit to be simulated. Reading two-qubit terms of the quantum circuit; providing a two-qubit gate for each read two-qubit term thereby providing a tensor per qubit, and a connecting tensor index for the two tensors; shortening the connecting tensor index by using a value decomposition and keeping a predetermined number D of largest values; removing at least as many connecting tensor indices as needed to reduce the number of connecting tensor indices down to a predetermined threshold M if the number exceeds M.

## Claims

### Claim 1

A system comprising at least one processor and at least one memory module, the at least one processor and the at least one memory module being configured to:
read at least some two-qubit terms of a quantum circuit of a quantum computer;
select a read two-qubit term and provide a two-qubit gate such that:
a tensor per qubit is provided, and
a connecting tensor index for the provided two tensors is provided between them;
shorten the connecting tensor index by using a value decomposition and keep a predetermined number D of largest values;
remove at least as many connecting tensor indices as needed to reduce the number of connecting tensor indices down to a predetermined threshold M when a number of connecting tensor indices of a resulting tensor network is greater that the predetermined threshold M; and
repeat the selection, shortening and removal for all other read two-qubit terms; and
simulate the quantum computer or the quantum circuit thereof at least based on the resulting tensor network.

### Claim 2 (depends on 1)

The system of claim 1, wherein the at least one processor and the at least one memory module are configured to, for the tensor network provided with the plurality of two-qubit gates, generate the tensor network according to a correlation structure of the quantum computer or quantum circuit to be simulated.

### Claim 3 (depends on 1)

The system of claim 1, wherein the quantum circuit or the quantum computer has a plurality of unitary two-qubit quantum gates configured to act on a set of qubits.

### Claim 4 (depends on 1)

The system of claim 1, wherein the at least some two-qubit terms read comprises all the two-qubit terms of the quantum circuit of the quantum computer.

### Claim 5 (depends on 1)

The system of claim 1, wherein the value decomposition is a truncation using a Singular Value Decomposition.

### Claim 6 (depends on 1)

The system of claim 1, wherein the removal comprises removal of the connecting tensors having a smallest Shannon entropy of the squared singular values.

### Claim 7 (depends on 1)

The system of claim 1, wherein the simulation comprises checking correct operation of the quantum computer by replicating operations of the quantum computer and comparing outputs thereof with outputs of the simulation.

### Claim 8 (depends on 1)

The system of claim 1, wherein the at least one processor and the at least one memory module are further configured to introduce disturbances into the simulation to determine effects of noise on the quantum computer.

### Claim 9 (depends on 1)

The system of claim 1, wherein the simulation is of a quantum computer that performs:
optimization of at least one problem, at least one cryptographic task, or a combination thereof.

### Claim 10 (depends on 1)

The system of claim 1, wherein the at least one processor and the at least one memory module are further configured, by using the simulation, to: model noise of the quantum computer, check correct operation of the quantum computer, provide details for manufacturing a quantum computer or quantum circuit thereof, or a combination thereof.

### Claim 11 (depends on 1)

The system of claim 1, further comprising the quantum circuit.

### Claim 12

A computer-implemented method for simulating a quantum computer or a quantum circuit thereof, the method comprising:
reading at least some two-qubit terms of the quantum circuit of the quantum computer;
selecting a read two-qubit term and providing a two-qubit gate such that:
a tensor per qubit is provided, and
a connecting tensor index for the provided two tensors is provided between them;
shortening the connecting tensor index by using a value decomposition and keeping a predetermined number D of largest values;
when a number of connecting tensor indices of a resulting tensor network is greater that a predetermined threshold M, removing at least as many connecting tensor indices as needed to reduce the number of connecting tensor indices down to the predetermined threshold M; and
repeating the selecting, shortening and removing steps for all other read two-qubit terms.

### Claim 13 (depends on 12)

The computer-implemented method of claim 12, wherein a tensor network provided with the plurality of two-qubit gates is generated according to a correlation structure of the quantum computer or quantum circuit to be simulated.

### Claim 14 (depends on 12)

The computer-implemented method of claim 12, wherein the quantum circuit or the quantum computer has a plurality of unitary two-qubit quantum gates configured to act on a set of qubits.

### Claim 15 (depends on 12)

The computer-implemented method of claim 12, wherein, in the reading step, all two-qubit terms of the quantum circuit of the quantum computer are read.

### Claim 16 (depends on 12)

The computer-implemented method of claim 12, wherein the simulation checks correct operation of the quantum computer by replicating operations of the quantum computer and comparing outputs thereof with outputs of the simulation.

### Claim 17 (depends on 12)

The computer-implemented method of claim 12, further comprising introducing disturbances into the simulation to determine effects of noise on the quantum computer.

### Claim 18 (depends on 12)

The computer-implemented method of claim 12, wherein the simulation is of a quantum computer that performs: optimization of at least one problem, at least one cryptographic task, or a combination thereof.

### Claim 19 (depends on 12)

The computer-implemented method of claim 12, further comprising using the simulation for: modeling noise of the quantum computer, checking correct operation of the quantum computer, manufacturing a quantum computer or quantum circuit thereof, or a combination thereof.

### Claim 20

A method comprising:
simulating an existing quantum computer or quantum circuit thereof by running a computer-implemented method comprising:
reading at least some two-qubit terms of the quantum circuit of the quantum computer;
selecting a read two-qubit term and providing a two-qubit gate such that:
a tensor per qubit is provided, and
a connecting tensor index for the provided two tensors is provided between them;
shortening the connecting tensor index by using a value decomposition and keeping a predetermined number D of largest values;
when a number of connecting tensor indices of a resulting tensor network is greater that a predetermined threshold M, removing at least as many connecting tensor indices as needed to reduce the number of connecting tensor indices down to the predetermined threshold M; and
repeating the selecting, shortening and removing steps for all other read two-qubit terms;
assessing limitations in operation of the existing quantum computer or quantum circuit with the simulation performed; and
manufacturing a quantum computer or quantum circuit thereof at least based on the assessed limitations.
