Prosecution Insights
Last updated: November 04, 2026
Application No. 18/099,400

Parallel Simulation of Large-Scale Dynamical Systems Using Tensor Network

Non-Final OA §101
Filed
Jan 20, 2023
Priority
Jan 20, 2022 — provisional 63/301,406
Examiner
DUONG, HUY
Art Unit
2182
Tech Center
2100 — Computer Architecture & Software
Assignee
Efsolutions Gbr
OA Round
1 (Non-Final)
70%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
98%
With Interview

Examiner Intelligence

Grants 70% — above average
70%
Career Allowance Rate
122 granted / 175 resolved
+14.7% vs TC avg
Strong +28% interview lift
Without
With
+28.5%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
17 currently pending
Career history
201
Total Applications
across all art units

Statute-Specific Performance

§101
33.4%
-6.6% vs TC avg
§103
25.2%
-14.8% vs TC avg
§102
12.7%
-27.3% vs TC avg
§112
26.6%
-13.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 175 resolved cases

Office Action

§101
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 . Drawings The drawings are objected to because the figures are illustrated in grey scale, rather than using black ink that secures solid black lines as required in CFR 1.84(a)(1). For example, some texts and equations in figure 1 are not readable. Corrected drawing sheets in compliance with 37 CFR 1.121(d) are required in reply to the Office action to avoid abandonment of the application. Any amended replacement drawing sheet should include all of the figures appearing on the immediate prior version of the sheet, even if only one figure is being amended. The figure or figure number of an amended drawing should not be labeled as “amended.” If a drawing figure is to be canceled, the appropriate figure must be removed from the replacement sheet, and where necessary, the remaining figures must be renumbered and appropriate changes made to the brief description of the several views of the drawings for consistency. Additional replacement sheets may be necessary to show the renumbering of the remaining figures. Each drawing sheet submitted after the filing date of an application must be labeled in the top margin as either “Replacement Sheet” or “New Sheet” pursuant to 37 CFR 1.121(d). If the changes are not accepted by the examiner, the applicant will be notified and informed of any required corrective action in the next Office action. The objection to the drawings will not be held in abeyance. Claim Objections Claims 1-7, 11, and 18-19 are objected to because of the following informalities: Claim 1 line 3; claim 5 line 2 “the instructions” should be “the computer-readable instructions” as antecedently recited. Claim 4 line 1; claim 11 line 1; claim 18 line 1-2 “the tensor network method” should be “the at least one tensor network method” as antecedently recited. Claim 5 recites “The system of claim 1, further comprising at least one graphical processing unit (GPU) to execute the instructions” should be “The system of claim 1, wherein the at least one processor comprising at least one graphical processing unit (GPU) to execute the computer-readable instructions” as similar to claims 12 and 19 because as originally file claim 5 requires the processor and the GPU to execute the same instructions, rather than the processor comprising the GPU to execute the instructions. ([001138] describes the GPU performed the steps as claimed). Claim 19 line 1-2 “the at least one computing device” should be “the computing device” as antecedently recited Dependent claims are also objected for inheriting the same deficiencies in which claims they depend on. Appropriate correction is required. 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-21 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Claim 1 recites a system claim. Under Prong One of Step 2A of the USPTO current eligibility guidance (MPEP 2106), the claim recites limitations cover mathematical calculations, relationship, and/or formula, such as perform at least one tensor network method to numerically solve at least one differential equation; build a mathematical representation of one of a physical, economic, and engineering problem using the at least one differential equation ([001131] describes the tensor network method can be a TEBD method and [00117] describes the TEBD as mathematical algorithm, thus such limitation cover performing mathematical algorithm to solve for a differential equation, and build a mathematical problem based on the calculated different equation); determine a graph that defines connections between states of the problem and determine an adjacency matrix (see at least [00125-00201] describes the adjacency matrix determined based on elements gij to show the graph of connection between states of the problems); subdivide a matrix into n sets of matrices whose elements commute with each other while at least one element of a set does not commute with at least one element of another set (see at least [00117] describes the step of subdividing matrix A into n set of matrices); implement a Suzuki Trotter decomposition using singular value decomposition on the n sets of matrices with a given time interval δ and a predefined p expansion order (see at least [00216 - 00221] describes implementing a Suzuki Trotter decomposition, which is a mathematical algorithm); evaluate the problem at a time T = N δ by iteratively performing the Suzuki Trotter decomposition N times (see at least figure 12 [00394-00404] describes the mathematical algorithm to evaluate the problem at time T by iteratively performing Suzuki Trotter decomposition); and generate simulation results for the problem within an error of order of N o ( δ p + 1 ) (see at least [00395], [00407] describes generating results of mathematical algorithm within an error ) Therefore, the claim includes limitations that fall within the “Mathematical Concepts” grouping of abstract ideas. Accordingly, the claim recites an abstract idea. Under Prong Two of Step 2A, this judicial exception is not integrated into a practical application. The claim additionally recites a system comprising: a memory storing computer-readable instructions; and at least one processor to execute the instructions. However, the additional elements are recited at a high level of generality, i.e., as a generic system performing generic computer functions of storing and executing instructions. Such additional elements fail to provide a meaningful limitation on the judicial exception, and amount to no more than mere instructions to apply the exception using generic computer elements. Furthermore, the claim recites to reduce data transfer among cores of the at least one processor, such limitation is at most considered as a result of performing the abstract idea (e.g., implementing a Suzuki Trotter decomposition). Thus, the claim is directed to an abstract idea. Under Step 2B, the claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed previously with respect to the step 2A prong two, the additional elements in the claim amount to no more mere instructions to apply the exception. Thus, the claim does not provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception, and fails to ensure the claim as a whole amount to significantly more than the judicial exception itself. Accordingly, the claim is not patent-eligible under 35 U.S.C 101. Claim 2 further recites wherein the at least one differential equation comprises one of a linear differential equation and a non-linear differential equation. Such limitations cover mathematical calculations, relationship, and/or formula (merely describes the different type of differential equation). The claim does not recite additional element alone or in combinations that would integrate the judicial exception into a practical application under step 2A prong two or provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception under step 2B. Accordingly, the claim is not patent-eligible under 35 U.S.C. 101. Claim 3 further recites 3 wherein the at least one differential equation comprises one of a linear time variant differential equation and a non-linear time variant differential equation. Such limitations cover mathematical calculations, relationship, and/or formula (merely describes the different type of differential equation). The claim does not recite additional element alone or in combinations that would integrate the judicial exception into a practical application under step 2A prong two or provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception under step 2B. Accordingly, the claim is not patent-eligible under 35 U.S.C. 101. Claim 4 further recites wherein the tensor network method comprises a time-evolving block decimation (TEBD) method. Such limitations cover mathematical calculations, relationship, and/or formula (merely describes tensor network as a TEBD algorithm, which is a mathematical algorithm). The claim does not recite additional element alone or in combinations that would integrate the judicial exception into a practical application under step 2A prong two or provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception under step 2B. Accordingly, the claim is not patent-eligible under 35 U.S.C. 101. Claim 5 further recites at least one graphical processing unit (GPU) to execute the instructions. However, the additional element is recited at a high level of generality, i.e., as a computer component performing computer function of executing instructions. Such additional elements fail to provide a meaningful limitation on the judicial exception, and amount to no more than mere instructions to apply the exception using computer element, and does not provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception, and fails to ensure the claim as a whole amount to significantly more than the judicial exception itself. Accordingly, the claim is not patent-eligible under 35 U.S.C 101. Claim 6 further recites wherein the at least one processor numerically solves the at least one differential equation sequentially. Such additional element is recited at a high level of generality, e.g., computer component performing computer function, such additional element fails to provide a meaningful limitation on the judicial exception, and amounts to no more than mere instructions to apply the exception using computer element, and or fails to provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception, and fails to ensure the claim as a whole amount to significantly more than the judicial exception itself. Accordingly, the claim is not patent-eligible under 35 U.S.C 101. Claim 7 further recites wherein the at least one processor numerically solves the at least one differential equation in parallel. Such concept of operating at least one processor in parallel is at most considered as insignificant extra solution activity under step 2A prong two as parallelism is a well-known concept in computer and is determined to be well-understood, routine and conventional under step 2B (see at least Hennessy, John L., et al. Computer Architecture : A Quantitative Approach, Elsevier Science & Technology, 2014. ProQuest Ebook Central, page 532 figure 6.2 describes a mutltiprocessor architecture that perform operations in parallel. Thus, such additional element alone or in combinations fails to integrate the judicial exception into a practical application under step 2A prong two or provide an inventive concept that is furnished by an element or combination of elements that is recited in the claim in addition to (beyond) the judicial exception under step 2B. Accordingly, the claim is not patent-eligible under 35 U.S.C. 101. Claims 8-14 recite method claims that would be practiced by the apparatus claims 1-7. Thus, they are rejected for the same reasons. Claims 15-21 recite product claims having similar limitations as the method claims 8-14. Thus, they are rejected for the same reasons. Allowable Subject Matter Claims 1-21 would be allowable if rewritten or amended to overcome the claim objection and rejection under 35 U.S.C. 101, set forth in this Office action. The following is a statement of reasons for the indication of allowable subject matter: Regarding claims 1, 8, and 15, the prior art of records does not teach or suggest a combination of limitations, such as perform at least one tensor network method to numerically solve at least one differential equation; build a mathematical representation of one of a physical, economic, and engineering problem using the at least one differential equation; determine a graph that defines connections between states of the problem and determine an adjacency matrix; subdivide a matrix into n sets of matrices whose elements commute with each other while at least one element of a set does not commute with at least one element of another set: implement a Suzuki Trotter decomposition using singular value decomposition to reduce data transfer among cores of the at least one processor on the n sets of matrices with a given time interval δ and a predefined p expansion order; evaluate the problem at a time T = N δ by iteratively performing the Suzuki Trotter decomposition N times: and generate simulation results for the problem within an error of order of N o ( δ p + 1 ) . Witte - US 20240394330 teaches a method for solving partial differential equation via numerical simulations relating to natural or physical system, the steps includes obtaining input data relating to a physical system and partitioning tensors of a neural network across multiple parallel processors, distributing the input data across multiple parallel cloud processing resources for numerical simulations involving partial differential equations to produce corresponding output data. Furthermore, the method also includes training the neural network across the tensors of the multiple parallel processors with the input data and the output data to produce a surrogate model of the partial differential equations and receiving subsequent input data and generate corresponding subsequent output data utilizing the surrogate model. However, Witte does not teach or suggest the combination of limitations as required in the independent claims. Orus - US 20250036719 teaches a method for solving a combinatorial optimization of a cost function based on executing a time evolving block decimation (TEBD) algorithm. The method includes mapping the cost function to a Hamiltonian (H(x.sub.1, x.sub.2, . . . x.sub.n)), choosing an initial state of a vector space (V) representative of the cost function, applying a time-evolution operator (O) to the state to produce an updated state, iteratively applying the time-evolution operator to the updated state to produce a further updated state until a ground state is reached, and determining the cost function from the ground state of the Hamiltonian. The method further teaches the use of Suzuki-Trotter decomposition to decompose matrix exponential into a product of simpler operator [0056]. However, Orus does not teach or suggest the combination of limitations as required in the independent claims. Baker - US 20230040584 teaches a method for solving a Hamiltonian based on tensor network, the method includes forming an equation based on a tensor network having a plurality of contracted tensors and at least one non-contracted tensor j, evaluating a recursive relation of an equation including using the equation at least two time, forming a block tridiagonal matrix having a block size greater than one, based on the recursive relation, and diagonalizing the block tridiagonal matrix to obtain new tensors and energy levels of the tensor network, wherein at least one of the uncontracted tensors of the network has an index for the group of excitations; and solving for the rest of the tensor network, yielding an energy level solution of the Hamiltonian, outputting the energy level solution. However, Baker does not teach or suggest the combination of limitations as required in the independent claims. Dhand - NPL Stability of the Trotter-Suzuki decomposition - describes the concept of recursive Trotter-Suzuki decomposition formula for used in Hamiltonian simulation to minimize the computational cost of approximating ordered operator exponentials using product formula. However, Dhand does not teach or suggest the combination of limitations as required in the independent claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to HUY DUONG whose telephone number is (571)-272-2764. The examiner can normally be reached Mon-Friday 9:00AM - 5:30PM ET. 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. /HUY DUONG/Examiner, Art Unit 2182 (571)-272-2764
Read full office action

Prosecution Timeline

Jan 20, 2023
Application Filed
Oct 30, 2026
Non-Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12784429
CONVOLUTION OPERATION METHOD AND CONVOLUTION OPERATION DEVICE
5y 9m to grant Granted Nov 03, 2026
Patent 12754716
Tiled Switch Matrix Data Permutation Circuit
4y 5m to grant Granted Oct 06, 2026
Patent 12754714
CONVOLUTION HARDWARE ACCELERATOR
4y 2m to grant Granted Oct 06, 2026
Patent 12724845
DYNAMICALLY RECONFIGURABLE OVERSAMPLED CHANNELIZER
4y 2m to grant Granted Sep 01, 2026
Patent 12717867
METHOD AND APPARATUS WITH NETWORK INTEROPERABILITY PROCESSING
6y 2m to grant Granted Aug 25, 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
70%
Grant Probability
98%
With Interview (+28.5%)
3y 4m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 175 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