scientific article
From MaRDI portal
Publication:3396568
zbMATH Open1169.68436arXivquant-ph/0509153MaRDI QIDQ3396568FDOQ3396568
Authors: Peter Høyer, Robert Špalek 
Publication date: 19 September 2009
Full work available at URL: https://arxiv.org/abs/quant-ph/0509153
Title of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (9)
- On exact quantum query complexity
- Adversary lower bounds for nonadaptive quantum algorithms
- The quantum query complexity of learning multilinear polynomials
- Evaluation of exact quantum query complexities by semidefinite programming
- Improved quantum query algorithms for triangle detection and associativity testing
- Nonadaptive quantum query complexity
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Extended learning graphs for triangle finding
- On query complexity measures and their relations for symmetric functions
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 Q3396568)
