Fast quantum search of multiple vertices based on electric circuits
From MaRDI portal
Publication:2107944
DOI10.1007/S11128-022-03519-4OpenAlexW4229067763MaRDI QIDQ2107944FDOQ2107944
Authors: Tingting Ji, Naiqiao Pan, Tian Chen, Xiangdong Zhang 
Publication date: 5 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03519-4
Recommendations
- Adjacent vertices can be hard to find by quantum walks
- Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system
- Adjacent vertices can be hard to find by quantum walks
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk
- Quantum walk search through potential barriers
Cites Work
- Title not available (Why is that?)
- Exponential algorithmic speedup by a quantum walk
- Physical implementation of quantum walks
- Spatial search and the Dirac equation
- Quantum walks on graphs
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Spatial search on a honeycomb network
- An example of the difference between quantum and classical random walks
- Quantum walks and search algorithms
Cited In (1)
This page was built for publication: Fast quantum search of multiple vertices based on electric circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107944)
