IP Library Granted Patent US 12,436,815
Granted Patent B2
US 12,436,815 · App. 17/179,114 · Granted Oct 7, 2025

Systems and methods for using distributed quantum computing simulators

Inventors: Constantin Gonciulea (Upper Arlington, OH); Vitaliy Dorum (New York, NY); Austin Gilliam (Columbus, OH)
Assignee: JPMORGAN CHASE BANK, N.A.
G06F9/5066G06F8/451G06F9/4881G06F9/5072G06F30/27G06N10/20G06N10/80G06N20/00G06F2209/5017
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,436,815
App. No.
17/179,114
Granted
Oct 7, 2025
Kind
B2
Abstract

Systems and methods for using distributed quantum-based computing simulators are disclosed. In one embodiment, a method may include: (1) receiving, at a driver node and from a service, a set of operations and a location for each operation compiled from a set of quantum computing instructions provided by a client device; (2) generating, by the driver node, a declarative instantiation plan for the set of operations identifying a plurality of worker nodes, each worker node corresponding to one of the locations; (3) instantiating, by the driver node, the declarative instantiation plan; (4) issuing, by the driver node, the operations to the worker nodes based on the locations for each operation; (5) receiving, by the driver node, results from each worker node; (6) aggregating, by the driver node, the results; and (7) returning, by the driver node, the aggregated results to the client device via the service.

Claims (32)

1. A method for executing quantum computing instructions using a distributed quantum-based computing simulator, comprising:

identifying, by a compiling service, a number of qubits in a prefix for the quantum computing instructions received from a client device;

identifying, by the compiling service, a plurality of target qubits in the prefix;

optimizing, by the compiling service, the number of qubits in the prefix and the number of target qubits in the prefix to maximize parallel processing of the quantum computing instructions;

compiling, by the compiling service, the quantum computing instructions into a set of operations, each operation associated with a location, wherein the number of locations is based on the number of qubits in the optimized prefix;

receiving, at a driver node executed by a computer processor and from the compiling service, the set of operations and a worker node for each operation;

generating, by the driver node, a declarative instantiation plan for the set of operations, the declarative instantiation plan identifying each of the worker nodes;

instantiating, by the driver node, the declarative instantiation plan, wherein the instantiation instantiates the worker nodes;

issuing, by the driver node, the operations to the worker node for each operation, wherein the worker nodes execute the operation;

receiving, by the driver node, results from each worker node;

aggregating, by the driver node, the results; and

returning, by the driver node, the aggregated results to the client device via the service.

2. The method of claim 1 , wherein the driver node is executed by a cloud-based computer processor.

3. The method of claim 1 , wherein the set of operations and locations are optimized to maximize parallelism in processing the set of operations.

4. The method of claim 1 , wherein a provisioning service instantiates the declarative instantiation plan.

5. The method of claim 4 , wherein the provisioning service runs a control loop and listens to informer events of instantiation progress and completion.

6. The method of claim 1 , wherein at least one of the worker nodes communicates with another of the worker nodes.

7. The method of claim 1 , wherein two of the plurality of worker nodes pair up to execute an operation.

8. The method of claim 1 , wherein the driver node receives both intermediate and final results from the worker nodes.

9. A system for executing quantum computing instructions using a distributed quantum-based computing simulator, comprising:

a client device providing a set of quantum computing instructions;

a compiling service that identifies a number of qubits in a prefix for the quantum computing instructions, identifies a plurality of target qubits in the prefix, optimizes the number of qubits in the prefix and the number of target qubits in the prefix to maximize parallel processing of the quantum computing instructions, and complies the set of quantum computing instructions into a set of operations, each operation associated with a location, wherein the number of locations is based on the number of qubits in the optimized prefix;

a driver node that receives, from the compiling service, the set of operations and a worker node for each operation and generates a declarative instantiation plan for the set of operations, the declarative instantiation plan identifying each of the worker nodes, instantiates the declarative instantiation plan, wherein the instantiation instantiates the worker nodes, and issues the operations to the worker node for each operation; and

a plurality of worker nodes that execute the issued operations and provide results to the driver node;

wherein the driver node aggregates the results returns the aggregated results to the client device via the compiling service.

10. The system of claim 9 , wherein the driver node is executed by a cloud-based computer processor.

