# US 2026/0254624 A1 · Decision Engine Consistency Verification System

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0254624 A1
- Document ID: US20260254624A1
- Status: Published application
- Kind: A1
- Application number: 19/643,327
- Filed: 2026-04-09
- Published: 2026-08-27
- Earliest claimed: 2024-05-10
- Assignees: Bank of America Corporation
- Applicants: Bank of America Corporation
- Inventors: Partha Sarathi Dhar; Ravi Kiran Hukmani; Naresh Kumar Chitipolu; Kanaka Subramaniam Kunjithapatham; Daniel Lee Wadsworth; Adam Jones; Manisha S. More; Uma Sheela; Manivannan Perumalswami; Vasu Puli; Swarn Deep; Kamal Joshi
- Web page: https://patentgrep.com/patent/US20260254624A1

## CPC

- H04L 9/0855: {involving additional nodes, e.g. quantum relays, repeaters, intermediate nodes or remote nodes}
- H04L 9/0838: {Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these (network architectures or network communication protocols for key exchange in a packet data network H04L63/061)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Various aspects of the disclosure relate to verification of data sets used for real-time processes and/or batch processes. A computing platform negotiates, by a first quantum node, a shared key group with at least a second quantum node and calculates an exclusive or (XOR) value of a pair of the first quantum node and the second quantum node. The first quantum service node performs a shared key grouping with the second quantum node and then selects a quantum key relay link between a real-time node and a batch source node. The computing platform selects a corresponding state of all virtual quantum nodes associated with the quantum key relay link and encapsulates a virtual quantum link state between any two quantum service nodes in the quantum network into a database decision engine data file.

## Claims

### Claim 1

A method comprising:
identifying, by a quantum service rule engine, a plurality of quantum nodes of a quantum network, wherein the plurality of quantum nodes are associated with data processing operations;
negotiating, by a first quantum node of the plurality of quantum nodes, a shared key group with at least a second quantum node, wherein the first quantum node is adjacent to the second quantum node;
calculating, by a quantum relay node, an exclusive or (XOR) value of a pair of quantum nodes comprising the first quantum node and the second quantum node;
sending, to one or more target recipients comprising one or more target nodes, an instruction for the first quantum node to perform a shared key grouping with the second quantum node;
selecting a quantum key relay link between the first quantum node comprising a real-time node associated with real-time processing operations and the second quantum node comprising a batch source node associated with batch processing operations;
selecting a corresponding state of the first quantum node and the second quantum node associated with the quantum key relay link from one or both of a virtual quantum network state or a virtual network state slice;
initiating, based on a virtual quantum link state, negotiation by a target quantum node a predetermined number of shared quantum keys with adjacent target quantum nodes comprising the first quantum node and the second quantum node; and
causing utilization, by the first quantum node and the second quantum node of the quantum network, dynamic on-demand virtualization routing status method for nodes and data sets to provide a first target state for real-time operations and batch process operations.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first quantum node negotiates with a plurality of adjacent quantum nodes of the plurality of quantum nodes.

### Claim 3 (depends on 2)

The method of claim 2, further comprising causing each quantum node of the plurality of quantum nodes of the quantum network to negotiate a shared key group with each adjacent quantum node.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
calculating the XOR value of any two shared key group among all shared key groups of the plurality of quantum nodes; and
creating a corresponding identification for the any two shared key group.

### Claim 5 (depends on 1)

The method of claim 1, wherein a target receiver creates network status identifiers for all virtual node routing states for all quantum relay nodes with the same global identifier.

### Claim 6 (depends on 1)

The method of claim 1, further comprising selecting one of virtual quantum rule engine network state and a virtual state slice.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
filtering virtual node routing data;
calculating the XOR value of all virtual node routing data; and
creating a virtual quantum link status identifier for a XOR quantum gate value.

### Claim 8 (depends on 1)

The method of claim 1, wherein the first target state is different than a second target state.

### Claim 9

A computing platform comprising:
a processor; and
memory storing instructions that, when executed by the processor, cause the computing platform to:
negotiate, by a first quantum node of a plurality of quantum nodes, a shared key group with a second quantum node, wherein the first quantum node is adjacent to the second quantum node;
send, to one or more target recipients comprising one or more target nodes, an instruction for the first quantum node to perform a shared key grouping with the second quantum node;
select a quantum key relay link between the first quantum node comprising a real-time node associated with real-time processing operations and the second quantum node comprising a batch source node associated with batch processing operations;
select a corresponding state of the first quantum node and the second quantum node associated with the quantum key relay link from one or both of a virtual quantum network state or a virtual network state;
initiate negotiation, based on virtual quantum link state and by a target quantum node, a predetermined number of shared quantum keys with adjacent target quantum nodes comprising the first quantum node and the second quantum node;
create a plurality of virtual nodes to provide responder routing status information;
communicate the routing status information to a target recipient comprising one or more of the target quantum node and the adjacent target quantum nodes; and
cause utilization, by the first quantum node and the second quantum node of the quantum network, dynamic on-demand virtualization routing status method for nodes and data sets to provide a common target state for a first target state for real-time operations and batch process operations.

### Claim 10 (depends on 9)

The computing platform of claim 9, wherein the instructions further cause the computing platform to cause each quantum node of the plurality of quantum nodes of the quantum network to negotiate a shared key group with each adjacent quantum node.

### Claim 11 (depends on 9)

The computing platform of claim 9, wherein the instructions further cause the computing platform to:
calculate the XOR value of any two shared key group among all shared key groups of the plurality of quantum nodes; and
create a corresponding identification for the any two shared key group.

### Claim 12 (depends on 9)

The computing platform of claim 9, wherein a target receiver creates network status identifiers for all virtual node routing states for all quantum relay nodes with the same global identifier.

### Claim 13 (depends on 9)

The computing platform of claim 9, wherein the instructions further cause the computing platform to select one of virtual quantum rule engine network state and a virtual state slice.

### Claim 14 (depends on 9)

The computing platform of claim 9, wherein the instructions further cause the computing platform to:
filter virtual node routing data;
calculate the XOR value of all virtual node routing data; and
create a virtual quantum link status identifier for a XOR quantum gate value.

### Claim 15

Non-transitory computer readable media storing instructions that, when executed by a processor, cause a computing platform to:
negotiate, by a first quantum node of a plurality of quantum nodes, a shared key group with a second quantum node, wherein the first quantum node is adjacent to the second quantum node;
send, to one or more target recipients comprising one or more target nodes, an instruction for the first quantum node to perform a shared key grouping with the second quantum node;
select a quantum key relay link between the first quantum node comprising a real-time node associated with real-time processing operations and the second quantum node comprising a batch source node associated with batch processing operations;
select a corresponding state of the first quantum node and the second quantum node associated with the quantum key relay link from one or both of a virtual quantum network state or a virtual network state;
initiate negotiation, based on virtual quantum link state and by a target quantum node, a predetermined number of shared quantum keys with adjacent target quantum nodes comprising the first quantum node and the second quantum node;
create a plurality of virtual nodes to provide responder routing status information;
communicate the routing status information to a target recipient comprising one or more of the target quantum node and the adjacent target quantum nodes; and
cause utilization, by the first quantum node and the second quantum node of the quantum network, dynamic on-demand virtualization routing status method for nodes and data sets to provide a common target state for a first target state for real-time operations and batch process operations.

### Claim 16 (depends on 15)

The non-transitory computer-readably media of claim 15, wherein the first quantum node negotiates with a plurality of adjacent quantum nodes of the plurality of quantum nodes.

### Claim 17 (depends on 15)

The non-transitory computer-readably media of claim 15, wherein the instructions further cause the computing platform to cause each quantum node of the plurality of quantum nodes of the quantum network to negotiate a shared key group with each adjacent quantum node.

### Claim 18 (depends on 15)

The non-transitory computer-readably media of claim 15, wherein the instructions further cause the computing platform to:
calculate the XOR value of any two shared key group among all shared key groups of the plurality of quantum nodes; and
create a corresponding identification for the any two shared key group.

### Claim 19 (depends on 15)

The non-transitory computer-readably media of claim 15, wherein a target receiver creates network status identifiers for all virtual node routing states for all quantum relay nodes with the same global identifier.

### Claim 20 (depends on 15)

The non-transitory computer-readably media of claim 15, wherein the instructions further cause the computing platform to:
filter virtual node routing data;
calculate the XOR value of all virtual node routing data; and
create a virtual quantum link status identifier for a XOR quantum gate value.
