Prosecution Insights
Last updated: November 04, 2026
Application No. 18/676,042

QUANTUM CONTROLLER PROGRAM LOADING

Non-Final OA §103§112
Filed
May 28, 2024
Examiner
NGUYEN, VAN H
Art Unit
2199
Tech Center
2100 — Computer Architecture & Software
Assignee
Quantum Machines
OA Round
1 (Non-Final)
89%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 89% — above average
89%
Career Allowance Rate
778 granted / 872 resolved
+34.2% vs TC avg
Strong +19% interview lift
Without
With
+18.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
10 currently pending
Career history
888
Total Applications
across all art units

Statute-Specific Performance

§101
23.9%
-16.1% vs TC avg
§103
24.6%
-15.4% vs TC avg
§102
27.4%
-12.6% vs TC avg
§112
10.9%
-29.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 872 resolved cases

Office Action

§103 §112
DETAILED ACTION 1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This action is responsive to the application filed 05/28/2024. Claims 1-48 are presented for examination. Information Disclosure Statement 2. The Applicants’ Information Disclosure Statements (filed 08/27/2024 and 06/25/2025) have been received, entered into the record, and considered. Drawings 3. The drawings filed 05/28/2024 are acceptable for examination purposes. Specification 4. The specification has not been checked to the extent necessary to determine the presence of all possible minor errors. Applicant's cooperation is requested in correcting any errors of which applicant may become aware in the specification. Claim Objections 5. Claim 1 is objected to because of the following informalities: the abbreviation used in the claim should be defined. “the local program database” should read “a local program database”. Appropriate correction is required. Claim Rejections - 35 USC § 112 6. The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 1-48 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor, or for pre-AIA the applicant regards as the invention. The use of “operable to” (claims 1, 2, 22, 23, 29, 31-34, 36, 38-40, and 43-46) renders the claims indefinite because it is unclear whether the functions in the claims are actually performed. The dependent claims are rejected for fully incorporating the deficiencies of their respective base claims. To expedite a complete examination of the instant application, the claim rejected under 35 U.S.C. §112 above is examined in anticipation of Applicant amending the claim so the claimed functions are executed by a computer. Claim Rejections - 35 USC § 103 7. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent may not be obtained though the invention is not identically disclosed or described as set forth in section 102 of this title, if the differences between the subject matter sought to be patented and the prior art are such that the subject matter as a whole would have been obvious at the time the invention was made to a person having ordinary skill in the art to which said subject matter pertains. Patentability shall not be negatived by the manner in which the invention was made. Claims 1-48 are rejected under 35 U.S.C. 103 as being unpatentable Cohen et al. (US 20210067146) in view of Kanazawa et al. (US 20220253737). It is noted that any citations to specific, pages, columns, paragraphs, lines, or figures in the prior art references and any interpretation of the reference should not be considered to be limiting in any way. A reference is relevant for all it contains and may be relied upon for all that it would have reasonably suggested to one having ordinary skill in the art. See MPEP 2123. As to claim 1: Cohen teaches a system (Abstract: A system) comprising: a pulse processor operable to produce a pulse according to a quantum program (Figs.1, 2a-2c; [0023]: The programming subsystem 252 comprises circuitry operable to generate pulse program description 256 which configures the pulse controller 260 and includes instructions the pulse controller 260 can execute to carry out the pulse program (i.e., generate the necessary outbound pulse(s) 253, process feedback generated in response to the pulse(s) and received via channel 208, and/or process inbound pulses 215) with little or no human intervention during runtime… the programming subsystem 252 is a personal computer comprising a processor, memory, and other associated circuitry (e.g., an x86 or x64 chipset) having installed on it a pulse orchestration software development kit (SDK) that enables creation (e.g., by a user via a text editor, integrated development environment (IDE), and/or by automated pulse program description generation circuitry) of a high-level (as opposed to binary or “machine code”) pulse program description 256; [0028]: the pulse target 258 is a quantum processor); a pulse processor memory operable to store a plurality of elements of the quantum program (Figs.1, 2a-2c; [0023]: The programming subsystem 252 comprises circuitry operable to generate pulse program description 256 which configures the pulse controller 260 and includes instructions the pulse controller 260 can execute to carry out the pulse … the programming subsystem 252 is a personal computer comprising a processor, memory, and other associated circuitry (e.g., an x86 or x64 chipset) having installed on it a pulse orchestration software development kit (SDK) that enables creation (e.g., by a user via a text editor, integrated development environment (IDE), and/or by automated pulse program description generation circuitry) of a high-level (as opposed to binary or “machine code”) pulse program description 256; [0035]: Quantum computers operate by storing information in the form of quantum bits (“qubits”); [0043]: The quantum processor 218 comprises K (an integer) quantum elements 122, which includes qubits (which could be of any type such as superconducting, spin qubits, ion trapped, etc.), and, where applicable, any other element(s) for processing quantum information, storing quantum information (e.g. storage resonator), and/or coupling the outbound quantum control pulses 213 and inbound quantum control pulses 215 between interconnect 212 and the quantum element(s) 122 (e.g., readout resonator(s))); a program loading component operable to load the plurality of elements of the quantum program from an external RAM ([0064]: Machine code quantum pulse program descriptions may be received via the I/O manager 368. Accordingly, the I/O manager 368 may comprise circuitry for loading the machine code into the necessary registers/memory (including any SRAM, DRAM, FPGA BRAM, flash memory, programmable read only memory, etc.) of the quantum controller 210 as well as for reading contents of the registers/memory of the quantum controller 210 and conveying the contents to the quantum programming subsystem 202; [0066]: The memories 402, 404, 406 may comprise one or more be any type of suitable storage elements (e.g., DRAM, SRAM, Flash, etc.). The instructions stored in memory 402 are instructions to be executed out by the pulser 302.sub.l for carrying out its role in a quantum algorithm. Because different pulsers 302.sub.0-302.sub.L−1 have different roles to play in any particular quantum algorithm (e.g., generating different pulses at different times), the instructions memory 402 for each pulser 302.sub.l may be specific to that pulser); and digital circuitry operable to execute a list of transactions associated with an operation of the program loading component ([0067]: The control circuitry 408 is operable to execute the instructions stored in memory 402 to process inbound signal AI.sub.l, generate raw outbound pulses CP′.sub.l, and generate digital control signals in_slct.sub.l, out_slct.sub.l, D_port.sub.l, D.sub.l, IF.sub.l, F.sub.l, ops_slct.sub.l, ops_ctrl.sub.l, results.sub.l, dmod_slct.sub.l and pair.sub.l.; see also, [0040-0041], [0069]). Cohen, however, does not explicitly teach the following additional limitations: Kanazawa teaches management software operable to preload the element of the quantum program into the local program database (Fig. 3; [0030]: system 300 includes a database 310, a host processor 320, a calibration controller 330 for a quantum computing device, a quantum processor 340, and a readout unit 350. In operation, host processor 320 can call (or retrieve) an entire calibration program from database 310 and load (or preload) that program into an instruction buffer 332 of calibration controller 330). It would have been obvious to a person of ordinary skill in the art, before the effective filing date of the claimed invention, to modify Cohen with Kanazawa because it would have provided the enhanced capability for facilitating hardware-efficient calibration protocols for quantum computing devices. As to claim 2: Cohen teaches a look-up table operable to store a list of transactions associated with an operation of the program loading component ([0035-0036] and [0066-0068]). As to claim 3: Cohen teaches the quantum program is pre-compiled ([0106-0109]). As to claim 4: Cohen teaches the element of the quantum program is one of a plurality of program execution elements, and the plurality of program execution elements comprises waveform data, instructions, commands and program variables data ([0038], [0104], and [0113-0116]). As to claim 5: Cohen teaches the element of the quantum program is one of a plurality of scatter-gather descriptors ([0023-0025], [0040-0043], and [0050]). As to claim 6: Cohen teaches the element of the quantum program is a memory-copy routine ([0047] and [0060]). As to claim 7: Cohen teaches the memory-copy routine comprises a source address in the external RAM and a destination address in the pulse processor memory ([0064] and [0066]). As to claim 8: Cohen teaches the memory-copy routine comprises a transaction length and a transaction type ([0049], [0113-0115], and [0122-0125]).As to claim 9: Cohen teaches the element of the quantum program is a register-write routine ([0063-0064] and [0113]). As to claim 10: Cohen teaches the register-write routine comprises a hardware register initialization sequence to be executed before the quantum program starts ([0063-0064] and [0113]). As to claim 11: Cohen teaches the system comprises a plurality of pulse processors that are programmable in parallel ([0028], [0041-0045], [0113], and [0201]). As to claim 12: Cohen teaches a control unit configured to time an access to one or more of the digital circuitry, the pulse processor memory and the external memory ([0025-0027], [0041-0043], and [0061-0064]). As to claim 13: Cohen teaches a control unit configured to manage external requests to one or more of the digital circuitry, the pulse processor memory and the external memory ([0025-0027], [0041-0043], and [0061-0064]).As to claim 14: Cohen teaches the quantum program is one of a plurality of programs that is scheduled with one or more parameters ([0113], [0155-0158], and [0166]). As to claim 15: Cohen teaches the one or more parameters are acquired by a previous program of the plurality of programs according to a look-up table ([0113], [0155-0158], and [0166]). As to claim 16: Cohen teaches the one or more parameters are streamed from an external device according to the digital circuitry, thereby harvesting compute power of the external device to generate a next program according to one or more historical programs ([0113], [0155-0158], and [0166]). As to claim 17: Cohen teaches the one or more parameters are streamed before the quantum program executes ([0113], [0155-0158], and [0166]). As to claim 18: Cohen teaches the one or more parameters are streamed while the quantum program is running ([0113], [0155-0158], and [0166]). As to claim 19: Cohen teaches the one or more parameters are determined according to measurements performed by the quantum program ([0113], [0128-0129], and [0132-0134]). As to claim 20: Cohen teaches output from one or more programs, of the plurality of programs, is processed by an external processor and streamed back into the system ([0049-0051] and [0113]). As to claim 21: Cohen teaches the one or more parameters are obtained from a static database ([0113] and [0137]).As to claim 22: Cohen teaches the external RAM is operable to extend the pulse processor memory accessible by the quantum program ([0064-0066]). As to claim 23: Cohen teaches the external RAM is operable to load one or more of waveform data, a pulse parameter and a quantum program instruction ([0038], [0104], and [0113-0116]).As to claim 24: Cohen teaches data selected to be loaded from the external RAM is based on one or more results from the quantum program ([0023-0025] and [0064-0066]).As to claim 25: Cohen teaches the quantum program is executable while data is loaded from the external RAM ([0023-0025] and [0064-0066]). As to claim 26: Cohen teaches the system is a quantum controller ([0038-0040] and [0047]).As to claim 27: Cohen teaches the look-up table is organized according to a graph ([0107]). As to claim 28: Cohen teaches the look-up table is configured to calibrate a quantum processor (Figs. 12A, 12B, [0078], and [0081]).As to claim 29: Cohen teaches the stored list of transactions is operable to serve a scalable quantum computer without having to scale the digital circuitry ([0051-0054]).As to claim 30: Cohen teaches the quantum program pulls data from the local program database according to a consumer index maintained in a lookup table ([0196-0199]).As to claim 31: Cohen teaches the management software is operable to control an execution by the memory loading engine ([0023-0025] and [0064-0066]).As to claim 32: Cohen teaches a client device is operable to push data to the management software ([0062] and [0077]). As to claim 33: Cohen teaches the management software is operable to load a data item into the local program database ([0023-0025] and [0064-0066]). As to claim 34: Cohen teaches the management software is operable to maintain a producer index in the memory loading engine ([0063-0064] and [0155]). As to claim 35: Cohen teaches the producer index is stored in a lookup table ([0063-0064] and [0155]). As to claim 36: Cohen teaches the pulse processor memory is operable to pop a data item from the memory loading engine ([0023-0025] and [0200]). As to claim 37: Cohen teaches the data item is stored in a lookup table ([0063-0064] and [0155]).As to claim 38: Cohen teaches the management software is operable to load extended data memory into the local program database ([0023-0025] and [0064-0066]). As to claim 39: Cohen teaches the pulse processor memory is operable to request a data item from a lookup table ([0023-0025], [0041], [0053], and [0064-0066]). As to claim 40: Cohen teaches the management software is operable to indicate, to the memory loading engine, when data has been copied to the local program database ([0023-0025] and [0064-0066]).As to claim 41: Cohen teaches the indication comprises metadata ([0040-0041]). As to claim 42: Cohen teaches the metadata is maintained in a lookup table associated with the memory loading engine ([0023-0025], [0060], and [0066]).As to claim 43: Cohen teaches the pulse processor memory is operable to update a parameter of the quantum program while the quantum program is running ([0026], [0074], and [0113]). As to claim 44: Cohen teaches the pulse processor memory is operable to update a parameter of the quantum program via a memory-copy routine ([0026], [0074], and [0113]).As to claim 45: Cohen teaches the pulse processor memory is operable to update a parameter of the quantum program via a register-copy routine ([0026], [0074], and [0113]).As to claim 46: Cohen teaches a client device is operable to stream data to the management software, and the data is calculated independently from previous results ([0025], [0041], [0057], and [0077]). As to claim 47: Cohen teaches the data is loaded according to one or more pulses ([0025], [0041], [0053], [0060], and [0066]).As to claim 48: Cohen teaches the data is loaded according to one or more parameters ([0025], [0041], [0140], and [0200]). Conclusion 7. The prior art made of record, listed on PTO 892 provided to Applicant is considered to have relevancy to the claimed invention. Applicant should review each identified reference carefully before responding to this office action to properly advance the case in light of the prior art. US 11671180 discloses “A channel between quantum controller modules (e.g., pulse processors) is operable to communicate high speed data required for processing qubit states that may be distributed across a quantum computer. The latency of the communication channel is deterministic and controllable according to a system clock domain”. US 12242406 discloses “A set of quantum controllers are operable to transmit quantum state data to a quantum control switch. The quantum control switch comprises vector processors that operate on the quantum state data from the set of quantum controllers. Each vector processor transmits a result of the operation to a corresponding quantum controller in the set of quantum controllers”. US 12450513 discloses “Quantum algorithms are performed via a quantum computer, by generating a quantum control pulse in a quantum controller and transmitting the quantum control pulse to a quantum processor. The quantum control pulse interacts with a qubit in the quantum processor. Within the quantum controller, a pulse processor generates a plurality of raw pulses that are modified by a front end hardware module. During the normal operation of the quantum controller, samples of the raw and/or modified pulses may be selected and saved to memory”. US 12761919 discloses “The QC comprises circuitry operable to load the machine code quantum algorithm description from the programming subsystem via the interconnect. Then, execution of the machine code by the QC causes the QC to generate the necessary outbound quantum control pulse(s) that correspond to the desired operations to be performed on the quantum processor (e.g., sent to qubit(s) for manipulating a state of the qubit(s) or to readout resonator(s) for reading the state of the qubit(s), etc.). Depending on the quantum algorithm to be performed, outbound pulse(s) for carrying out the algorithm may be predetermined at design time and/or may need to be determined during runtime. The runtime determination of the pulses may comprise performance of classical calculations and processing in the QC during runtime of the algorithm (e.g., runtime analysis of inbound pulses received from the quantum processor”. Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to VAN H. NGUYEN whose telephone number is (571) 272-3765. The examiner can normally be reached on Monday- Friday from 9:00AM to 5:30 PM. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, LEWIS BULLOCK, can be reached at telephone number (571) 272-3759. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from Patent Center and the Private Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from Patent Center or Private PAIR. Status information for unpublished applications is available through Patent Center or Private PAIR to authorized users only. Should you have questions about access to Patent Center or the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) Form at https://www.uspto.gov/patents/uspto-automated- interview-request-air-form. /VAN H NGUYEN/ Primary Examiner, Art Unit 2199
Read full office action

