Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum Optimization

Partition of graphs and quantum walk based search algorithms

arXiv
Authors: Yusuke Ide

Year

2018

Paper ID

22678

Status

Preprint

Abstract Read

~2 min

Abstract Words

65

Citations

N/A

Abstract

In this paper, we show reduction methods for search algorithms on graphs using quantum walks. By using a graph partitioning method called equitable partition for the the given graph, we determine "effective subspace" for the search algorithm to reduce the size of the problem. We introduce the equitable partition for quantum walk based search algorithms and show how to determine "effective subspace" and reduced operator.

Why This Paper Matters

  • This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
  • It adds a 2018 reference point for readers tracking recent quantum research.
  • In this paper, we show reduction methods for search algorithms on graphs using quantum walks.

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.

Become a member Sign in
Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1812.06376 [2] arXiv https://arxiv.org/abs/1812.06376 [3] Publisher https://arxiv.org/abs/1812.06376

Local Citation Graph (Related-Paper Links)

Current Paper #22678

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.