Prosecution Insights
Last updated: November 20, 2026
Application No. 19/147,596

A QUANTUM TOKEN GENERATION AND VERIFICATION SYSTEM AND METHOD

Non-Final OA §112
Filed
Jul 11, 2025
Priority
Jan 12, 2023 — GB 2300498.9 +1 more
Examiner
HARRIS, CHRISTOPHER C
Art Unit
2432
Tech Center
2400 — Computer Networks
Assignee
Mastercard International Incorporated
OA Round
1 (Non-Final)
77%
Grant Probability
Favorable
1-2
OA Rounds
1y 6m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 77% — above average
77%
Career Allowance Rate
290 granted / 378 resolved
+18.7% vs TC avg
Strong +25% interview lift
Without
With
+25.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
17 currently pending
Career history
411
Total Applications
across all art units

Statute-Specific Performance

§101
15.4%
-24.6% vs TC avg
§103
41.1%
+1.1% vs TC avg
§102
9.6%
-30.4% vs TC avg
§112
27.0%
-13.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 378 resolved cases

Office Action

§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 . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. DETAILED ACTION Information Disclosure Statement The information disclosure statement (IDS) submitted on 07/11/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Priority Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. 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. Claim 14 is 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 pre-AIA the applicant regards as the invention. In regards to claim 14, it depends from claim 18 which requires a determination that unique identifier is real, and further recites determining that the unique identifier is not real. It is unclear as to whether the claim requires both determinations as part of the claimed method or is intended to recite the alternative “not real “verification path disclosed in the specification, which is described in paragraphs 0096-0098 and corresponding figure 5. Therefore, the scope of the claim is unclear. Allowable Subject Matter Claims 14 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 1-13 and 15-20 are allowed. Examiner’s Statement of Reasons for Allowance The following is an examiner’s statement of reasons for allowance: although the prior art of record (such as Okhuma et al. (20060129486)) An aspect of the present invention relates to a quantum cash system and a quantum cash apparatus which can inhibit even forgery in which quantum verification information is transformed using inverse transformation data, thus improving security. In order to allow quantum cash to be validly used, a quantum cash holding apparatus outputs one of the inverse transformation data and then inhibits the output of the other inverse transformation data in a verification list. This prevents the outflow of the other inverse transformation data, required for the forgery of the quantum cash. (Abstract) none of the prior art, alone or in combination, teaches Independent Claim 1: “…determining, using the classical computer, a secret-key quantum circuit comprising n qubits; generating, using the classical computer and the quantum computer, a classical description of the unique identifier using the secret-key quantum circuit; wherein the classical description comprises n portions; generating, using the classical computer and the quantum computer, an n-qubit quantum state based on the classical description of the unique identifier; and outputting, using the classical computer, a quantum token, the quantum token comprising: the unique identifier; and the n-qubit quantum state.”. Independent Claim 8: “…selecting, by the classical computer, a secret-key quantum circuit; generating, by the classical computer and the quantum computer, a classical description of the unique identifier using the secret-key quantum circuit; determining, by the classical computer, one or more computational bases based on the classical description of the unique identifier; generating, by the quantum computer, a real n-qubit quantum state based on the classical description of the unique identifier and the one or more computational bases; determining, by the quantum computer, a real measurement of the real n-qubit quantum state using the one or more computational bases; determining, by the quantum computer, a token measurement of the received n-qubit quantum state using the one or more computational bases; and verifying the token measurement using the real measurement such that the quantum token is verified.”. Independent Claim 15: “…determining, using the classical computer, a secret-key quantum circuit comprising n qubits; generating, using the classical computer and the quantum computer, a classical description of the unique identifier using the secret-key quantum circuit; wherein the classical description comprises n portions; generating, using the classical computer and the quantum computer, an n-qubit quantum state based on the classical description of the unique identifier; outputting, using the classical computer, a quantum token, the quantum token comprising: the unique identifier; and the n-qubit quantum state receiving, at the classical computer, the quantum token, the quantum token comprising: the unique identifier; and the n-qubit quantum state; determining, by the classical computer, that the unique identifier is real; selecting, by the classical computer, the secret-key quantum circuit; generating, by the classical computer and the quantum computer, the classical description of the unique identifier using the secret-key quantum circuit; determining, by the classical computer, one or more computational bases based on the classical description of the unique identifier; generating, by the quantum computer, a real n-qubit quantum state based on the classical description of the unique identifier and the one or more computational bases; determining, by the quantum computer, a real measurement of the real n-qubit quantum state using the one or more computational bases; determining, by the quantum computer, a token measurement of the received n-qubit quantum state using the one or more computational bases; and verifying the token measurement using the real measurement such that the quantum token is verified..”. in view of other limitations of claim 1, 8 and 15. Dependent claims are allowed as they depend from an allowable independent claim. The closest prior art made of record are: Okhuma et al. (20060129486)) An aspect of the present invention relates to a quantum cash system and a quantum cash apparatus which can inhibit even forgery in which quantum verification information is transformed using inverse transformation data, thus improving security. In order to allow quantum cash to be validly used, a quantum cash holding apparatus outputs one of the inverse transformation data and then inhibits the output of the other inverse transformation data in a verification list. This prevents the outflow of the other inverse transformation data, required for the forgery of the quantum cash.. Pastawki et al. (US 20140358793) A quantum ticket is defined by a unique serial number; and a set of qubits, each qubit encoding quantum information. The serial number and the set of qubits are distributed only among one or more trusted verifiers who require a tolerance fidelity F.sub.tol in order to authenticate the token, where F.sub.tol represents a minimum percentage of correct outcomes during authentication of the serial number and the set of qubits. The experimental fidelity F.sub.exp for the quantum token is greater than the Ft0i set by the verifiers, so that an honest user of the quantum ticket who achieves F.sub.exp is exponentially likely to be successfully authenticated when seeking authentication by any of the trusted verifiers. The forging fidelity F.sub.forg for the quantum token is less than Ft0i, so that a dishonest user who achieves F.sub.forg and attempts forgery of the quantum ticket is exponentially likely to fail to obtain authentication for his forged ticket. McCarty et al. (US 220210109707) Methods, systems, and apparatus for implementing a hexadecimal to quantum computation translation. In one aspect, a method includes obtaining one or more hexadecimal data inputs; applying a quantum computation translation operation to each hexadecimal data input to generate one or more corresponding sequences of quantum computations; implementing the one or more sequences of quantum computations using quantum computing hardware to obtain one or more corresponding sequence of measurement results; and providing the one or more sequences of measurement results as respective representations of the one or more hexadecimal data inputs. Chuang et al. (US 7246240) Systems and methods for providing secure quantum digital signatures. In one embodiment, a digital signature user creates a plurality of identical "public" keys having one or more bits and a corresponding quantum mechanical one-way function. Quantum digital signature recipients use a "swap test" to check the validity of a copy of the key, and compare the test results with others. The quantum digital signature user sends a signed message over any channel, including an insecure channel. The recipients evaluate the signed message, and quantify the number of incorrect keys. The message is deemed valid and original, or forged and/or tampered with, when the number of incorrect keys is less than a lower threshold, or exceeds an upper threshold, respectively. For an intermediate number of incorrect keys, the recipients determine message authenticity by comparing observations. Hardware useful for application of the method is disclosed. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHRISTOPHER C HARRIS whose telephone number is (571)270-7841. The examiner can normally be reached Monday through Friday between 8:00 AM to 4:00 PM CST. 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 L Nickerson can be reached on (469) 295-9235. 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. /CHRISTOPHER C HARRIS/Primary Examiner, Art Unit 2432
Read full office action

Prosecution Timeline

Jul 11, 2025
Application Filed
Aug 26, 2026
Non-Final Rejection mailed — §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12771680
System, Method, and Computer Program Product for Managing Computational Cluster Access to Multiple Domains
2y 2m to grant Granted Oct 20, 2026
Patent 12763952
CROSS CERTIFICATION METHOD AND CERTIFYING DEVICE FOR PROVIDING THE METHOD
1y 10m to grant Granted Oct 13, 2026
Patent 12745090
NETWORK-LEVEL ELEVATED SECURITY EXECUTION MODES FOR NETWORK-ACCESSIBLE DEVICES
2y 8m to grant Granted Sep 22, 2026
Patent 12745081
POINTER MECHANISMS FOR COMMUNICATING AUTHENTICATION AND KEY MANAGEMENT (AKM) AND CIPHERS
1y 12m to grant Granted Sep 22, 2026
Patent 12737457
Machine Learning Process Detection
2y 9m to grant Granted Sep 15, 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
77%
Grant Probability
99%
With Interview (+25.3%)
2y 10m (~1y 6m remaining)
Median Time to Grant
Low
PTA Risk
Based on 378 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