The Space "Just Above" BQP

DOI10.1145/2840728.2840739zbMath1334.68075arXiv1412.6507OpenAlexW1575325906MaRDI QIDQ2800575

Adam Bouland, Mitchell Lee, Scott Aaronson, Joseph Fitzsimons

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.6507

zbMATH Keywords

lower boundquantum computingBQPoracle separationstatistical zero knowledge

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

On the Power of Statistical Zero Knowledge ⋮ Oracles and query lower bounds in generalised probabilistic theories ⋮ Deriving Grover's lower bound from simple physical principles

This page was built for publication: The Space "Just Above" BQP