scientific article; zbMATH DE number 2038718

zbMath1039.68056MaRDI QIDQ4449183

Peter Høyer, Michele Mosca, Ronald de Wolf

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190291.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (22)

A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs ⋮ Hardness Amplification and the Approximate Degree of Constant-Depth Circuits ⋮ Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas ⋮ Quantum algorithm for Dyck language with multiple types of brackets ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ Improved algorithms for quantum identification of Boolean oracles ⋮ Quantum Walk Based Search Algorithms ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Near-optimal quantum algorithms for string problems ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ Quantum search with variable times ⋮ On the robustness of bucket brigade quantum RAM ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ Quantum pattern matching fast on average ⋮ Polynomial degree vs. quantum query complexity ⋮ Provable dual attacks on learning with errors ⋮ Extended learning graphs for triangle finding ⋮ Claw finding algorithms using quantum walk ⋮ Quantum algorithms for string processing ⋮ Dual lower bounds for approximate degree and Markov-Bernstein inequalities ⋮ Quantum walks can find a marked element on any graph

This page was built for publication: