Work

Reducing number of gates in quantum random walk search algorithm via modification of coin operators

Year: 2023

Type: article

Abstract: This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier. If an appropriate relation between corresponding parameters is realized, our algorithm becomes more robust to deviations in the phases. In this modification marking coin is not needed, and all advantages from above mentioned optimization to the stability, are preserved. It is shown explicitly how to construct such walk coin in order to obtain more robust quantum algorithm.

Source: Results in Physics

DOI: 10.1016/j.rinp.2023.106327

Authors: Hristo Tonchev, Petar Danev

Institutions: Bulgarian Academy of Sciences, Georgi Nadjakov Institute of Solid State Physics, Institute for Nuclear Research and Nuclear Energy

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,690

Funder: Bulgarian National Science Fund