Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
DOI10.1007/S10773-021-04861-6OpenAlexW3175732408MaRDI QIDQ2239653FDOQ2239653
Authors: Yumin Dong, Zhixin Liu, Jinlei Zhang 
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
Recommendations
Theory of computing (68Qxx) Graph theory (05Cxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Exponential algorithmic speedup by a quantum walk
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The discrete-time quaternionic quantum walk on a graph
- Quantum algorithms revisited
- Quantum Algorithms for the Triangle Problem
- An example of the difference between quantum and classical random walks
- Title not available (Why is that?)
- Automata, Languages and Programming
- Graph matching using the interference of continuous-time quantum walks
- Periodicity of the discrete-time quantum walk on a finite graph
- Quantum walks on Cayley graphs
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
Cited In (3)
This page was built for publication: Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239653)
