Granted Patent B2

US 12,619,902 · App. 18/425,729 · Granted May 5, 2026

Inventors: Kalyan Chakravarthy Pallapolu (Hyderabad, IN); Gondi Mahesh (Hyderabad, IN); Gali Mohan Sreenivas (Tirupati, IN)

Assignee: Bank of America Corporation

G06N10/70G06F11/36G06N10/60H04L67/02

Abstract

Claims (110)

1 . A system comprising:

a memory configured to store:

a quantum search algorithm; and

a plurality of rules, wherein the plurality of rules are used to identify application programming interface (API) errors;

a classical processor communicatively coupled to the memory, wherein the classical processor is configured to:

analyze codes of a plurality of applications, wherein the plurality of applications are configured to be deployed to a plurality of computing systems;

identify first errors in the codes of the plurality of applications based on the plurality of rules;

receive, from a quantum processor, one or more APIs of the plurality of applications that correspond to the first errors;

identify a first application of the plurality of application corresponding to a first API of the one or more APIs, wherein the first application is configured to be deployed to a first computing system of the plurality of computing systems;

determine a first code fix for a first code of the first application; and

apply the first code fix to the first code of the first application to determine a first fixed code of the first application; and

the quantum processor communicatively coupled to the memory, wherein the quantum processor, when implementing the quantum search algorithm, is configured to:

initialize a first plurality of qubits;

generate a first initial quantum state based on the first plurality of qubits;

perform one or more first iterations on the first initial quantum state to determine a first final quantum state, wherein performing an iteration of the one or more first iterations comprises:

applying a first oracle operator to a first current quantum state; and

applying a first diffusion operator to the first current quantum state; and

determine, based on the first final quantum state, the one or more APIs of the plurality of applications that correspond to the first errors.

2 . The system of claim 1 , wherein the classical processor is further configured to:

deploy the first fixed code of the first application to a test computing system;

analyze the first application;

determine whether first run-time errors are identified for the first application; and

in response to determining that no first run-time errors are identified, deploy the first fixed code of the first application to the first computing system.

3 . The system of claim 2 , wherein:

the classical processor is further configured to, in response to determining that the first run-time errors are identified:

receive, from the quantum processor, one or more APIs of the first application that correspond to the first run-time errors;

determine a second code fix for the first fixed code of the first application; and

apply the second code fix to the first fixed code of the first application to determine a second fixed code of the first application; and

the quantum processor is further configured to, in response to determining that the first run-time errors are identified:

initialize a second plurality of qubits;

generate a second initial quantum state based on the second plurality of qubits;

perform one or more second iterations on the second initial quantum state to determine a second final quantum state, wherein performing an iteration of the one or more second iterations comprises:

applying a second oracle operator to a second current quantum state; and

applying a second diffusion operator to the second current quantum state; and

determine, based on the second final quantum state, the one or more APIs of the first application that correspond to the first run-time errors.

4 . The system of claim 3 , wherein the classical processor is further configured to:

deploy the second fixed code of the first application to the test computing system;

analyze the first application;

determine whether second run-time errors are identified for the first application; and

in response to determining that no second run-time errors are identified, deploy the second fixed code of the first application to the first computing system.

5 . The system of claim 1 , wherein the first oracle operator comprises a Pauli X gate.

6 . The system of claim 1 , wherein generating the first initial quantum state based on the first plurality of qubits comprises applying a Hadamard operator to the first plurality of qubits.

7 . The system of claim 1 , wherein determining, based on the first final quantum state, the one or more APIs of the plurality of applications that correspond to the first errors comprises measuring the first final quantum state.

8 . A method comprising:

analyzing codes of a plurality of applications, wherein the plurality of applications are configured to be deployed to a plurality of computing systems;

identifying first errors in the codes of the plurality of applications based on a plurality of rules, wherein the plurality of rules are used to identify application programming interface (API) errors in the codes of the plurality of applications;

initializing a first plurality of qubits;

generating a first initial quantum state based on the first plurality of qubits;

performing one or more first iterations on the first initial quantum state to determine a first final quantum state, wherein performing an iteration of the one or more first iteration comprises:

applying a first oracle operator to a first current quantum state; and

applying a first diffusion operator to the first current quantum state;

determining, based on the first final quantum state, one or more APIs of the plurality of applications that correspond to the first errors;

identifying a first application of the plurality of applications corresponding to a first API of the one or more APIs, wherein the first application is configured to be deployed to a first computing system of the plurality of computing systems;

determining a first code fix for a first code of the first application; and

applying the first code fix to the first code of the first application to determine a first fixed code of the first application.

9 . The method of claim 8 , further comprising:

