Spectral approach to quantum searching on Markov chains—the complete bipartite graph

被引:0
|
作者
Narknyul Choi
Min-Ho Lee
机构
[1] Kumoh National Institute of Technology,School of Liberal Arts and Teacher Training
来源
关键词
Quantum search; Quantum walk; Absorbing Markov chain; Complete bipartite graph;
D O I
暂无
中图分类号
学科分类号
摘要
Since Grover devised a quantum algorithm for unstructured search, generalization of the algorithm to structured data sets represented by graphs has been an important research topic. The introduction of absorbing marked vertices provided a breakthrough for this problem, and recently it was proved that a quantum walk search algorithm replacing the marked vertices by partially absorbing vertices can find a marked vertex in any reversible Markov chain with any number of marked vertices. However, in contrast, the proof based on the quantum fast-forwarding technique gives little intuition about the underlying mechanism, while the spectral analysis of Grover’s algorithm leads to understanding of the searching mechanism as a rotation in a two-dimensional space. For a spectral approach to the quantum search on Markov chains, we consider as a nontrivial example the complete bipartite graph consisting of two sets X1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X_1$$\end{document} and X2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X_2$$\end{document} and the marked vertices being only in X2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X_2$$\end{document}. By analytically determining the spectral information of the quantum walk, we demonstrate that the quantum algorithm shows quadratic speed-up compared to the corresponding classical search method. And we find that the quantum search is described in terms of a two-state model for that case.
引用
收藏
页码:829 / 841
页数:12
相关论文
共 50 条
  • [1] Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
    Lee, Min-Ho
    [J]. QUANTUM INFORMATION PROCESSING, 2024, 23 (06)
  • [2] Spectral approach to quantum searching on Markov chains-the complete bipartite graph
    Choi, Narknyul
    Lee, Min-Ho
    [J]. JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2023, 83 (11) : 829 - 841
  • [3] Quantum Searching on Markov Chains - The Complete Graph
    Lee, Min-Ho
    Choi, Nark Nyul
    Tanner, Gregor
    [J]. ACTA PHYSICA POLONICA A, 2021, 140 (06) : 538 - 544
  • [4] Quantum counting on the complete bipartite graph
    Bezerra, Gustavo A.
    Santos, Raqueline A. M.
    Portugal, Renato
    [J]. INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2024,
  • [5] Quantum walk search on the complete bipartite graph
    Rhodes, Mason L.
    Wong, Thomas G.
    [J]. PHYSICAL REVIEW A, 2019, 99 (03)
  • [6] Quantum state transfer on the complete bipartite graph
    Santos, Raqueline A. M.
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2022, 55 (12)
  • [7] Spectral analysis of complete graph with infinite chains
    Lebid, V. O.
    [J]. CARPATHIAN MATHEMATICAL PUBLICATIONS, 2014, 6 (01) : 73 - 78
  • [8] Complete Entropic Inequalities for Quantum Markov Chains
    Li Gao
    Cambyse Rouzé
    [J]. Archive for Rational Mechanics and Analysis, 2022, 245 : 183 - 238
  • [9] Complete Entropic Inequalities for Quantum Markov Chains
    Gao, Li
    Rouze, Cambyse
    [J]. ARCHIVE FOR RATIONAL MECHANICS AND ANALYSIS, 2022, 245 (01) : 183 - 238
  • [10] Quantum Markov chains: A unification approach
    Accardi, Luigi
    Souissi, Abdessatar
    Soueidy, El Gheteb
    [J]. INFINITE DIMENSIONAL ANALYSIS QUANTUM PROBABILITY AND RELATED TOPICS, 2020, 23 (02)