Quantum Process Parallelization via Subproblem Segmentation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current quantum computers face challenges in efficiently solving large problems due to insufficient resources, leading to prolonged runtime and high costs.

Innovation Solution

A method for parallelizing quantum processes by identifying subproblems based on the problem structure, assigning these subproblems to suitable quantum circuits across a set of quantum computers, and executing jobs on these circuits to solve the subproblems.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If quantum algorithms are used to solve larger problems, then problem-solving capability is improved, but runtime increases beyond desired limits

Engineering Contradiction:

Improveproblem-solving capabilityVSAvoidruntime

Core Design Contradiction:

Adaptability or versatilityVSDuration of action of moving object

Solution Approach 1:

The patent divides a large quantum problem into multiple subproblems that can be processed independently. Each subproblem is assigned to a separate quantum circuit or quantum computer, allowing parallel execution. This segmentation reduces the overall runtime while maintaining the capability to solve larger problems by combining results from subproblems.

Inventive Principle:

Principle #1Segmentation

2Adaptability or versatility

If quantum algorithms are used to solve larger problems, then problem-solving capability is improved, but computational resources become insufficient

Engineering Contradiction:

Improveproblem-solving capabilityVSAvoidquantum computer resources

Core Design Contradiction:

Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

The patent segments a large quantum problem into smaller subproblems that can be solved using available quantum computer resources. By dividing the problem, each subproblem requires fewer quantum resources (qubits, gates, circuit depth) than the original problem, making it feasible to solve with current quantum hardware while still addressing the larger overall problem through aggregation of subproblem solutions.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent combines results from multiple quantum computers or quantum circuits that solve different subproblems to form the solution to the overall problem. This merging approach allows the system to solve problems larger than what any single quantum computer could handle independently, effectively pooling resources across multiple systems.

Inventive Principle:

Principle #5Merging (Combining)

3Adaptability or versatility

If quantum algorithms are used to solve larger problems, then problem-solving capability is improved, but costs increase

Engineering Contradiction:

Improveproblem-solving capabilityVSAvoidcomputational cost

Core Design Contradiction:

Adaptability or versatilityVSLoss of energy

Solution Approach 1:

The patent segments the problem to allow parallel processing across multiple quantum computers or circuits. This segmentation enables more efficient resource utilization and reduces the total computational cost by distributing the workload, rather than requiring one large, expensive quantum computation that would consume more resources overall.

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS12223343B2Quantum process parallelization

Publication Date: 2025.02.11 THE BOEING CO

AI summary

A method, apparatus, computer system, and computer program product for parallelizing quantum processes for processing a problem. A computer system identifies subproblems in the problem based on a structure of the problem. The computer system identifies quantum circuits in a set of quantum computers to process the subproblems. The computer system executes jobs on the quantum circuits to solve the subproblems.