# US 2026/0099744 A1 · Complex data encoding for quantum circuits

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

- Number: US 2026/0099744 A1
- Document ID: US20260099744A1
- Status: Published application
- Kind: A1
- Application number: 18/906,506
- Filed: 2024-10-04
- Published: 2026-04-09
- Earliest claimed: 2024-10-04
- Assignees: Dell Products L.P.
- Applicants: Dell Products L.P.
- Inventors: Brendan Burns Healy; Yasmin Mansy
- Web page: https://patentgrep.com/patent/US20260099744A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Encoding data for a quantum circuit is disclosed. Data may be chunked and tokenized. The tokenized data is encoded to generate an encoding suitable for input to a quantum circuit. Coefficients of the encoding are represented as complex numbers. This allows multiple values, such as the original data and their relative positions to be encoded in the same encoding. Thus, the output of the encoding engine is an encoding that contains or represents various aspects of the original input.

## Claims

### Claim 1

A method comprising:
receiving tokenized input into an encoding engine; and
encoding the tokenized input into an encoding that is configured to be input to a quantum circuit of a quantum computing system, wherein each token of the encoding includes a coefficient represented as a complex number, wherein the complex number includes positional information of the tokens in the tokenized input.

### Claim 2 (depends on 1)

The method of claim 1, wherein a first coefficient of the encoding is purely real.

### Claim 3 (depends on 1)

The method of claim 1, wherein an input comprises text and the tokenized input comprises chunks generated by chunking the text.

### Claim 4 (depends on 1)

The method of claim 1, wherein an output of the quantum computing system comprises a prompt for training a large language model or comprises a prompt as input to a large language model.

### Claim 5 (depends on 1)

The method of claim 1, wherein weights associated with each of the tokens is unchanged by representing the coefficients as complex numbers.

### Claim 6 (depends on 1)

The method of claim 1, wherein the encoding comprises n tokens that are spaced equally when represented in a unity circle.

### Claim 7 (depends on 6)

The method of claim 6, wherein each of the coefficients has an equal weight.

### Claim 8 (depends on 1)

The method of claim 1, further comprising replacing coefficients in the tokenized input with complex values in the encoding.

### Claim 9 (depends on 1)

The method of claim 1, wherein the encoding represents multiple values associated with the input such that multiple values are represented in the encoding, the values including aspects of the chunks and their relative positions.

### Claim 10 (depends on 1)

The method of claim 1, wherein encoding the coefficients as complex numbers provides a different phase to each of the coefficients, wherein the positional information of the tokens in the encoding is represented by the different phases of the coefficients.

### Claim 11

A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:
receiving tokenized input into an encoding engine; and
encoding the tokenized input into an encoding that is configured to be input to a quantum circuit of a quantum computing system, wherein each token of the encoding includes a coefficient represented as a complex number, wherein the complex number includes positional information of the tokens in the tokenized input.

### Claim 12 (depends on 11)

The non-transitory storage medium of claim 11, wherein a first coefficient of the encoding is purely real.

### Claim 13 (depends on 11)

The non-transitory storage medium of claim 11, wherein an input comprises text and the tokenized input comprises chunks generated by chunking the text.

### Claim 14 (depends on 11)

The non-transitory storage medium of claim 11, wherein an output of the quantum computing system comprises a prompt for training a large language model or comprises a prompt as input to a large language model.

### Claim 15 (depends on 11)

The non-transitory storage medium of claim 11, wherein weights associated with each of the tokens is unchanged by representing the coefficients as complex numbers.

### Claim 16 (depends on 11)

The non-transitory storage medium of claim 11, wherein the encoding comprises n tokens that are spaced equally when represented in a unity circle.

### Claim 17 (depends on 16)

The non-transitory storage medium of claim 16, wherein each of the coefficients has an equal weight.

### Claim 18 (depends on 11)

The non-transitory storage medium of claim 11, further comprising replacing coefficients in the tokenized input with complex values in the encoding.

### Claim 19 (depends on 11)

The non-transitory storage medium of claim 11, wherein the encoding represents multiple values associated with the input such that multiple values are represented in the encoding, the values including aspects of the chunks and their relative positions.

### Claim 20 (depends on 11)

The non-transitory storage medium of claim 11, wherein encoding the coefficients as complex numbers provides a different phase to each of the coefficients, wherein the positional information of the tokens in the encoding is represented by the different phases of the coefficients.