deploying the first fixed code of the first application to a test computing system;

analyzing the first application;

determining whether first run-time errors are identified for the first application; and

in response to determining that no first run-time errors are identified, deploying the first fixed code of the first application to the first computing system.

10 . The method of claim 9 , further comprising, in response to determining that the first run-time errors are identified:

initializing a second plurality of qubits;

generating a second initial quantum state based on the second plurality of qubits;

performing one or more second iterations on the second initial quantum state to determine a second final quantum state, wherein performing an iteration of the one or more second iterations comprises:

applying a second oracle operator to a second current quantum state; and

applying a second diffusion operator to the second current quantum state;

determining, based on the second final quantum state, the one or more APIs of the first application that correspond to the first run-time errors;

determining a second code fix for the first fixed code of the first application; and

applying the second code fix to the first fixed code of the first application to determine a second fixed code of the first application.

11 . The method of claim 10 , further comprising:

deploying the second fixed code of the first application to the test computing system;

analyzing the first application;

determining whether second run-time errors are identified for the first application; and

in response to determining that no second run-time errors are identified, deploying the second fixed code of the first application to the first computing system.

12 . The method of claim 8 , wherein the first oracle operator comprises a Pauli X gate.

13 . The method of claim 8 , wherein generating the first initial quantum state based on the first plurality of qubits comprises applying a Hadamard operator to the first plurality of qubits.

14 . The method of claim 8 , wherein determining, based on the first final quantum state, the one or more APIs of the plurality of applications that correspond to the first errors comprises measuring the first final quantum state.

15 . A non-transitory computer-readable medium storing instructions that, when executed by at least one of a classical processor or a quantum processor, cause the at least one of the classical processor or the quantum processor to:

analyze codes of a plurality of applications, wherein the plurality of applications are configured to be deployed to a plurality of computing systems;

identify first errors in the codes of the plurality of applications based on a plurality of rules, wherein the plurality of rules are used to identify application programming interface (API) errors in the codes of the plurality of applications;

initialize a first plurality of qubits;

generate a first initial quantum state based on the first plurality of qubits;

perform one or more first iterations on the first initial quantum state to determine a first final quantum state, wherein performing an iteration of the one or more first iterations comprises:

applying a first oracle operator to a first current quantum state; and

applying a first diffusion operator to the first current quantum state;

determine, based on the first final quantum state, one or more APIs of the plurality of applications that correspond to the first errors;

identify a first application of the plurality of applications corresponding to a first API of the one or more APIs, wherein the first application is configured to be deployed to a first computing system of the plurality of computing systems;

determine a first code fix for a first code of the first application; and

apply the first code fix to the first code of the first application to determine a first fixed code of the first application.

16 . The non-transitory computer-readable medium of claim 15 , wherein the instructions, when executed by the at least one of the classical processor or the quantum processor, further cause the at least one of the classical processor or the quantum processor to:

deploy the first fixed code of the first application to a test computing system;

analyze the first application;

determine whether first run-time errors are identified for the first application; and

in response to determining that no first run-time errors are identified, deploy the first fixed code of the first application to the first computing system.

17 . The non-transitory computer-readable medium of claim 16 , wherein the instructions, when executed by the at least one of the classical processor or the quantum processor, further cause the at least one of the classical processor or the quantum processor to, in response to determining that the first run-time errors are identified:

initialize a second plurality of qubits;

generate a second initial quantum state based on the second plurality of qubits;

perform one or more second iterations on the second initial quantum state to determine a second final quantum state, wherein performing an iteration of the one or more second iterations comprises:

applying a second oracle operator to a second current quantum state; and

applying a second diffusion operator to the second current quantum state;

determine, based on the second final quantum state, the one or more APIs of the first application that correspond to the first run-time errors;

determine a second code fix for the first fixed code of the first application; and

apply the second code fix to the first fixed code of the first application to determine a second fixed code of the first application.

18 . The non-transitory computer-readable medium of claim 17 , wherein the instructions, when executed by the at least one of the classical processor or the quantum processor, further cause the at least one of the classical processor or the quantum processor to:

deploy the second fixed code of the first application to the test computing system;

analyze the first application;

determine whether second run-time errors are identified for the first application; and

in response to determining that no second run-time errors are identified, deploy the second fixed code of the first application to the first computing system.

19 . The non-transitory computer-readable medium of claim 15 , wherein the first oracle operator comprises a Pauli X gate.

20 . The non-transitory computer-readable medium of claim 15 , wherein generating the first initial quantum state based on the first plurality of qubits comprises applying a Hadamard operator to the first plurality of qubits.

Assignments (2)

Continuity (1)

References Cited (22)