11. The system of claim 9 , wherein the set of operations and locations are optimized to maximize parallelism in processing the set of operations.

12. The system of claim 9 , wherein a provisioning service instantiates the declarative instantiation plan.

13. The system of claim 12 , wherein the provisioning service runs a control loop and listens to informer events of instantiation progress and completion.

14. The system of claim 9 , wherein at least one of the worker nodes communicates with another of the worker nodes.

15. The system of claim 9 , wherein two of the plurality of worker nodes pair up to execute an operation.

16. The system of claim 9 , wherein the driver node receives both intermediate and final results from the worker nodes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2025
From: GONCIULEA, CONSTANTIN; DORUM, VITALIY; GILLIAM, AUSTIN
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 072055/0122 →
Continuity (2)
Provisional Application 62978263 · Feb 18, 2020
Related Publication 20220309374A1 · Sep 29, 2022
References Cited (28)
US 10671550B1 · Doi · 2020 [cited by examiner]
US 11170137B1 · Richardson · 2021 [cited by examiner]
US 20030121028A1 · Coury et al. · 2003 [cited by applicant]
US 20050182614A1 · Meredith · 2005 [cited by applicant]
US 20160094415A1 · Bonagiri · 2016 [cited by examiner]
US 20190042677A1 · Matsuura · 2019 [cited by examiner]
US 20190065241A1 · Wong et al. · 2019 [cited by applicant]
US 20190102220A1 · Bishop et al. · 2019 [cited by applicant]
US 20190340532A1 · Ducore · 2019 [cited by examiner]
US 20190347575A1 · Pednault · 2019 [cited by examiner]
US 20200184031A1 · Horii · 2020 [cited by examiner]
US 20210132969A1 · Smith · 2021 [cited by examiner]
US 20210406151A1 · Durazzo · 2021 [cited by examiner]
Scaling cloud-native Apache Spark on Kubernetes for workloads in external storages Piotr Mrowczynski (Year: 2018). [cited by examiner]
Machine Learning in Compiler Optimization Zheng Wang and Michael O'Boyle (Year: 2018). [cited by examiner]
QuEST and High Performance Simulation of Quantum Computers Tyson Jones, Anna Brown, Ian Bush, and Simon Benjamin (Year: 2018). [cited by examiner]
qHiPSTER: The Quantum High Performance Software Testing Environment Mikhail Smelyanskiy, Nicolas Sawaya, and Alán Aspuru-Guzik (Year: 2016). [cited by examiner]
Parallel Environment for Simulating Quantum Computation Geva Patz Master Thesis at the Massachusetts Institute of Technology (Year: 2003). [cited by examiner]
QCMPI: A parallel environment for quantum computing ⋆ Frank Tabakin a, Bruno Juliá-Díaz (Year: 2008). [cited by examiner]
High-Performance Simulation of Interacting Multiparticle Quantum Walks with Apache Spark Andre Luiz Figueiredo de Albuquerque (Year: 2018). [cited by examiner]
Automatic Generation of Distributed Run-time Infrastructure for Internet of Things Saleh Mohamed, Matthew Forshaw and Nigel Thomas (Year: 2017). [cited by examiner]
Geelytics: Enabling On-demand Edge Analytics Over Scoped Data Sources Bin Cheng, Apostolos Papageorgiou, Martin Bauer (Year: 2016). [cited by examiner]
0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit Thomas Häner and Damian S. Steiger (Year: 2017). [cited by examiner]
Distributed Memory Techniques for Classical Simulation of Quantum Circuits Ryan LaRose https://arxiv.org/abs/1801.01037 (Year: 2018). [cited by examiner]
Designing a Fast and Flexible Quantum State Simulator Saveliy Yusufov, Charlee Stefanski, and Constantin Gonciulea (Year: 2023). [cited by examiner]
International Search Report, dated Jun. 7, 2021, from corresponding International Application No. PCT/US2021/018579. [cited by applicant]
Written Opinion of the International Searching Authority, dated Jun. 7, 2021, from corresponding International Application No. PCT/US2021/018579. [cited by applicant]
Yunseong, Nam; et al: “Automated optimization of large quantum circuits with continuous parameters”, Arxiv.Org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Oct. 19, 2017. [cited by applicant]