scientific article
From MaRDI portal
Publication:3002763
DOI10.4086/toc.2006.v002a001zbMath1213.68289arXivquant-ph/0409116OpenAlexW2887468738MaRDI QIDQ3002763
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0409116
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (13)
On the black-box complexity of Sperner's Lemma ⋮ Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas ⋮ All Classical Adversary Methods are Equivalent for Total Functions ⋮ Optimality proofs of quantum weight decision algorithms ⋮ On the power of non-adaptive learning graphs ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems ⋮ Kolmogorov complexity and combinatorial methods in communication complexity ⋮ Quantum counterfeit coin problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Evaluation of exact quantum query complexities by semidefinite programming ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound
This page was built for publication:
