Review Quantum Circuit Synthesis for Grover’s Algorithm Oracle

The search for information in a system has been a continuous problem for a computer. This has resulted in the construction of a set of classical algorithms that can search for a set of data. This is why search systems can be divided into the type of information being searched, the number of solution...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms Ročník 17; číslo 9; s. 382
Hlavní autoři: Naranjo, Miguel A., Fletscher, Luis A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.09.2024
Témata:
Algorithms
Automation
Circuits
Data search
Grover’s algorithm
Hilbert space
Integrated circuits
Mathematical functions
Methods
Neural networks
oracle synthesis
Quantum computing
Quantum physics
Search algorithms
Semiconductor chips
ISSN:1999-4893, 1999-4893
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The search for information in a system has been a continuous problem for a computer. This has resulted in the construction of a set of classical algorithms that can search for a set of data. This is why search systems can be divided into the type of information being searched, the number of solutions to find, and even the terms used for searching. With the emergence of quantum computing, new algorithms have been generated for this type of process. An example is the Grover algorithm, which performs theoretically better than traditional algorithms. This is why there has been research on optimizing it, applying it to new fields, and making it more accessible to industry users. Even if the algorithm is a promising alternative, one of the disadvantages of Grover’s algorithm is the use of an oracle function that must be generated for every set of search data. This review describes three sets of methodologies for generating quantum circuits that can be applied to constructing this oracle quantum circuit.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a17090382