scientific article
From MaRDI portal
Publication:2921783
zbMath1297.68078MaRDI QIDQ2921783
Miklos Santha, Mario Szegedy, Frédéric Magniez
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (13)
Quantum algorithms for matching problems ⋮ Quantum Walks ⋮ A note on the search for \(k\) elements via quantum walk ⋮ Improved algorithms for quantum identification of Boolean oracles ⋮ Quantum walk mixing is faster than classical on periodic lattices ⋮ Search on vertex-transitive graphs by lackadaisical quantum walk ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Line ordering of reversible circuits for linear nearest neighbor realization ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Quantum mixing of Markov chains for special distributions ⋮ Polynomial degree vs. quantum query complexity ⋮ The quantum query complexity of the determinant ⋮ Quantum walks with memory on cycles
This page was built for publication:
