US2026080294A1PendingUtilityA1

System and method for quantum-based Application Programming Interface (API) failure handling and virtualization

Assignee: BANK OF AMERICAPriority: Sep 19, 2024Filed: Sep 19, 2024Published: Mar 19, 2026
Est. expirySep 19, 2044(~18.2 yrs left)· nominal 20-yr term from priority
G06N 10/70
51
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A system for implementing a quantum-based application programming interface (API) failure detection and virtualization is disclosed. The system receives an API data packet and converts the API data packet into a set of quantum state arrays. The system generates a unified buffer array that is associated with the corresponding tasks from among the API data packets. The system validates that the unified buffer array corresponds to a quantum representation of the API data packet by comparing the unified buffer array with a vector that comprises binary bits associated with the API data packet and determining that the unified buffer array corresponds to the vector.

Claims

exact text as granted — not AI-modified
1 . A system comprising:
 a memory configured to store a set of data packets, and a processor, operably coupled to the memory, and configured to:
 receive the set of data packets; 
 convert each of the set of data packets into a respective quantum state array, wherein the respective quantum state array indicates a value of each quantum bit associated with a respective binary bit from among the set of data packets; 
 generate a unified buffer array associated with the set of data packets; and 
 validate that the unified buffer array corresponds to a quantum representation of the set of data packets, wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets comprises:
 comparing the unified buffer array with a vector that comprises the set of data packets; and 
 determining that the unified buffer array corresponds to the vector based at least in part upon the comparison. 
 
   
     
     
         2 . The system of  claim 1 , wherein:
 the set of data packets is associated with an application programming interface (API) request to perform a set of tasks; and   the set of data packets comprises a first data packet associated with a first task and a second data packet associated with a second task.   
     
     
         3 . The system of  claim 2 , wherein converting each of the set of data packets into the respective quantum state array comprises:
 converting the first data packet into a first quantum state array;   converting the second data packet into a second quantum state array; and   initializing a qubit for each binary bit from among the set of data packets, wherein each binary bit 0 is converted into a qubit |0> and each binary bit 1 is converted into a qubit |1>.   
     
     
         4 . The system of  claim 3 , wherein generating a unified buffer array associated with a quantum representation of the set of data packets comprises:
 determining which quantum state arrays have a corresponding length and position in a vector space;   determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array, indicating that the first quantum state array carries corresponding qubits as the second quantum state array;   pairing the first quantum state array with the second quantum state array in response to determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array; and   populating the unified buffer array with the paired first quantum state array and the second quantum state array.   
     
     
         5 . The system of  claim 4 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing a convolution operation between the unified buffer array and the vector; and   determining that the convolution operation results in zero or less than a threshold percentage difference between the unified buffer and the vector.   
     
     
         6 . The system of  claim 4 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing an inverse matrix multiplication between the unified buffer array and the vector; and   determining that the inverse matrix multiplication results in an identity unit matrix.   
     
     
         7 . The system of  claim 4 , the processor is further configured to determine that the first data packet and the second data packet are associated with a corresponding task in response to determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array. 
     
     
         8 . A method comprising:
 receiving a set of data packets;   converting each of the set of data packets into a respective quantum state array, wherein the respective quantum state array indicates a value of each quantum bit associated with a respective binary bit from among the set of data packets;   generating a unified buffer array associated with the set of data packets; and   validating that the unified buffer array corresponds to a quantum representation of the set of data packets, wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets comprises:
 comparing the unified buffer array with a vector that comprises the set of data packets; and 
 determining that the unified buffer array corresponds to the vector based at least in part upon the comparison. 
   
     
     
         9 . The method of  claim 8 , wherein:
 the set of data packets is associated with an application programming interface (API) request to perform a set of tasks; and   the set of data packets comprises a first data packet associated with a first task and a second data packet associated with a second task.   
     
     
         10 . The method of  claim 9 , wherein converting each of the set of data packets into the respective quantum state array comprises:
 converting the first data packet into a first quantum state array;   converting the second data packet into a second quantum state array; and   initializing a qubit for each binary bit from among the set of data packets, wherein each binary bit 0 is converted into a qubit |0> and each binary bit 1 is converted into a qubit |1>.   
     
     
         11 . The method of  claim 10 , wherein generating a unified buffer array associated with a quantum representation of the set of data packets comprises:
 determining which quantum state arrays have a corresponding length and position in a vector space;   determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array indicating that the first quantum state array carries corresponding qubits as the second quantum state array;   pairing the first quantum state array with the second quantum state array in response to determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array; and   populating the unified buffer array with the paired first quantum state array and the second quantum state array.   
     
     
         12 . The method of  claim 11 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing a convolution operation between the unified buffer array and the vector; and   determining that the convolution operation results in zero or less than a threshold percentage difference between the unified buffer and the vector.   
     
     
         13 . The method of  claim 12 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing an inverse matrix multiplication between the unified buffer array and the vector; and   determining that the inverse matrix multiplication results in an identity unit matrix.   
     
     
         14 . The method of  claim 12 , further comprising determining that the first data packet and the second data packet are associated with a corresponding task in response to determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array. 
     
     
         15 . A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to:
 receive a set of data packets;   convert each of the set of data packets into a respective quantum state array, wherein the respective quantum state array indicates a value of each quantum bit associated with a respective binary bit from among the set of data packets;   generate a unified buffer array associated with the set of data packets; and   validate that the unified buffer array corresponds to a quantum representation of the set of data packets, wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets comprises:
 comparing the unified buffer array with a vector that comprises the set of data packets; and 
 determining that the unified buffer array corresponds to the vector based at least in part upon the comparison. 
   
     
     
         16 . The non-transitory computer-readable medium of  claim 15 , wherein:
 the set of data packets is associated with an application programming interface (API) request to perform a set of tasks; and   the set of data packets comprises a first data packet associated with a first task and a second data packet associated with a second task.   
     
     
         17 . The non-transitory computer-readable medium of  claim 16 , wherein converting each of the set of data packets into the respective quantum state array comprises:
 converting the first data packet into a first quantum state array;   converting the second data packet into a second quantum state array; and   initializing a qubit for each binary bit from among the set of data packets, wherein each binary bit 0 is converted into a qubit |0> and each binary bit 1 is converted into a qubit |1>.   
     
     
         18 . The non-transitory computer-readable medium of  claim 17 , wherein generating a unified buffer array associated with a quantum representation of the set of data packets comprises:
 determining which quantum state arrays have a corresponding length and position in a vector space;   determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array, indicating that the first quantum state array carries corresponding qubits as the second quantum state array;   pairing the first quantum state array with the second quantum state array in response to determining that the first quantum state array has the corresponding length and position in the vector space as the second quantum state array; and   populating the unified buffer array with the paired first quantum state array and the second quantum state array.   
     
     
         19 . The non-transitory computer-readable medium of  claim 18 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing a convolution operation between the unified buffer array and the vector; and   determining that the convolution operation results in zero or less than a threshold percentage difference between the unified buffer and the vector.   
     
     
         20 . The non-transitory computer-readable medium of  claim 18 , wherein validating that the unified buffer array corresponds to the quantum representation of the set of data packets is in response to:
 performing an inverse matrix multiplication between the unified buffer array and the vector; and   determining that the inverse matrix multiplication results in an identity unit matrix.

Join the waitlist — get patent alerts

Track US2026080294A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.