scientific article
From MaRDI portal
Publication:3002755
DOI10.4086/toc.2005.v001a002zbMath1213.68286OpenAlexW103828875MaRDI QIDQ3002755
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2005.v001a002
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) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (14)
The quantum query complexity of the abelian hidden subgroup problem ⋮ Near-optimal quantum algorithms for string problems ⋮ On the Power of Statistical Zero Knowledge ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ Unnamed Item ⋮ Algorithmic Polynomials ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Element distinctness revisited ⋮ Quantum algorithm for the multicollision problem ⋮ Oracle separations between quantum and non-interactive zero-knowledge classes ⋮ Polynomial degree vs. quantum query complexity ⋮ Quantum algorithm to find invariant linear structure of \(MD\) hash functions ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: