Quantum Search and DNA Storage for Faster, Denser UBO Retrieval

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current search and storage methods for determining ultimate beneficial owner (UBO) information are inefficient in terms of search speed and data density.

Innovation Solution

A system utilizing quantum computing to enhance search speed through quantum parallelization and DNA storage to increase data density by encoding search results in DNA strands.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If current search methods are used to search unstructured data, then the search process can be completed, but the search speed is insufficient

Engineering Contradiction:
Improvesearch speedVSAvoidsearch efficiency
Core Design Contradiction:
SpeedVSProductivity

Solution Approach 1:

The patent replaces classical mechanical search systems with quantum computing systems that utilize quantum parallelization. The quantum processor executes quantum search algorithms that can evaluate multiple data paths simultaneously, achieving exponential speedup over traditional sequential or parallel classical search methods for unstructured data.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Quantity of substance

If current storage methods are used to store search results, then data can be stored, but the data density is insufficient

Engineering Contradiction:
Improvedata densityVSAvoidstorage space
Core Design Contradiction:
Quantity of substanceVSVolume of stationary object

Solution Approach 1:

The patent fundamentally changes the physical parameter of data storage by transitioning from classical digital storage to biological DNA storage. Data is encoded into DNA sequences using quaternary encoding schemes, allowing extremely high data density where petabytes of information can be stored in milligrams of DNA material.

Inventive Principle:
Principle #35Parameter changes

3Productivity

If quantum computing is used to improve search speed, then search performance increases, but system complexity increases

Engineering Contradiction:
Improvesearch performanceVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent introduces converter systems as intermediary components that bridge classical and quantum domains. These converters handle data encoding/decoding and interface between classical processors and quantum processors, managing the complexity of quantum operations while presenting simplified interfaces to users and classical systems.

Inventive Principle:
Principle #24Intermediary (Mediator)

Applied Scientific Principles

This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.

Function Achieved in This Case

The system achieves faster search processes and higher data density by leveraging quantum parallelization and DNA storage, improving the efficiency of UBO information retrieval.

Implementation Method 1

By using the quantum processor, a speed of the search process is increased due to quantum parallelization

Methodology Applied
Scientific EffectQuantum parallelization:

Implementation Method 2

By storing the search results in DNA strands, a data density of the storage system is improved

Methodology Applied
Scientific EffectDNA storage:

Data Source

PatentUS12373579B2Data processing and storage using quantum and DNA computing
Publication Date: 2025.07.29 BANK OF AMERICA CORP
  • US12373579B2 patent drawing
  • US12373579B2 patent drawing

AI summary

A system and method for data processing and storage using quantum and deoxyribonucleic acid (DNA) computing. The method includes receiving a request for a search data item. The request includes a first information represented by classical binary bits. The request is converted into a converted request. The converted request includes the first information represented by quantum bits. One or more servers are searched based on the converted request using a quantum search algorithm. Search results are generated. The search results are ranked according to ranking rules. A highest-ranked result includes a second information represented by quantum bits. The highest-ranked result is converted to a converted highest-ranked result. The converted highest-ranked result includes the second information represented by DNA bits. The converted highest-ranked result is encrypted to generate an encrypted and converted highest-ranked result. The encrypted and converted highest-ranked result is stored in one or more DNA strands.