Quick Navigation

Topics

Quantum Machine Learning Quantum Simulation

High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study

arXiv
Authors: Hristo Tonchev, Petar Danev

Year

2021

Paper ID

41421

Status

Preprint

Abstract Read

~2 min

Abstract Words

84

Citations

N/A

Abstract

In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #41421 #67310 Women for Quantum -- Manifesto ... #67285 Assessing the Role of Communica... #67354 Realizing triality and $p$-alit... #67352 Lieb-Schultz-Mattis Theorem wit...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.