Prosecution Insights
Last updated: October 21, 2026
Application No. 18/843,928

QUANTUM-KERNEL-BASED REGRESSION

Non-Final OA §102
Filed
Sep 04, 2024
Priority
Mar 07, 2022 — EU 22160629.6 +1 more
Examiner
MACKES, KRIS E
Art Unit
2153
Tech Center
2100 — Computer Architecture & Software
Assignee
Pasqal Netherlands B V
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
87%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allowance Rate
413 granted / 542 resolved
+21.2% vs TC avg
Moderate +11% lift
Without
With
+10.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
11 currently pending
Career history
557
Total Applications
across all art units

Statute-Specific Performance

§101
16.5%
-23.5% vs TC avg
§103
57.1%
+17.1% vs TC avg
§102
8.3%
-31.7% vs TC avg
§112
7.1%
-32.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 542 resolved cases

Office Action

§102
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 102 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 (i.e., changing from AIA to pre-AIA ) 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 the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 1, 3, 12, and 15 with an earliest effective filing date of 3/7/22 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Gambetta et al. (U.S. Publication No. 2020/0320437 published on 10/8/20 as cited on IDS). With respect to claim 1, the Gambetta reference teaches a method for solving a regression problem over a problem domain using a hybrid computer system, the hybrid computer system comprising a quantum computer system and a classical computer system, the method comprising: receiving or determining, by the classical computer system, a regression problem description and a set of kernel points in the problem domain (prepare quantum state [paragraph 91 and Figure 5] classification problem also applies to regression [paragraph 13]); receiving or determining, by the classical computer system, a trial function associated with the regression problem, the trial function being a quantum kernel function based on a quantum kernel and being parameterized by a plurality of kernel coefficients (SVM objective function, training samples, the kernel parameters are optimized by the quantum computer and the remaining SVM parameters of the SVM object function by the classical computer [paragraphs 45-47, 55, 56, and 115]); determining, using the quantum computer system, for each of the kernel points, a kernel value of the quantum kernel and/or a kernel derivative value of a derivative of the quantum kernel (step 1208 [figures 5 & 12 and paragraphs 81 & 114]); determining, by the classical computer system, a set of optimal kernel coefficients based on the kernel value and/or kernel derivative value, and based on the regression problem description (classification optimization scheme to update parameters [Figures 5 & 12 and paragraphs 45-47, 55, 56, 91, 92, & 115]); and determining, by the classical computer system, a solution function based on the trial function and the set of optimal kernel coefficients (classification using the classifier also applies to regression [paragraphs 13 and 116]). With respect to claim 3, the Gambetta reference teaches all the limitations of claim 1 as described above. In addition, the Gambetta reference teaches that the regression problem includes data regression and wherein the regression problem description comprises a set of training data in the problem domain and associated training values (the optimization program uses training samples [paragraph 47]). With respect to claim 12, the limitations of claim 12 are merely the hybrid computer system embodiment of claim 1 and claim 12 recites no further significant limitations therein. Therefore, the limitations of claim 12 are rejected in the analysis of claim 1 and claim 12 is likewise rejected on the same basis. With respect to claim 15, the limitations of claim 15 are merely the non-transitory computer-readable storage medium embodiment of claim 1 and claim 15 recites no further significant limitations therein. Therefore, the limitations of claim 15 are rejected in the analysis of claim 1 and claim 15 is likewise rejected on the same basis. Claims 2, 4-11, 13, and 16-21 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Herbert U.S. Patent No. 12,639,610 A quantum computing system includes a classical computer coupled in combination with a quantum computer, wherein the quantum computing system is configurable to execute program instructions to process input data to generate corresponding output data. The program instructions include one or more arithmetic functions to be executed using the quantum computer. The quantum computing system is configured to apply a transformation to transform the one or more arithmetic functions into a series of Fourier components that are executable using the quantum computer by using one or more quantum circuits utilizing rotation gates acting on qubits representing the Fourier components, and to process outputs from the one or more quantum circuits to generate results of the one or more arithmetic functions, wherein the results are used to generate the corresponding output data. Corcoles-Gonzalez et al. U.S. Publication No. 2019/0378025 Techniques and a system to facilitate quantum computation are provided. In one example, a system includes a processor that executes computer executable components stored in a memory; a quantum feature map circuit component that estimates a kernel associated with a feature map; and a support vector machine component that performs a classification using the estimated kernel. Cao U.S. Publication No. 2020/0104740 A hybrid quantum-classical (HQC) computer system, which includes a classical computer and a quantum computer, solves linear systems. The HQC computer system splits the linear system to be solved into subsystems that are small enough to be solved by the quantum computer, under control of the classical computer. The classical computer synthesizes the outputs of the quantum computer to generate the complete solution to the linear system. Cao et al. U.S. Publication No. 2020/0327441 A hybrid quantum-classical computing method for solving optimization problems though applications of non-unitary transformations. An initial state is prepared, a transformation is applied, and the state is updated to provide an improved answer. This update procedure is iterated until convergence to an approximately optimal solution. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KRIS E MACKES whose telephone number is (571)270-3554. The examiner can normally be reached Monday-Friday 9:00-4:00 EST. 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) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kavita Stanley can be reached at 571-272-8352. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /KRIS E MACKES/Primary Examiner, Art Unit 2153
Read full office action

Prosecution Timeline

Sep 04, 2024
Application Filed
Oct 02, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12769705
ROBOTIC PROCESS AUTOMATION FOR DOCUMENT UNDERSTANDING THAT INTEGRATES GENERATIVE ARTIFICIAL INTELLIGENCE MODELS
2y 10m to grant Granted Oct 20, 2026
Patent 12755202
METHOD AND SYSTEM FOR LEARNABLE AUGMENTATION FOR TIME SERIES PREDICTION UNDER DISTRIBUTION SHIFTS
3y 2m to grant Granted Oct 06, 2026
Patent 12725080
SIMULTANEOUS DATA SAMPLING AND FEATURE SELECTION VIA WEAK LEARNERS
3y 1m to grant Granted Sep 01, 2026
Patent 12711536
TECHNIQUES FOR PERFORMING MATRIX COMPUTATIONS USING HIERARCHICAL REPRESENTATIONS OF SPARSE MATRICES
1y 10m to grant Granted Aug 18, 2026
Patent 12711184
ENSEMBLE AUGMENTATION WITH ENHANCED KNOWLEDGE EXTRACTION TECHNIQUES
1y 5m to grant Granted Aug 18, 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
76%
Grant Probability
87%
With Interview (+10.8%)
2y 11m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 542 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