A full characterization of quantum advice

DOI10.1145/1806689.1806710zbMath1293.68131OpenAlexW2079270133WikidataQ130925558 ScholiaQ130925558MaRDI QIDQ2875139

Andrew Drucker, Scott Aaronson

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5574

zbMATH Keywords

learningcompressionquantum computationboostingquantum adviceKarp-Lipton theoremnonuniform computationlocal Hamiltonians

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Certified randomness from quantum supremacy

This page was built for publication: A full characterization of quantum advice