Prosecution Insights
Last updated: April 19, 2026
Application No. 18/221,261

QUANTUM DATABASE INSERT OPERATIONS SYSTEM

Non-Final OA §101§102§112
Filed
Jul 12, 2023
Examiner
HOFFMAN, BRANDON S
Art Unit
2433
Tech Center
2400 — Computer Networks
Assignee
Abu Dhabi University
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
2y 9m
To Grant
97%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allow Rate
1125 granted / 1238 resolved
+32.9% vs TC avg
Moderate +6% lift
Without
With
+6.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
31 currently pending
Career history
1269
Total Applications
across all art units

Statute-Specific Performance

§101
7.7%
-32.3% vs TC avg
§103
34.7%
-5.3% vs TC avg
§102
33.8%
-6.2% vs TC avg
§112
5.2%
-34.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1238 resolved cases

Office Action

§101 §102 §112
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 . DETAILED ACTION Claims 1-20 are pending in this office action. Claim Objections Claims 1 and 6 are objected to because of the following informalities: the claims cite “toffli” gates instead of “toffoli” gates. Appropriate correction is required. Claim Rejections - 35 USC § 112 The following is a quotation of the first paragraph of 35 U.S.C. 112(a): (a) IN GENERAL.—The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor or joint inventor of carrying out the invention. The following is a quotation of the first paragraph of pre-AIA 35 U.S.C. 112: The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor of carrying out his invention. Claim 6 is rejected under 35 U.S.C. 112(a) or 35 U.S.C. 112 (pre-AIA ), first paragraph, as failing to comply with the enablement requirement. The claim(s) contains subject matter which was not described in the specification in such a way as to enable one skilled in the art to which it pertains, or with which it is most nearly connected, to make and/or use the invention. The claim recites applying an "n+1-qubit Toffoli gate". As n increases, the physical implementation of a multi-control Toffoli gate becomes exponentially difficult and is not currently a "routine" operation in available quantum hardware. The specification does not provide sufficient instruction on how to physically construct or decompose this gate for large n, meaning the claim is not enabled across its full scope. 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 and 6 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 applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 1 is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being incomplete for omitting essential elements, such omission amounting to a gap between the elements. See MPEP § 2172.01. The omitted elements are: The claims include the conditional if alpha_k=M−Sigma_{i=1,k-1}alpha_i=1". The variable "M" is not defined within the claim, leaving the scope of the conditional operation unclear. Claim 6 is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being incomplete for omitting essential elements, such omission amounting to a gap between the elements. See MPEP § 2172.01. The omitted elements are: executing an "IO Operator". This is a coined term not recognized in standard quantum computing literature. While the specification defines it as a specific matrix, the claim itself lacks the structural definition of the operator. A person of ordinary skill in the art (PHOSITA) would not know the specific unitary transformation required simply by the name "IO Operator." 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-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. The claim(s) recite(s) initializaing registers, determining a value, applying unitary transformations (Toffoli gates, S-Operators, IO operators). This judicial exception is not integrated into a practical application because courts have found mathematical formulas and algorithms for data manipulation are abstract ideas. The “insert operation” described is a fundamental functional concept of database management. The claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception because the use of a "quantum circuit" or "quantum method" merely provides a generic environment for executing the algorithm. While the specification argues that this allows for a "greater amount of data" not achievable by classical computers, the claims themselves do not describe a specific improvement to the physical hardware. Instead, they recite a sequence of well-known quantum logic gates (Toffoli, CNOT, X gates) to perform the calculation. This is considered "well-understood, routine, and conventional activity" within the field of quantum computing. Claim Rejections - 35 USC § 102 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)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1-5 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by El Euch et al. (U.S. Patent No. 11,093,850). Regarding claim 1, Replace1 teaches a quantum method, comprising: initializing, by the quantum circuit, three registers in a quantum circuit (col. 3, lines 45-52); determining, by the quantum circuit, a value of α.sub.k (col. 3, lines 14-20); if α.sub.k=M−Σ.sub.i=1,k-1α.sub.i=1, then the quantum method further comprises: applying a set of size n of 3-qubit Toffoli gate (col. 3, lines 21-25). Regarding claim 2, Replace1 teaches wherein the registers include |QDB, |S, and |D (fig. 2). Regarding claim 3, Replace1 teaches wherein the register |D is an input register with a particular number of qubits (col. 3, lines 14-17). Regarding claim 4, Replace1 teaches wherein the register |QDB represents a register of n qubits initialized with the vacuum state |000 . . . 0 (col. 3, lines 60-67). Regarding claim 5, Replace1 teaches wherein the register |S represents a two qubit quantum control register initialized with state |01 (col. 2, lines 11-20). Any inquiry concerning this communication or earlier communications from the examiner should be directed to BRANDON HOFFMAN whose telephone number is (571)272-3863. The examiner can normally be reached Monday-Friday 8:30AM-5:00PM. 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, Jeffrey Pwu can be reached at (571)272-6798. 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. /BRANDON HOFFMAN/Primary Examiner, Art Unit 2433
Read full office action

Prosecution Timeline

Jul 12, 2023
Application Filed
Feb 06, 2026
Non-Final Rejection — §101, §102, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12598185
DESCENDENT CASE ROLE ALIAS
2y 5m to grant Granted Apr 07, 2026
Patent 12597311
Access Control System for Electric Vehicle Charging
2y 5m to grant Granted Apr 07, 2026
Patent 12579293
SYSTEMS AND METHODS FOR API GATEWAY SYNCHRONIZATION WITH CLOUD STORAGE
2y 5m to grant Granted Mar 17, 2026
Patent 12579295
SYSTEMS AND METHODS FOR ELECTRONIC DEVICE ACCESS
2y 5m to grant Granted Mar 17, 2026
Patent 12566878
DATA SANITIZER
2y 5m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
91%
Grant Probability
97%
With Interview (+6.3%)
2y 9m
Median Time to Grant
Low
PTA Risk
Based on 1238 resolved cases by this examiner. Grant probability derived from career allow 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