Synthesis of Quantum Vector Databases Based on Grovers Algorithm
Abstract
This paper describes a method for using Grovers algorithm to create a quantum vector database, the database stores embeddings based on Controlled-S gates, which represent a binary numerical value. This value represents the embeddings value. The process of creating meaningful embeddings is handled by a classical computer and the search process is handled by the quantum computer. This search approach might be beneficial for a large enough database, or it could be seen as a very qubit-efficient (super dense) way for storing data on a quantum computer, since the proposed circuit stores many embeddings inside one quantum register simultaneously.
Cite
@article{arxiv.2306.15295,
title = {Synthesis of Quantum Vector Databases Based on Grovers Algorithm},
author = {Cesar Borisovich Pronin and Andrey Vladimirovich Ostroukh},
journal= {arXiv preprint arXiv:2306.15295},
year = {2023}
}
Comments
12 pages, 11 figures, Accepted as part of publication "Environmental, Social, and Corporate Governance Perspectives in Development of Quantum Vector Databases Based on Grover's Algorithm" in IEEE Conference "2023 Intelligent technologies and electronic devices in vehicle and road transport complex (TIRVED-2023)"