Work

Automatic generation of efficient oracles: The less-than case

Year: 2024

Type: article

Abstract: Grover’s algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence. A fundamental part of this algorithm is the so-called oracle, a quantum circuit that marks the quantum state corresponding to the desired value. In this work we present a classical algorithm that builds an oracle that performs a less-than operation, marking states representing natural numbers smaller than a given one. Results are shown to prove its functionality. This lessthan oracle implementation works on any number of qubits and does not require any ancilla qubits. Regarding depth, the proposed implementation is compared with Qiskit automatic method, Diagonal. We show that the depth of our less-than oracle implementation is always lower. In addition, a comparison with another method for oracle generation in terms of gate count is also conducted to prove the efficiency of our method. The result presented here is part of a research work that aims to achieve reusable quantum operations that can be composed to perform more complex ones.

Source: Journal of Systems and Software

DOI: 10.1016/j.jss.2024.112203

Authors: Javier Sanchez-Rivero, Daniel Talaván, Jose Garcia-Alonso, Antonio Ruiz-Cortés, Juan Manuel Murillo

Institutions: Universidad de Sevilla, Universidad de Extremadura

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,710

Funders: Ministerio de Ciencia, Innovación y Universidades, Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España, Junta de Extremadura