scientific article
From MaRDI portal
Publication:3396568
zbMath1169.68436arXivquant-ph/0509153MaRDI QIDQ3396568
Publication date: 19 September 2009
Full work available at URL: https://arxiv.org/abs/quant-ph/0509153
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (8)
Nonadaptive quantum query complexity ⋮ From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm ⋮ The quantum query complexity of learning multilinear polynomials ⋮ Improved quantum query algorithms for triangle detection and associativity testing ⋮ Adversary lower bounds for nonadaptive quantum algorithms ⋮ Extended learning graphs for triangle finding ⋮ Evaluation of exact quantum query complexities by semidefinite programming ⋮ On exact quantum query complexity
This page was built for publication:
