# US 12,223,343 B2 · Quantum process parallelization > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,223,343 B2 - Document ID: US12223343B2 - Status: Granted - Kind: B2 - Application number: 17/649,034 - Filed: 2022-01-26 - Published: 2023-07-27 - Granted: 2025-02-11 - Earliest claimed: 2022-01-26 - Assignees: The Boeing Company - Applicants: The Boeing Company - Inventors: Nam H. Nguyen; Richard J. Thompson; Marna M. Kagele - Web page: https://patentgrep.com/patent/US12223343B2 ## CPC - G06F 9/48: Program initiating; Program switching, e.g. by interrupt - G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)} - G06F 9/5044: {considering hardware capabilities} - G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound - G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena - 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 - G06F 9/5011: {the resources being hardware resources other than CPUs, Servers and Terminals} - G06F 2209/5017: Task decomposition - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS ## Abstract 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. ## Claims ### Claim 1 A method for parallelizing quantum processes for processing a problem, the method comprising a computer system: identifying subproblems in the problem based on a structure of the problem; identifying attributes comprising at least one of: a precision level, a depth of quantum gates, or a cross talk error, respectively, for each subproblem in the subproblems; identifying, respectively for each subproblem in the subproblems, a number of quantum computers, in a set of quantum computers, comprising properties designed for processing attributes of the subproblem; and executing jobs in parallel on the set of quantum computers solving all the subproblems. ### Claim 2 (depends on 1) The method of claim 1, further comprising the computer system sending a result, from executing the jobs in parallel that is outside of a tolerance, to an optimization process. ### Claim 3 (depends on 1) The method of claim 1, further comprising: the properties comprising characteristics of: a number quantum circuits, a number of qubits available, or a depth of a quantum circuit. ### Claim 4 (depends on 1) The method of claim 1, wherein the subproblems are independent of each other, wherein a subproblem is independently solved from other subproblems. ### Claim 5 (depends on 1) The method of claim 1, wherein the problem is solving an eigenvalue problem for a matrix and wherein identifying, by the computer system, the subproblems in the problem based on the structure of the problem comprises: identifying, by the computer system, Pauli strings for the matrix; and placing, by the computer system, the Pauli strings into groups that form the subproblems, wherein the Pauli strings in a group can be run on a same quantum circuit. ### Claim 6 (depends on 1) The method of claim 1, further comprising the properties comprising a number of quantum circuits. ### Claim 7 (depends on 6) The method of claim 6, wherein the attributes further comprise a number of qubits determined by a size of a Pauli string forming a subproblem. ### Claim 8 A parallel processing system configured to solve a quantum problem, wherein the parallel processing system comprises: a computer system; and a quantum controller in the computer system, wherein the quantum controller is configured to: identify subproblems in a problem based on a structure of the problem; identify attributes that comprise at least one of: a precision level, a depth of quantum gates, or a cross talk error, respectively, for each subproblem in the subproblems; identify, respectively for each subproblem in the subproblems, quantum circuits in a set of quantum computers that comprise properties designed to process the attributes of the subproblem; and execute jobs in parallel on the quantum circuits to solve the subproblems. ### Claim 9 (depends on 8) The parallel processing system of claim 8, wherein the quantum controller is further configured to send a result from executing the jobs to an optimization process. ### Claim 10 (depends on 8) The parallel processing system of claim 8, wherein the quantum controller is further configured to repeat execution of the jobs on the quantum circuits and solve the subproblems in response to a result that is outside of a tolerance. ### Claim 11 (depends on 8) The parallel processing system of claim 8, wherein the subproblems are independent of each other, wherein a subproblem is independently solved from other subproblems. ### Claim 12 (depends on 8) The parallel processing system of claim 8, wherein the problem is solving an eigenvalue problem for a matrix and wherein in identifying the subproblems in the problem based on the structure the problem, the quantum controller is configured to: identifying Pauli strings for the matrix; and placing the Pauli strings into groups that form the subproblems, wherein the Pauli strings in a group can be run on a same quantum circuit. ### Claim 13 (depends on 8) The parallel processing system of claim 8, wherein in identifying the quantum circuits to process the subproblems, the quantum controller is configured to: identifying attributes of the subproblems; and selecting the set of quantum computers having quantum circuits to handle the attributes of the subproblems. ### Claim 14 (depends on 13) The parallel processing system of claim 13, wherein the attributes are selected from at least one of a number of qubits, number of quantum circuits, a precision level, a depth of the quantum circuits, or a cross talk error. ### Claim 15 A computer program product configured to run parallel quantum processes, wherein the computer program product comprises a non-transitory computer readable storage medium that comprises program code embodied therewith, the program code configured for execution by a computer system to cause the computer system to: identify subproblems in a problem based on a structure of the problem; identify attributes that comprise at least one of: a precision level, a depth of quantum gates, or a cross talk error, respectively, for each subproblem in the subproblems; identify, respectively for each subproblem in the subproblems, quantum circuits in a set of quantum computers that comprise properties designed to process the attributes of the subproblem; and execute jobs in parallel on the quantum circuits that solve the subproblems. ### Claim 16 (depends on 15) The computer program product of claim 15, wherein the program code is further configured to send a result of an execution of the jobs in parallel to an optimization process. ### Claim 17 (depends on 16) The computer program product of claim 16, wherein the optimization process comprises a repeated, by the computer system, execution of the jobs on the quantum circuits to solve the subproblems in response a result that is outside of a tolerance. ### Claim 18 (depends on 15) The computer program product of claim 15, wherein the subproblems are independent of each other, wherein a subproblem is independently solved from other subproblems. ### Claim 19 (depends on 15) The computer program product of claim 15, wherein the problem is solving an eigenvalue problem for a matrix and wherein the program code is further configured to identify Pauli strings for the matrix; and place the Pauli strings into groups that form the subproblems, wherein the Pauli strings in a group can be run on a same quantum circuit. ### Claim 20 (depends on 15) The computer program product of claim 15, wherein the attributes further comprise a number of qubits.