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 .
Response to Arguments
The objection to the Drawings is withdrawn in view of the amendment filed on 8/25/2026.
The objections to the specification are withdrawn in view of the amendment filed on 8/25/2026.
Applicant’s arguments in view of the claim amendments filed on 8/25/2026, with respect to the 35 U.S.C. §112(a) written description and enablement rejections have been fully considered and are persuasive. The 35 U.S.C. §112(a) rejections have been withdrawn.
Applicant’s arguments in view of the claim amendments filed on 8/25/2026, with respect to the 35 U.S.C. §112(b) rejections have been fully considered and are persuasive except for claim 3’s indefinite article in the sixteenth step, which as not address. The 35 U.S.C. §112(b) rejections have been withdrawn except for claim 3. Furthermore, a new 35 U.S.C. §112(b) rejection has been made for the newly amended claim 1.
Applicant’s arguments in view of the claim amendments filed on 8/25/2026, with respect to the prior art rejection have been fully considered and are persuasive. The 35 U.S.C. §103 rejections have been withdrawn.
Claim Rejections - 35 USC § 112(b) or 35 USC § 112, second paragraph
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 3 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 recites in the seventh step: "applying…Rz(-π/32) gate to the q2 qubit" omitting the required indefinite article "an" before " Rz(-π/32) gate". The gate is introduced for the first time in this step without proper article introduction.
Claim 1 recites in the tenth step: "applying…Rz(-π/16) gate to the q2 qubit" omitting the required indefinite article "an" before " Rz(-π/16) gate". The gate is introduced for the first time in this step without proper article introduction.
Claim 3 recites in the sixteenth step: "…applying Rz(7π/16) gate" omitting the required indefinite article "an" before " Rz(7π/16) gate". The gate is introduced for the first time in this step without proper article introduction.
Claim 3 now recites its own first through sixteenth step sequence, even though claim 3 is dependent on claim 1. Claim 1 already recites first through twelfth steps. A person of ordinary skill cannot determine with reasonable certainty which antecedent state each step Claim 3 operates on.
Allowable Subject Matter
Claim 4 is allowed.
Claims 1 and 3 would be allowable if rewritten to overcome the rejection(s) under 35 U.S.C. 112 set forth in this Office action and to include all of the limitations of the base claim and any intervening claims. The following is an Examiner’s statement of reasons for allowance:
In addition to Applicant’s Remarks, closest prior art(s) found when taken individually or in combination do not expressly teach or render obvious the limitations recited in independent claims 1 and 4 when taken in the context of the claims as a whole. The most pertinent prior art(s) of record uncovered, specifically, Approximate Quantum Fourier Transform with O(n log(n)) T gates to Nam et al. discloses: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation, to name a few. The standard fault-tolerant implementation of an n-qubit unitary QFT approximates the desired transformation by removing small-angle controlled rotations and synthesizing the remaining ones into Clifford+T gates, incurring the T-count complexity of O(n log^2(n)). In this paper, we show how to obtain approximate QFT with the T-count of O(n log(n)). Our approach relies on quantum circuits with measurements and feedforward, and on reusing a special quantum state that induces the phase gradient transformation. We report asymptotic analysis as well as concrete circuits, demonstrating significant advantages in both theory and practice (Abstract); and Semiclassical Fourier Transform for Quantum Computation to Griffiths et al. discloses: Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a "classical" (macroscopic) signal resulting from the measurement of one bit (embodied in a two-state quantum system) is employed to determine the type of measurement carried out on the next bit, and so forth. In this way the two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals. Success in simplifying the Fourier transform suggests that it may be worthwhile looking for other ways of using semi-classical methods in quantum computing (Abstract).
Thus, claims 1 and 4 are allowed over the prior art(s) of record. Dependent claim 3 is allowable for at least the reasons discussed above in association with independent claim 1 from which it depends.
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 ALAN CHEN whose telephone number is (571)272-4143. The examiner can normally be reached M-F 10-7.
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, Kamran Afshar can be reached at (571) 272-7796. 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.
/ALAN CHEN/ Primary Examiner, Art Unit 2125
Prosecution Insights