scientific article; zbMATH DE number 5485521

zbMATH Open1231.68131MaRDI QIDQ3549690FDOQ3549690

Authors: Ben Reichardt, Robert Špalek 

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

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)