Robustness of quantum random walk search with multi-phase matching

DOI10.1007/S11128-025-04736-3MaRDI QIDQ6947428zbMATH OpenFDO

Authors

Publication date 5 August 2025

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-025-04736-3

zbMATH Keywords

generalized Householder reflectionlogistic regressionquantum algorithmsquantum informationquantum searchquantum walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Quantum computation (81P68)

Cites work

• A new kind of universal and flexible quantum information splitting scheme with multi-coin quantum walks
• 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
• Classical irregular blocks, Hill's equation and PT-symmetric periodic complex potentials
• Decoherence in quantum walks – a review
• Optimizing the walk coin in the quantum random walk search algorithm
• Quantum Algorithms for the Triangle Problem
• Quantum key distribution with quantum walks
• Quantum walk public-key cryptographic system
• Quantum walks in an array of quantum dots

This page was built for publication: Robustness of quantum random walk search with multi-phase matching

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