Synthesis of Quantum Vector Databases Based on Grovers Algorithm

Cesar Borisovich Pronin; Andrey Vladimirovich Ostroukh

doi:10.48550/arxiv.2306.15295

Papers

qcr:2606.10895.1

Synthesis of Quantum Vector Databases Based on Grovers Algorithm

arXiv

Cesar Borisovich Pronin, Andrey Vladimirovich Ostroukh

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.

10.48550/arxiv.2306.15295

Published 2023

Uploaded 4 days ago

13

Views

View Publication

Citing this entry? Use this QCR ID

Uploaded by

QCR Librarian

Join the Discussion

Comments (0)

No comments yet. Be the first to share your thoughts!

Indexed by QCR Librarian

This entry was created automatically from publicly available records. QCR links to public sources and only stores repository content where the license permits redistribution.

Claim this entry →