Computer Scientist’s and Programmer’s View on Quantum Algorithms: Mapping Functions’ APIs and Inputs to Oracles

Gheorghe-Pop, Ilie-Daniel; Tcholtchev, Nikolay; Ritter, Tom; Hauswirth, Manfred

doi:10.1007/978-3-030-80119-9_9

Cited by 4 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…int grover(int [] list to search in, int value to search for)). The motivation for this research is based on observations in our previous work [12], in which the issues of constructing oracles for Grover database searches was discussed from a user perspective. Indeed, the only way to make quantum computing commercially viable is to provide accessible interfaces for programmers and end users to integrate quantum algorithms in their services and applications.…”

Section: Discussionmentioning

confidence: 99%

“…The focus of the research presented in this paper relates to the scalable synthesis of quantum oracles used in the context of Grover database search. The need for automatic oracle generation for Grover's algorithm was extensively discussed in one of our previous research works [12]. After a thorough analysis, [12] clearly states that there is a paramount requirement for automatically generated oracles as inputs for Grover's algorithm, in order to be able to provide function/procedure APIs (Application Programming Interfaces) to developers and that way seamlessly integrate quantum computing into existing software development projects (e.g.…”

Section: A General Remarksmentioning

confidence: 99%

“…These activities and related results are of particular importance for our approach to the automated generation of Grover quantum oracles. Besides specific applications for Grover's algorithm, proof of concepts for experimental realizations [13] and low-scale prototype implementations on current quantum hardware [14], a really important field of research lies in the scalable generation of Grover oracles and quantum oracles for black box algorithms in general [12].…”

Section: Overview and Backgroundmentioning

confidence: 99%

“…For example if we query for the label 000000, the label 011111 would receive the same amplification as 100000. This can be explained by looking at equation (12). If l(e q ) and l(e) differ on every single entry, we have…”

Section: Similarity Searchmentioning

confidence: 99%

“…As the space of parity operators is the dual space for the vector space F n 2 , it can be indexed by the natural numbers < 2 n . Finding a parity operator traversal route therefore reduces to finding a solution to an integer programming 12 traveling salesman problem [33]. The restricting feature here is, that we need one CNOT gate per bit that is changed in a traversal step.…”

Section: Parity Operator Traversalmentioning

confidence: 99%

See 4 more Smart Citations

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures

Seidel¹,

Becker²,

Böck³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The steadily growing research interest in quantum computing -together with the accompanying technological advances in the realization of quantum hardware -fuels the development of meaningful real-world applications, as well as implementations for well-known quantum algorithms. One of the most prominent examples till today is Grover's algorithm, which can be used for efficient search in unstructured databases. Quantum oracles that are frequently masked as black boxes play an important role in Grover's algorithm. Hence, the automatic generation of oracles is of paramount importance. Moreover, the automatic generation of the corresponding circuits for a Grover quantum oracle is deeply linked to the synthesis of reversible quantum logic, which -despite numerous advances in the field -still remains a challenge till today in terms of synthesizing efficient and scalable circuits for complex boolean functions.In this paper, we present a flexible method for automatically encoding unstructured databases into oracles, which can then be efficiently searched with Grover's algorithm. Furthermore, we develop a tailor-made method for quantum logic synthesis, which vastly improves circuit complexity over other current approaches. Finally, we present another logic synthesis method that considers the requirements of scaling onto real world backends. We compare our method with other approaches through evaluating the oracle generation for random databases and analyzing the resulting circuit complexities using various metrics.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: A General Remarksmentioning

confidence: 99%

Section: Overview and Backgroundmentioning

confidence: 99%

Section: Similarity Searchmentioning

confidence: 99%

Section: Parity Operator Traversalmentioning

confidence: 99%

See 3 more Smart Citations

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures

Seidel¹,

Becker²,

Böck³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

The quantum frontier of software engineering: A systematic mapping study

De Stefano,

Pecorelli,

Di Nucci

et al. 2024

Information and Software Technology

View full text Add to dashboard Cite

Automatic generation of Grover quantum oracles for arbitrary data structures

Seidel

Becker

Bock

et al. 2023

Quantum Sci. Technol.

View full text Add to dashboard Cite

The steadily growing research interest in quantum computing - together with the accompanying technological advances in the realization of quantum hardware - fuels the development of meaningful real-world applications, as well as implementations for well-known quantum algorithms. One of the most prominent examples till today is Grover's algorithm, which can be used for efficient search in unstructured databases. Quantum oracles that are frequently masked as black boxes play an important role in Grover's algorithm. Hence, the automatic generation of oracles is of paramount importance. Moreover, the automatic generation of the corresponding circuits for a Grover quantum oracle is deeply linked to the synthesis of reversible quantum logic, which - despite numerous advances in the field - still remains a challenge till today in terms of synthesizing efficient and scalable circuits for complex boolean functions. In this paper, we present a flexible method for automatically encoding unstructured databases into oracles, which can then be efficiently searched with Grover's algorithm. Furthermore, we develop a tailor-made method for quantum logic synthesis, which vastly improves circuit complexity over other current approaches. Finally, we present another logic synthesis method that considers the requirements of scaling onto real world backends. We compare our method with other approaches through evaluating the oracle generation for random databases and analyzing the resulting circuit complexities using various metrics.

show abstract

Computer Scientist’s and Programmer’s View on Quantum Algorithms: Mapping Functions’ APIs and Inputs to Oracles

Cited by 4 publications

References 27 publications

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures

The quantum frontier of software engineering: A systematic mapping study

Automatic generation of Grover quantum oracles for arbitrary data structures

Contact Info

Product

Resources

About