Robustness of quantum walk search with neighbors measurement

DOI10.7546/giq-27-2024-53-80MaRDI QIDQ6587977zbMATH OpenFDO

Authors

Publication date 15 August 2024

zbMATH Keywords

quantum informationquantum algorithmsquantum random walkquantum searchgeneralized Householder reflection

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum state spaces, operational and probabilistic concepts (81P16)

Recommendations

• Optimizing the walk coin in the quantum random walk search algorithm
• Robust quantum spatial search
• Search via quantum walks with intermediate measurements
• Quantum walk search with time-reversal symmetry breaking
• Quantum walk search through potential barriers

Cites work

• An introduction to systems biology. Design principles of biological circuits.
• Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
• On the Jacobian group for Möbius ladder and prism graphs
• Optimizing the walk coin in the quantum random walk search algorithm
• Quantum Algorithms for the Triangle Problem
• The classical and quantum mechanics of a particle on a knot

This page was built for publication: Robustness of quantum walk search with neighbors measurement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587977)