Fast quantum search of multiple vertices based on electric circuits

DOI10.1007/S11128-022-03519-4MaRDI QIDQ2107944zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Quantum computation (81P68)

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

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• An example of the difference between quantum and classical random walks
• Exponential algorithmic speedup by a quantum walk
• Physical implementation of quantum walks
• Quantum walks and search algorithms
• Quantum walks on graphs
• Spatial search and the Dirac equation
• Spatial search by continuous-time quantum walk with multiple marked vertices
• Spatial search on a honeycomb network

Cited in

(2)

• Circuit realization of topological physics
• Exciton-mediated quantum search on a star graph

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)