# US 2026/0065119 A1 · System and method for hybrid analysis of quantum and classical genetic algorithms

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

- Number: US 2026/0065119 A1
- Document ID: US20260065119A1
- Status: Published application
- Kind: A1
- Application number: 18/819,943
- Filed: 2024-08-29
- Published: 2026-03-05
- Earliest claimed: 2024-08-29
- Assignees: Accenture Global Solutions Limited
- Applicants: Accenture Global Solutions Limited
- Inventors: Paulo André Viana DE ARAÚJO; Saulo Cadete Santos MACHADO; Eric GORESCU
- Web page: https://patentgrep.com/patent/US20260065119A1

## CPC

- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 3/126: Evolutionary algorithms, e.g. genetic algorithms or genetic programming
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

System and method for hybrid analysis of quantum and classical genetic algorithms is disclosed. The method includes, receiving an input bitstring, the input bitstring being an output of a genetic optimization module, processing the input bitstring to generate quantum processed bitstrings, mutating the input bitstring, mutating the quantum processed bitstrings as a function of the input bitstring and the mutated input bitstring, performing crossover on a combination of the mutated input bitstring and the mutated quantum processed bitstrings, and selecting a set of individuals from the quantum processed bit strings and output of the crossover. The method further includes, determining, after selecting the set of individuals, if the hybrid analysis is complete or incomplete based on predetermined criteria, returning, in response to the hybrid analysis being incomplete, the set of individuals as the input bit string, else, outputting the set of individuals as a result of the hybrid analysis.

## Claims

### Claim 1

A method of hybrid analysis of quantum and classical genetic algorithms, comprising:
receiving an input bitstring, the input bitstring being an output of a genetic optimization module;
processing the input bitstring to generate quantum processed bitstrings;
mutating the input bitstring;
mutating the quantum processed bitstrings as a function of the input bitstring and the mutated input bitstring;
performing crossover on a combination of the mutated input bitstring and the mutated quantum processed bitstrings; and
selecting a set of individuals from at least the quantum processed bit strings and output of the crossover.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining, after selecting the set of individuals, if the hybrid analysis is complete or incomplete based on predetermined criteria;
returning, in response to the hybrid analysis being incomplete, the set of individuals as the input bit string;
outputting, in response to the hybrid analysis being complete, the selected set of individuals as a result of the hybrid analysis of the quantum and classical genetic algorithms.

### Claim 3 (depends on 2)

The method of claim 2, wherein the predetermined criteria are either a predetermined number of iterations or a predefined error rate.

### Claim 4 (depends on 1)

The method of claim 1, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 5 (depends on 1)

The method of claim 1, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
mutating the qubits in superposition;
performing crossover on the mutated qubits in superposition; and
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 6 (depends on 1)

The method of claim 1, wherein the input bitstring is one of an output of a classical genetic optimization module or an output of a quantum genetic optimization module.

### Claim 7

A non-transitory computer readable storage media coupled to a processor and having instructions storing thereon which, when executed by the processor, cause the processor to perform operations for hybrid analysis of quantum and classical generic algorithms, the operations comprising:
receiving an input bitstring, the input bitstring being an output of a genetic optimization module;
processing the input bitstring to generate a quantum processed bitstrings;
mutating the input bitstring;
mutating the quantum processed bitstrings as a function of the input bitstring and the mutated input bitstring;
performing crossover on a combination of the mutated input bitstring and the mutated quantum processed bitstrings; and
selecting a set of individuals from at least the quantum processed bit strings and output of the crossover.

### Claim 8 (depends on 7)

The non-transitory computer readable media of claim 7, further comprising:
determining, after the selecting the set of individuals, if the hybrid analysis is complete or incomplete based on predetermined criteria;
returning, in response to the hybrid analysis being incomplete, the set of individuals as the input bit string;
outputting, in response to the hybrid analysis being complete, the selected set of individuals as a result the hybrid analysis of the quantum and classical genetic algorithms.

### Claim 9 (depends on 8)

The non-transitory computer readable media of claim 8, wherein the predetermined criteria are either a predetermined number of iterations or a predefined error rate value is satisfied.

### Claim 10 (depends on 7)

The non-transitory computer readable media of claim 7, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 11 (depends on 7)

The non-transitory computer readable media of claim 7, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
mutating the qubits in superposition;
performing crossover on the mutated qubits in superposition; and
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 12 (depends on 7)

The non-transitory computer readable media of claim 7, wherein the input bitstring is one of an output of a classical genetic optimization module or an output of a quantum genetic optimization module.

### Claim 13

A system of for hybrid analysis of quantum and classical generic algorithms, the system comprising:
a non-transitory computer readable media storing instructions;
a processor programmed to execute the instructions stored in the computer readable media to perform operations including:
receiving an input bitstring, the input bitstring being an output of a genetic optimization module;
processing the input bitstring to generate quantum processed bitstrings;
mutating the input bitstring;
mutating the quantum processed bitstrings as a function of the input bitstring and the mutated input bitstring;
performing crossover on a combination of the mutated input bitstring and the mutated quantum processed bitstrings; and
selecting a set of individuals from at least the quantum processed bit strings and output of the crossover.

### Claim 14 (depends on 13)

The system of claim 13, the operations further comprising:
determining, after selecting the set of individuals, if the hybrid analysis is complete or incomplete based on predetermined criteria;
returning, in response to the hybrid analysis being incomplete, the set of individuals as the input bit string;
outputting, in response to the hybrid analysis being complete, the selected set of individuals as a result of the hybrid analysis of the quantum and classical genetic algorithms.

### Claim 15 (depends on 13)

The system of claim 13, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 16 (depends on 13)

The system of claim 13, wherein processing the input bitstring comprises:
converting the input bitstring to qubits;
placing the qubits in superposition;
mutating the qubits in superposition;
performing crossover on the mutated qubits in superposition; and
measuring quantum information based on state of the qubits in superposition to generate the quantum processed bit strings.

### Claim 17 (depends on 13)

The system of claim 13, wherein the input bitstring is one of an output of a classical genetic optimization module or an output of a quantum genetic optimization module.
