scientific article; zbMATH DE number 5485521

MaRDI QIDQ3549690zbMATH OpenFDO

Authors Ben Reichardt, Robert Špalek

Publication date 5 January 2009

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cited in

(8)

• Fourier concentration from shrinkage
• On exact quantum query complexity
• A stronger LP bound for formula size lower bounds via clique constraints
• Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
• A strong direct product theorem for quantum query complexity
• Span-program-based quantum algorithm for evaluating unbalanced formulas
• Quantum search with variable times
• Fourier 1-norm and quantum speed-up

This page was built for publication:

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