Prosecution Insights
Last updated: November 18, 2026
Application No. 17/934,283

SYSTEMS AND METHOD FOR IMPROVED IDENTIFICATION OF ENCODINGS FOR FERMIONIC MODE TO QUBIT MAPPINGS

Final Rejection §101
Filed
Sep 22, 2022
Examiner
DE LA GARZA, CARLOS HEBERTO
Art Unit
2182
Tech Center
2100 — Computer Architecture & Software
Assignee
Phasecraft Limited
OA Round
2 (Final)
71%
Grant Probability
Favorable
3-4
OA Rounds
99%
With Interview

Examiner Intelligence

Grants 71% — above average
71%
Career Allowance Rate
15 granted / 21 resolved
+16.4% vs TC avg
Strong +38% interview lift
Without
With
+38.1%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
21 currently pending
Career history
53
Total Applications
across all art units

Office Action

§101
DETAILED ACTION 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 final and is in response to the claims filed 09/04/2026. Claims 1-6, 8-13, 15, 17, 19-21, 26, and 28 are currently pending, of which claims 1-6, 8-13, 15, 17, 19-21, 26, and 28 are currently rejected. Response to Arguments Applicant’s arguments filed on 09/04/2026 have been fully considered. Drawings: Drawing objections have been withdrawn necessitated by amendments. Claim objections: Objections to claims have been withdrawn necessitated by amendments. 35 U.S.C. 112: Rejections under 35 U.S.C. 112(b) have been withdrawn necessitated by amendments. 35 U.S.C. 101: Applicant’s arguments regarding the 35 U.S.C. 101 rejection have been fully considered, but they are not persuasive. Applicant argues in page 13 of 18 that claim 1 is directed to a computer-implemented method that is aligned with Example 39 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42. Applicant specifically argues: The claim is directed to a computer-implemented method, in alignment with Example 39 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42, and therefore does not recite any of the judicial exceptions, such as mathematical relationships, formulas or calculations. By analogy with Example 39 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42, while some of the limitations may be based on mathematical concepts, the mathematical concepts are not recited in the claims. This is in part because features such as fermionic operators, and under the generated encodings, Pauli operators, are physical processes that govern the functionality of a quantum information processor. Therefore, claim 1 satisfies the criteria of step 2A prong one. Examiner respectfully disagrees. Example 39 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42 discloses a method for training a neural network for facial detection. This example is irrelevant to the instant application, as the instant application discloses a fermion-to-qubit mapping method. Claims in the instant application are directed to the mathematical concepts implemented in generic computer components and generally linked to a particular technological environment. See 35 U.S.C. 101 rejection below. Applicant further argues in page 13 of 18 that claim 1 discloses an encoding step that provides a practical implementation of the method steps of claim 1, in line with Example 37 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42. Applicant specifically argues: Furthermore, the step of encoding the selected relatively lower cost complete mapping onto the quantum information processor provides a practical implementation of the method steps of claim 1, in line with claim 1 of Example 37 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42. That is, the method as a whole is integrated into a practical application, thus additionally satisfying step 2A prong two. Examiner respectfully disagrees. Example 37 of the Subject Matter Eligibility Examples: Abstract Ideas 37 to 42 discloses relocation of icons on a graphical user interface. This example is irrelevant to the instant application, as the instant application discloses a fermion-to-qubit mapping method. Claims in the instant application are directed to the mathematical concepts implemented in generic computer components and generally linked to a particular technological environment. See 35 U.S.C. 101 rejection below. 35 U.S.C. 102: Applicant’s arguments regarding the 35 U.S.C. 102 rejection have been fully considered, and are found persuasive. Therefore, 35 U.S.C. 102 rejection has been withdrawn. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-6, 8-13, 15, 17, 19-22, 26, and 28 rejected under 35 U.S.C. 101 because they are directed to an abstract idea without significantly more. Regarding Claim 1, at Step 1 the claim is directed a method, which is a statutory category of invention. At Step 2A, Prong 1, Examiner notes that claims are directed to mathematical concepts: A computer-implemented method of generating an encoding for mapping fermionic operators onto qubits (mathematical relationships) of a quantum information processor, wherein the method comprises using a processor to: receive a set of fermionic operators, Fi, to be represented on the quantum information processor; identify a set including every Pauli operator, P, (mathematical relationships) implementable on the quantum information processor; assign a first fermionic operator, F1, to a first Pauli operator, P1 (mathematical relationships); assign a Pauli operator to each subsequent fermionic operator, Fs (mathematical relationships), by: (a) identifying one or more commutation relations and/or anticommutation relations between Fs and the set of all fermionic operators {F1...F(s-1) } which have already been assigned to Pauli operators in the set {P1...P(s-1)} (mathematical relationships); (b) identifying for the fermionic operator Fs a set of candidate Pauli operators to which Fs may be assigned, wherein a candidate Pauli operator is one which has the same commutation and anticommutation relations with each Pauli operator Pj as the commutation and anticommutation relations between Fs the corresponding Fj, for all j in the range 1 < j < (s-1) (mathematical relationships); and (c) selecting a Pauli operator, Ps, from the set of candidate Pauli operators and assigning Fs to Ps (mathematical relationships); repeat steps (a) to (c) using further subsequent fermionic modes until each fermionic operator has been assigned to a Pauli operator, thereby to provide a complete mapping in which each fermionic operator, Fi, is assigned to a corresponding Pauli operator Pi (mathematical relationships); wherein a cost model is applied to the assignment(s) and/or the complete mapping between fermionic operators and Pauli operators to enable selection of a relatively lower cost mapping (mathematical calculations); and encode the selected relatively lower cost complete mapping (mathematical relationships) onto the quantum information processor. At Step 2A Prong 2, the additional elements are bolded and italicized above. These additional elements are merely an “apply it” scenario using generically recited computer components. See MPEP 2106.05 (f). The bolded limitation “using a processor to” simply uses a generic processor to perform the mathematical relationships (generating an encoding) to transform the data used for mathematical calculations from one format to another. Additionally, the italicized limitation “receive a set of fermionic operators” above are describing insignificant extra-solution activity used for the processing of the mathematical concepts. The italicized limitations disclosing “the quantum information processor” are merely additional elements that are generally linking the use of the judicial exception to a particular technological environment. Examples of limitations that the courts have described as merely indicating a field of use or technological environments in which to apply a judicial exception include, as discussed in MPEP 2106.05(h): iv. Specifying that the abstract idea of monitoring audit log data relates to transactions or activities that are executed in a computer environment, because this requirement merely limits the claims to the computer field, i.e., to execution on a generic computer, FairWarning v. Iatric Sys., 839 F.3d 1089, 1094-95, 120 USPQ2d 1293, 1295 (Fed. Cir. 2016); and vi. Limiting the abstract idea of collecting information, analyzing it, and displaying certain results of the collection and analysis to data related to the electric power grid, because limiting application of the abstract idea to power-grid monitoring is simply an attempt to limit the use of the abstract idea to a particular technological environment, Electric Power Group, LLC v. Alstom S.A., 830 F.3d 1350, 1354, 119 USPQ2d 1739, 1742 (Fed. Cir. 2016); At Step 2B, there are no additional elements claimed that amount to significantly more than the recited judicial exception. In regards to the insignificant extra-solution activity found in the italicized limitations, the “receive a set of fermionic operators” limitations describe mere data transmitting recited at a high level of generality. Per MPEP 2106.05(d)(II), the courts have recognized the following computer functions as well-understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity: i. Receiving or transmitting data over a network, e.g., using the Internet to gather data, Symantec, 838 F.3d at 1321, 120 USPQ2d at 1362. This limitation is therefore considered well understood routine and conventional even upon consideration. Thus, these limitations do not amount to significantly more. Claim 2 further discloses the mathematical concept of the cost model (mathematical calculations) applied on the generic circuitry (quantum information processor). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 3 further discloses the mathematical concept of the cost model (mathematical calculations) applied on the generic circuitry (quantum information processor). Under Steps 2A prong 2 and 2B, the claim simply generally describes the generic circuitry (physical arrangements of qubits forming part of the quantum information processor). Claim 4 further discloses the mathematical concept of the cost model to implement a unitary rotation generated by a Pauli operator (mathematical calculations). Under Steps 2A prong 2 and 2B, the claim simply describes these mathematical calculations performed based on a number of hardware-native operations. These hardware-native operations are general operations caused by applying the mathematical concepts on generic circuitry. See MPEP 2106.05 (f). Claim 5 further discloses the mathematical concept of the cost model further described (mathematical calculations). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 6 further discloses the mathematical concept of the mapping of fermionic operators (mathematical relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 8 further discloses the mathematical concept of the mapping of fermionic operators (mathematical relationships). Moreover, none of the additional elements regarding the generic computer components (i.e., hardware layout) are more than high level generic computer components that amount to mere instructions to apply the abstract idea on a generic computer. See MPEP 2106.05(f). Claim 9 further discloses the mathematical concept of the cost model (mathematical calculations). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 10 further discloses the mathematical concept of the mapping of fermionic operators (mathematical relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 11 further discloses the mathematical concept of the method for lower cost mapping of fermionic operators (mathematical calculations/relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 12 further discloses the mathematical concept of the aggregate cost mapping of fermionic operators (mathematical calculations/relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 13 further discloses the mathematical concept of the aggregate cost mapping of fermionic operators (mathematical calculations/relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 15 further discloses the mathematical concept of the cost model (mathematical calculations). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 17 further discloses the mathematical concept of the cost model (mathematical calculations). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 19 further discloses the mathematical concept of the mapping of fermionic operators to Pauli operators (mathematical relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 20 further discloses the mathematical concept of the mapping of fermionic operators to Pauli operators based on the cost (mathematical calculations/relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 21 further discloses the mathematical concept of the mapping of fermionic operators to Pauli operators based on the cost (mathematical calculations/relationships). Under Steps 2A prong 2 and 2B, the claim does not recite any additional elements that integrate the abstract idea into a practical application nor do they amount to significantly more than the judicial exception. Claim 26 further discloses the mathematical concept of the mapping of the fermionic operators (mathematical relationships). Under Steps 2A prong 2 and 2B, as stated in the claim 1 analysis, is simply is using the quantum information processor to enact the encoding. This is equivalent to the “apply it” scenario using generically recited computer components. Moreover, none of the additional elements regarding generic computer components (i.e., control apparatus, processor) are more than high level generic computer components that amount to mere instructions to apply the abstract idea on a generic computer See MPEP 2106.05 (f). Claim 28 further discloses the mathematical concept of the mapping of the fermionic operators (mathematical relationships). Moreover, none of the additional elements regarding generic computer components (i.e., non-transient computer readable medium, a computer) are more than high level generic computer components that amount to mere instructions to apply the abstract idea on a generic computer See MPEP 2106.05 (f). Allowable Subject Matter Claims 1-6, 8-13, 15, 17, 19-21, 26, and 28 would be allowable if rewritten to overcome the 35 U.S.C 101 rejections discussed above. Prior Art Made of Record US 12770046 B2 – teaches a method of fermion sign rectification using bi-fermions, which encodes the solution of a general BQP problem into the ground state of a many-bi-fermion system. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to CARLOS H DE LA GARZA whose telephone number is (571)272-0474. The examiner can normally be reached Monday-Friday 9:30AM-6PM. 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, Andrew Caldwell can be reached at (571) 272-3702. 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. /C.H.D./ Carlos H. De La GarzaExaminer, Art Unit 2182 (571)272-0474 /EMILY E LAROCQUE/Primary Examiner, Art Unit 2182
Read full office action

Prosecution Timeline

Sep 22, 2022
Application Filed
Apr 07, 2026
Non-Final Rejection mailed — §101
Sep 04, 2026
Response Filed
Oct 27, 2026
Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12783211
CHIP, TERMINAL, FLOATING-POINT OPERATION CONTROL METHOD, AND RELATED APPARATUS
4y 2m to grant Granted Nov 03, 2026
Patent 12737154
COMPUTING DEVICE AND METHOD USING MULTIPLIER-ACCUMULATOR
4y 4m to grant Granted Sep 15, 2026
Patent 12717863
CALCULATION DEVICE
4y 6m to grant Granted Aug 25, 2026
Patent 12688041
Vectorized Operations for Sparse Kernels
4y 2m to grant Granted Jul 21, 2026
Patent 12681695
WEIGHT STATIONARY IN-MEMORY-COMPUTING NEURAL NETWORK ACCELERATOR WITH LOCALIZED DATA MULTIPLEXING
4y 0m to grant Granted Jul 14, 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

3-4
Expected OA Rounds
71%
Grant Probability
99%
With Interview (+38.1%)
Moderate
PTA Risk
Based on 21 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