Prosecution Insights
Last updated: October 25, 2026
Application No. 18/020,510

ADVANCED QUANTUM PROCESSING SYSTEMS AND METHODS

Non-Final OA §102§112
Filed
Feb 09, 2023
Priority
Aug 10, 2020 — AU 2020902815 +1 more
Examiner
NGUYEN, NHA T
Art Unit
2851
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Diraq Pty Ltd.
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
935 granted / 1072 resolved
+19.2% vs TC avg
Strong +18% interview lift
Without
With
+18.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 5m
Avg Prosecution
18 currently pending
Career history
1096
Total Applications
across all art units

Statute-Specific Performance

§101
14.8%
-25.2% vs TC avg
§103
28.9%
-11.1% vs TC avg
§102
33.7%
-6.3% vs TC avg
§112
14.7%
-25.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1072 resolved cases

Office Action

§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 1. This Office Action responds to the Election of Restriction Requirement filed on 7/20/2026 and IDS filed on 2/9/2023, 8/14/2024, and 7/14/2025. Claims 1-7, 9-19, 21, and 22 are pending. Election/Restrictions Applicant’s election without traverse of Group I (Claims 1-7, 9-11, and 22) in the reply filed on 7/20/2026 is acknowledged. Claims 12-19 and 21 withdrawn from further consideration pursuant to 37 CFR 1.142(b) as being drawn to a nonelected Group II, there being no allowable generic or linking claim. Election was made without traverse in the reply filed on 7/20/2026. Claim Rejections - 35 USC § 112 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-7, 9-11, and 22 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 recited “applying an optimal bias configuration between the first processing element and the second processing element to shuttle the qubit from the first processing element to the second processing element in a manner that minimizes the time spent by the qubit in one or more state transition points between the first processing element and the second processing element”, however it is not apparent how one would determine an optimal bias configuration in a manner that would minimizes the time spent by the qubit in one or more state transition points between the first processing element and the second processing element. Claim 22 recited “each of the processing elements has a dwelling bias point at which coherence times of the qubit is highest…applying an optimal bias configuration between the first processing element and the second processing element such that the qubit dwells in each of the one or more transport elements at the dwelling bias point”, however it is not apparent how one would determine an optimal bias configuration that would allow the qubit to dwells in each of the one or more transport elements at the dwelling bias point. It is not apparent of the basis for determining that a dwelling bias point would result in coherence times of the qubit is highest. There is also lack of antecedent basis for the one or more transport elements. It is also not apparent of the relationship between transport elements and the processing element. As per claims 2-7 and 9-11 are rejected to for incorporating the above limitations into the claims by dependency. 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. Claim(s) 1, 6, 7, and 9-11 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Bounacorsi (“Simulated coherent electron shuttling in silicon quantum dots”, by Brandon Buonacorsi, Benjamin Shaw, and Jonathan Baugh, Xiv:2003.08018v1 [quant-ph] 18 Mar 2020). As per claim 1, Bounacorsi discloses: A method for shuttling a qubit from a first processing element to a second processing element in a quantum processing device, the quantum processing device comprising a plurality of processing elements (See Abstract, i.e. Shuttling of single electrons in gate-defined silicon quantum dots), the method comprising: applying an optimal bias configuration between the first processing element and the second processing element to shuttle the qubit from the first processing element to the second processing element (See Section I. Introduction, i.e. optimize both the device geometry and the voltage sequences for shuttling… shuttling of a single charge across a linear array of nine dots in 50 ns, See Section II, i.e. choose voltage configurations…pass through during the shuttling… configurations for shuttling through n dots, See Pages 8&9, i.e. device geometry optimization) in a manner that minimizes the time spent by the qubit in one or more state transition points between the first processing element and the second processing element (See Section I. Introduction, i.e. optimize both the device geometry and the voltage sequences for shuttling… shuttling of a single charge across a linear array of nine dots in 50 ns, See Section II, i.e. choose voltage configurations…pass through during the shuttling… configurations for shuttling through n dots, See Section III, i.e. tunnel coupling tc between two neighboring QDs determines the pulse length…a threshold time of 325 ps for dot-to-dot shuttling with a final orbital state fidelity > 99% - a factor of 5 improvement in speed over linear pulses, See Pages 8&9, i.e. device geometry optimization –[prior art optimize shuttling speed across dots (processing elements) , because the shuttle speed is increase overall, the time spent in the transition points would also be reduce therefore considered as the minimize as cited above]). As per claim 6, Bounacorsi discloses all of the features of claim 1 as discloses above wherein Bounacorsi also discloses where the quantum processing device is a silicon based system (See Page 1-2, i.e. Shuttling of single electrons in gate-defined silicon quantum dots). As per claim 7, Bounacorsi discloses all of the features of claim 6 as discloses above wherein Bounacorsi also discloses wherein the quantum processing device is a silicon MOS system and the plurality of processing elements are quantum dots with electron or hole encoding the qubit (See Page 1-2, i.e. Shuttling of single electrons in gate-defined silicon quantum dots, See Page 2&3, i.e. MOS geometry…MOS qubit). As per claim 9, Bounacorsi discloses all of the features of claim 1 as discloses above wherein Bounacorsi also discloses correcting a phase error or rotation in the qubit by performing dynamical decoupling while the qubit is shuttled to the second processing element and/or once the qubit is shuttled to the second processing element (See Page 14, i.e. dominant error is a phase rotation, See Page 16, i.e. corrective phase rotations). As per claim 10, Bounacorsi discloses all of the features of claim 1 as discloses above wherein Bounacorsi also discloses wherein the plurality of processing elements form a N X M matrix, where N and M are integer values (See Page 3, i.e. Consider a linear chain of n QDs –[chain of quantum dots would result in 1xn matrix]). As per claim 11, Bounacorsi discloses all of the features of claim 1 as discloses above wherein Bounacorsi also discloses wherein the quantum processing device further comprising one or more exchange coupling gates arranged between pairs of processing or transport elements, the exchange coupling gate configurable to control the time taken by the qubit to transition from one element to another (See Section I. Introduction, i.e. optimize both the device geometry and the voltage sequences for shuttling… shuttling of a single charge across a linear array of nine dots in 50 ns, See Section II, i.e. choose voltage configurations…pass through during the shuttling… configurations for shuttling through n dots, See Pages 8&9, i.e. device geometry optimization). Allowable Subject Matter Claim 22 would be allowable if rewritten or amended to overcome the rejection(s) under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), 2nd paragraph, set forth in this Office action. Claims 2-5 would be allowable if rewritten to overcome the rejection(s) under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), 2nd paragraph, set forth in this Office action and to include all of the limitations of the base claim and any intervening claims. The following is a statement of reasons for the indication of allowable subject matter: With respect to independent claim 22, the prior art does not teach the method for shuttling a qubit from a first processing element to a second processing element in a quantum processing device having combination of features as recited in independent claim 22. With respect to claims 2-5, the prior art does not teach the limitation of claim 2 and/or 4 – wherein claims 3 and 5 depend from claim 2. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to NHA T NGUYEN whose telephone number is (571)270-1405. The examiner can normally be reached M-F 8:00AM-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, Jack Chiang can be reached at 571-272-7483. 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. /NHA T NGUYEN/ Primary Examiner, Art Unit 2851
Read full office action

Prosecution Timeline

Feb 09, 2023
Application Filed
Sep 30, 2026
Non-Final Rejection mailed — §102, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12759425
Method For Matching a Vehicle and a Charging Pile, Method for Determining a Charging Device Being Engaged with a Vehicle, and Corresponding Apparatus
4y 7m to grant Granted Oct 13, 2026
Patent 12762322
TEMPORAL CONTROL OF FAULT FUNCTIONAL VERIFICATION
3y 1m to grant Granted Oct 13, 2026
Patent 12756186
JUMP STARTER
3y 7m to grant Granted Oct 06, 2026
Patent 12754474
CONCURRENT MASK OPTIMIZATION FOR MULTIPLE LAYERS
2y 1m to grant Granted Oct 06, 2026
Patent 12743570
GENERATIVE SELF-SUPERVISED LEARNING TO TRANSFORM CIRCUIT NETLISTS
4y 3m 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
87%
Grant Probability
99%
With Interview (+18.2%)
2y 5m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1072 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