Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
From MaRDI portal
Publication:2239653
Recommendations
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- An example of the difference between quantum and classical random walks
- Automata, Languages and Programming
- Exponential algorithmic speedup by a quantum walk
- Graph matching using the interference of continuous-time quantum walks
- Periodicity of the discrete-time quantum walk on a finite graph
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithms for the Triangle Problem
- Quantum algorithms revisited
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum walks on Cayley graphs
- The discrete-time quaternionic quantum walk on a graph
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)