Prosecution Timeline

May 28, 2024
Application Filed
Oct 20, 2026
Non-Final Rejection mailed — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12775488
METHOD, APPARATUS, AND SYSTEM FOR MULTI-MODAL MULTI-TASK PROCESSING
3y 4m to grant Granted Oct 27, 2026
Patent 12775509
GENERATING A MODIFIED APPLICATION PROGRAMMING INTERFACE RESPONSE INCLUDING A MODIFIED POINTER ASSOCIATED WITH AN ENCRYPTED VALUE
3y 1m to grant Granted Oct 27, 2026
Patent 12761949
WORKFLOW MANAGEMENT METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT WITH DYNAMIC WORKFLOW CREATION FOR MODIFYING A WORKFLOW BASED ON AN ELEMENT CONFIGURATION OF AN ELEMENT AT WHICH THE MODIFIED WORKFLOW IS TO BE EXECUTED
3y 8m to grant Granted Oct 13, 2026
Patent 12748636
DYNAMIC SITE SELECTION IN GLOBAL SERVER LOAD BALANCING (GSLB) ENVIRONMENT
2y 11m to grant Granted Sep 29, 2026
Patent 12743306
TECHNIQUES FOR BEHAVIORAL PAIRING IN A TASK ASSIGNMENT SYSTEM WITH AN EXTERNAL PAIRING SYSTEM
2y 6m to grant Granted Sep 22, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
89%
Grant Probability
99%
With Interview (+18.7%)
3y 3m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 872 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month