Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation

DOI10.1007/s10773-021-04861-6OpenAlexW3175732408MaRDI QIDQ2239653

Jinlei Zhang, Yumin Dong, Zhixin Liu

Publication date: 5 November 2021

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-021-04861-6

zbMATH Keywords

graph theoryregular graphquantum algorithmquantum circuit

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete-time quaternionic quantum walk on a graph
• Graph matching using the interference of continuous-time quantum walks
• An example of the difference between quantum and classical random walks
• A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
• Quantum walks on Cayley graphs
• Exponential algorithmic speedup by a quantum walk
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Periodicity of the Discrete-time Quantum Walk on a Finite Graph
• A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
• Quantum Algorithms for the Triangle Problem
• Automata, Languages and Programming

This page was built for publication: Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation