A full characterization of quantum advice

DOI10.1145/1806689.1806710MaRDI QIDQ2875139zbMATH OpenOpenAlexWikidataFDO

Authors Scott Aaronson, Andrew Drucker

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

boostingcompressionKarp-Lipton theoremlearninglocal Hamiltoniansnonuniform computationquantum advicequantum computation

Mathematics Subject Classification ID

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

Recommendations

• A full characterization of quantum advice
• Polynomial time quantum computation with advice
• Advice coins for classical and quantum computation
• Mathematical Foundations of Computer Science 2004
• Quantum search with advice
• scientific article; zbMATH DE number 7759460
• Limitations of Quantum Advice and One-Way Communication
• Quantum online algorithms with respect to space and advice complexity

Cited in

(3)

• Polynomial time quantum computation with advice
• A full characterization of quantum advice
• Certified randomness from quantum supremacy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875139)