scientific article
From MaRDI portal
Publication:2913817
DOI10.4086/toc.2012.v008a017zbMath1280.68097arXiv0906.4425OpenAlexW1556128349MaRDI QIDQ2913817
Rahul Jain, Greg Kuperberg, Miklos Santha, Iordanis Kerenidis, Shengyu Zhang, Or Sattath
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.4425
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)
Cites Work
This page was built for publication:
