Quantum-Quick Queries

Zhong Pu-Cha, Wan‐Su Bao, Wei-Yun Ma

Choi and Korepin [Quantum Information Processing 6(2007)243] presented a quantum partial search algorithm of a database with several target items which can find a target block quickly when each target block contains the same number of target items. Actually, the number of target items in each target block is arbitrary. Aiming at this case, we give a condition to guarantee performance of the partial search algorithm to be performed and the number of queries to oracle of the algorithm to be minimized. In addition, by further numerical computing we come to the conclusion that the more uniform the distribution of target items, the smaller the number of queries.

Aditi Namdeo

As the cloud BI platforms (business intelligence) are rapidly evolving, the need to process queries more efficiently, especially when handling large and complex data has also increased. The classic optimization approaches can be scalability issues and may lead to increased latency and resources consumption. This work's idea on cloud BI is the hybrid model using quantum computing algorithms related to classical query execution pipelines to make it more efficient in decision making and improve the performance of the cloud query execution. The proposed framework is quantum inspired search query execution plan evaluation and quantum inspired parallelism searching which can search out the cost effective query execution plan construction for evaluation in a short time interval and is transparent in preserving the accuracy. It consists of three major components: Quantum Query Analyser, which is used to convert queries from complex SQL to representations that can be executed by the quantum algorithms; Hybrid Optimisation Engine which uses quantum algorithms and classical heuristics to suggest on how to optimise the query; Adaptive Resource Manager which dynamically allocates cloud resources based on the output from the optimisation step. A benchmark of experiments on standard data sets demonstrates that the query throughput can be improved by up to 40%–55% with reduced memory and CPU use with the quantum-accelerated approach when compared to state-of-the- art classical optimizers. It can also be configured as a multi-tenant cloud setup, ensuring security and scalability with minimal interruptions between different workloads. These outcomes demonstrate that the algorithms used in quantum computing can also be employed with current cloud based BI systems and suggests that quantum computing may be able to become a useful means to more quickly and efficiently perform analytics in Enterprise systems.

Ning Ma

Apoorva D. Patel

Sorting is a fundamental computational process that facilitates subsequent searching of a database. It can be thought of as factorization of the search process. The location of a desired item in a sorted database can be found by classical queries that inspect one letter of the label at a time. For an unsorted database, no such classical quick search algorithm is available. If the database permits quantum queries, however, then mere digitization is sufficient for efficient search. Sorting becomes redundant with the quantum superposition of states. A quantum algorithm is written down that locates the desired item in an unsorted database a factor of two faster than the best classical algorithm can in a sorted database. This algorithm has close resemblance to the assembly process in DNA replication.