Modeling two-qubit Grover’s algorithm implementation in a linear optical chip

Samsonov, Eduard; Kiselev, Fedor; Shmelev, Yaroslav; Egorov, V. I.; Goncharov, R. K.; Santev, A.A.; Pervushin, B. E.; Gleim, A.V.

doi:10.1088/1402-4896/ab6523

Cited by 6 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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 [15] and low-scale prototype implementations on current quantum hardware [16], a really important field of research lies in the scalable generation of Grover oracles and quantum oracles for black box algorithms in general [14].…”

Section: Overview and Backgroundmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Overview and Backgroundmentioning

confidence: 99%

“…14 According to [38] a logical qubit of a circuit of order m in fault tolerant implementation (using the punctured Reed-Muller Code) requires (up to) 2 m+2 − 1 physical qubits. 15 SymPy CAS: www.sympy.org, as of 3 August 2021.…”

Section: Cse Synthesismentioning

confidence: 99%

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

show abstract

“…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%

“…Therefore the values of the entries of φ are integer multiples of ± π N . This implies that if we want to encode an array with N entries, we will need reliant π N RZ gates 13 are. As this quantity will be central in the upcoming discussion, we will refer to the T -order of a circuit by the minimal number m ∈ N, such that every phase gate can be expressed as an integer multiple of a π 2 m phase gate 14 .…”

Section: Cse Synthesismentioning

confidence: 99%

“…This will give a sequence of intermediate values which reduce the overall resources required for the evaluation of f . For example, given the truth table 13 According to [35] it is possible to implement RZ gates virtually without any error and duration, however this might not be the case for every physical qubit realization 14 According to [36] a logical qubit of a circuit of order m in fault tolerant implementation (using the punctured Reed-Muller Code) requires (up to) 2 m+2 − 1 physical qubits 15…”

Section: Cse Synthesismentioning

confidence: 99%

See 1 more Smart Citation

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures

Seidel¹,

Becker²,

Böck³

et al. 2021

Preprint

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