Prosecution Insights
Last updated: October 02, 2026
Application No. 18/923,798

System and method for encoding and encrypting sensitive data based on quantum entanglement

Final Rejection §103
Filed
Oct 23, 2024
Examiner
LITTLE, VANCE M
Art Unit
2494
Tech Center
2400 — Computer Networks
Assignee
Bank of America Corporation
OA Round
2 (Final)
84%
Grant Probability
Favorable
3-4
OA Rounds
7m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
345 granted / 411 resolved
+25.9% vs TC avg
Strong +24% interview lift
Without
With
+24.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
22 currently pending
Career history
436
Total Applications
across all art units

Statute-Specific Performance

§101
12.0%
-28.0% vs TC avg
§103
55.1%
+15.1% vs TC avg
§102
11.2%
-28.8% vs TC avg
§112
15.5%
-24.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 411 resolved cases

Office Action

§103
DETAILED ACTION This Office action is in response to amendments and remarks filed by Applicant on 5/15/2026. 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 Amendment Applicant presents amendments to claims 1, 4–6, 8, 11–13, 15, and 18–20. The amendments have been fully considered. Applicant amends claims 1, 4, 6, 8, 11, 13, 15, 18, and 19 to clarify the ambiguity in the recited Qubit vs. QuBit. The claim objection is withdrawn. Applicant amends independent claims 1, 8, and 15 to incorporate subject matter from dependent claims 5, 12, and 19. The subject matter was previously rejected. The previously-cited combination of references serving as the basis for the rejection of the dependent claims is applied to the independent claims. Response to Arguments Applicant presents arguments with respect to independent claims 1, 8, and 15. All arguments are fully considered. Applicant argues that the combining of the secondary reference, Jacak, with the primary reference, Yuan, would render the primary reference “inoperable for its intended purpose” and that none of the cited references teach the recited, “in response to transmitting the quantum cryptographic key to the quantum computing device, encode the sensitive data based at least in part on the quantum cryptographic key and the unique random key, wherein the encoded sensitive data comprises a generated one or more pairs of entangled quantum bits”. The Examiner responds: The Examiner maintains that the primary reference teaches every aspect of the independent claims prior to the present amendment and that the secondary reference is only introduced to make abundantly clear that the resulting qubits would have the required entanglement characteristic nature, which is well-known, but was not explicitly articulated in the reference. Independent claims 1, 8, and 15 broadly claim, and the primary reference teaches, a conventional operation of Quantum Key Distribution relying on generated and shared quantum keys (generated with the help of a random sequence) to encode information and send a physical stream of particles across a fiber-optic channel and referred to as a stream of qubits. This process is described in more detain in Yuan ¶¶ 66–71 and the incorporation of the random number generator is found in Yuan ¶¶ 79–85. The recited, “in response to transmitting the quantum cryptographic key to the quantum computing device, encode the sensitive data based at least in part on the quantum cryptographic key and the unique random key, wherein the encoded sensitive data comprises a generated one or more pairs of entangled quantum bits”, is taught by Yuan. Specifically, the quantum cryptographic key is transmitted to the quantum computing device as described in t the key exchange between nodes. See Yuan Figure 3 and ¶ 84. To added effect, the disclosed quantum keys are generated with a random sequence of numbers generated by a random number generator, making them unique random keys. Once the keys are shared, the unique random keys can be used to encrypt and decrypt messages. In the primary reference, information is encoded and transmitted between nodes. See Yuan ¶ 68. Finally, by encoding classical data into quantum states, the results are fundamentally qubits. See Yuan ¶¶ 68–69. In the previous Office Action, the Examiner suspected that the primary reference might not have been entirely clear regarding the nature of the resulting qubits, specifically whether the reference clearly asserted that the qubits would exhibit the entanglement characteristic. In the previous Office Action, the Examiner separated certain concepts in the limitation at issue to apply clarifying evidence to the claim mapping. To ensure clarity, the secondary reference was used to provide evidence of the widely understood general concept that the resulting qubits have an entanglement characteristic (attempting to avoid reliance on “Official Notice or other information within the Examiner’s personal knowledge to establish a rejection”). Therefore, Applicant’s argument that combining the secondary reference, Jacak, with the primary reference, Yuan, would render the primary reference “inoperable for its intended purpose”, misses the point of the combination. The secondary reference demonstrates the quantum keys applied to a message results in entangled quantum pairs. See Jacak ¶¶ 16–17. The Examiner is not relying on the secondary reference to teach a missing step or function, but to clarify an already existing characteristic of the primary reference that is required by Applicant’s claim limitation (specifically, “one or more pairs of entangled quantum bits”). Applicant will note that the Examiner’s citation in the claim mapping reads, “applying a random key K to quantum pairs to form an encrypted message M’ with properties of entanglement”, and does not imply a wholesale wedging a Quantum One-Time Pad into the QKD process disclosed in the primary reference. Despite the Examiner’s assertion here that the primary reference teaches all aspects of the claim (prior to the present amendment) and that the secondary reference may not be necessary, the Examiner maintains the combination supporting the rejection under 35 U.S.C. 103 for the purposes of clarity. Applicant’s arguments are unpersuasive. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1–4, 6–11, 13–18, 20 rejected under 35 U.S.C. 103 as being unpatentable over Yuan (US 2020/0274701 A1, published Aug. 27, 2020) in view of Jacak (US 2021/0058244 A1, published Feb. 25, 2021) in view of Kunz (US 2024/0073011 A1, published Feb. 29, 2024). Regarding claims 1, 8, and 15, Yuan discloses: a system, comprising: a quantum memory configured to store a quantum cryptographic key, a unique random key, and sensitive data to be transmitted to a quantum computing device over an optical communication channel (nodes with quantum communications units are configured to transmit information to other nodes with similar units over the quantum channel. Yuan ¶ 79. Nodes store local QRNG keys and quantum keys and facilitate transmission of transit information. Yuan ¶¶ 79, 84–85.); and one or more quantum processors operably coupled to the quantum memory and configured to: access the quantum cryptographic key and the sensitive data to be transmitted to the quantum computing device (identical quantum cryptographic keys generated and shared among appropriate QKD transmitter and KQD receiver nodes having quantum communications unites and are indexed and stored. Yuan ¶ 84. Nodes with quantum communications units are configured to transmit information to other nodes with similar units over the quantum channel. Yuan ¶ 79.); transmit, over the optical communication channel, the quantum cryptographic key to the quantum computing device (quantum key pairs are shared between nodes in the quantum communications network. Yuan ¶ 84.); in response to transmitting the quantum cryptographic key to the quantum computing device, encode the sensitive data based at least in part on the quantum cryptographic key and the unique random key (forming the combined cryptographic key using a quantum cryptographic key that is shared between nodes combined with the local random secret generated by the QRNG at the node. Yuan ¶¶ 84–85.); and transmit, over the optical communication channel, the encoded sensitive data to the quantum computing device (nodes with quantum communications units are configured to transmit information to other nodes with similar units over the quantum channel. Yuan ¶ 79.). Yuan does not disclose: encoding the sensitive data based upon the unique random key, wherein the encoded sensitive data comprises a generated one or more pairs of entangled quantum bits (QuBits); in response to encoding the sensitive data based at least in part on the quantum cryptographic key and the unique random key, destroy the unique random key. However, Jacak does disclose: encoding the sensitive data based upon the unique random key, wherein the encoded sensitive data comprises a generated one or more pairs of entangled quantum bits (QuBits) (applying a random key K to quantum pairs to form an encrypted message M’ with properties of entanglement. Jacak ¶¶ 16–17.). Therefore, it would have been prima facie obvious to one of ordinary skill in the art prior to the effective filing date of the claimed invention to modify the secure transmission using quantum cryptography and classical cryptography on a quantum key distribution and combinations network of Yuan with the cryptographic payload being encrypted entangled qubits based upon the teachings of Jacak. The motivation being that applying OTP to quantum transmissions enables the entanglement and absolute security guarantees by fundamental quantum physical laws. Jacak ¶ 17. Yuan in view of Jacak does not disclose: in response to encoding the sensitive data based at least in part on the quantum cryptographic key and the unique random key, destroy the unique random key. However, Kunz does disclose: in response to encoding the sensitive data based at least in part on the quantum cryptographic key and the unique random key, destroy the unique random key (QPAD's are consumable data objects such that as the random key data is utilized, it is physically destroyed from disk and/or overwritten and destroyed in memory of subsystems utilizing the QPAD key material. Kunz ¶ 97.). Therefore, it would have been prima facie obvious to one of ordinary skill in the art prior to the effective filing date of the claimed invention to modify the secure transmission using quantum cryptography and classical cryptography on a quantum key distribution and combinations network of Yuan with deleting the unique random key after use based upon the teachings of Kunz. The motivation being to prohibit the key being used again. Kunz ¶ 94. Regarding claims 2, 9, and 16, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 1, 8, and 15, respectively, wherein the sensitive data comprises a sensitive message to be transmitted to the quantum computing device (nodes with quantum communications units are configured to transmit information to other nodes with similar units over the quantum channel. Yuan ¶ 79.), and wherein the one or more quantum processors are further configured to: encode the sensitive data based at least in part on the quantum cryptographic key and the unique random key to generate a ciphertext message (forming the combined cryptographic key using a quantum cryptographic key that is shared between nodes combined with the local random secret generated by the QRNG at the node. Yuan ¶¶ 84–85.); and transmit, over the optical communication channel, the ciphertext message to the quantum computing device (transmit information to other nodes with similar units over the quantum channel. Yuan ¶ 79.). Regarding claims 3, 10, and 17, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 2, 9, and 16, respectively, wherein the one or more quantum processors are further configured to encode the sensitive data based at least in part on the quantum cryptographic key and the unique random key to generate the ciphertext message in accordance with a one-time pad (OTP) encryption process (applying a random key K to quantum pairs to form an encrypted message M’ with properties of entanglement. Jacak ¶¶ 16–17. The reference notes that the extension of the classical OTP to the quantum case is trivial and the mapping encryption of the K to M follows bit by bit in corresponding to classical OTP process. Id.). Regarding claims 4, 11, and 18, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 1, 8, and 15, respectively, wherein the one or more quantum processors are further configured to: prior to encoding the sensitive data based at least in part on the quantum cryptographic key and the unique random key: identify, based at least in part on one Qubit of each pair of the one or more pairs of entangled QuBits, an observance of the quantum cryptographic key during the transmission of the quantum cryptographic key to the quantum computing device (quantum transmitter with the intensity modulator. Yuan ¶¶ 5 and 92.); and in response to identifying the observance of the quantum cryptographic key, destroy the quantum cryptographic key (the quantum transmitter allows the sender and receive to determine the presence of an eavesdropper by measuring the number of pulses which have been safely received with the different intensities. Yuan ¶¶ 88 and 92.). Regarding claims 5, 12, and 19, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 1, 8, and 15, respectively, wherein the one or more quantum processors are further configured to: generate the unique random key (generate local random secret using the QRNG at the node. Yuan ¶¶ 84–85.). Regarding claims 6, 13, and 20, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 1, 8, and 15, respectively, wherein the one or more pairs of entangled Qubits comprises one or more of a plurality of entangled photons, a plurality of entangled electrons, a plurality of entangled neuronal impulses, or a plurality of entangled subatomic particles (Jacak ¶ 8.). Regarding claims 7 and 14, Yuan in view of Jacak in view of Kunz discloses the limitations of claims 1 and 8, respectively, wherein the quantum computing device is configured to receive the transmission of the encoded sensitive data and to decrypt the encoded sensitive data based at least in part on the quantum cryptographic key and the unique random key (Yuan ¶¶ 79, 84–85.). Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: Wagner (NPL: Wagner, Matias, Introduction to Quantum Key Distribution and the Primary Challenge in Establishing a Global Quantum Network, Quantum-Safe Internet (QSI), https://quantum-safeinternet.com/stories/1615-2/, doi: Nov. 2023, accessed Jun. 2, 2026.), once a key is used, the information is destroyed. THIS ACTION IS MADE FINAL. 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 VANCE LITTLE whose telephone number is (571) 270-0408. The examiner can normally be reached Monday - Friday 9:30am - 5:30pm. 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, Jung (Jay) Kim can be reached at (571) 272-3804. 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. /VANCE M LITTLE/ Primary Examiner, Art Unit 2494
Read full office action

Prosecution Timeline

Oct 23, 2024
Application Filed
Feb 26, 2026
Non-Final Rejection mailed — §103
May 15, 2026
Response Filed
Jul 07, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12737479
METHODS AND SYSTEMS FOR ESTIMATING RISK OF ENTERPRISE APPLICATION FOR QUANTUM CRYPTOGRAPHY MIGRATION
2y 0m to grant Granted Sep 15, 2026
Patent 12719925
METHOD AND SYSTEM FOR SECURING LARGE LANGUAGE MODEL SERVICES AGAINST PRIVACY ATTACKS
2y 3m to grant Granted Aug 25, 2026
Patent 12717943
SECURE CAPTURE OF A DATA ITEM AT A CLIENT DEVICE
2y 2m to grant Granted Aug 25, 2026
Patent 12710933
OT Domain Low-Code Development Method and Platform, and Computer-Readable Medium
2y 4m to grant Granted Aug 18, 2026
Patent 12699784
SALTING BINARIES FOR HUMAN READABLE PRIME NUMBER COMPRESSION (HRPNC)
2y 2m to grant Granted Aug 04, 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

3-4
Expected OA Rounds
84%
Grant Probability
99%
With Interview (+24.4%)
2y 6m (~7m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 411 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