A full characterization of quantum advice
type: Item
instance of: scholarly article
title: A full characterization of quantum advice
zbMATH Open document ID: 1293.68131
DOI: 10.1145/1806689.1806710
author: Scott Aaronson
author: Andrew Drucker
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 6330052
zbMATH Keywords: quantum advice
zbMATH Keywords: boosting
zbMATH Keywords: compression
zbMATH Keywords: Karp-Lipton theorem
zbMATH Keywords: learning
zbMATH Keywords: local Hamiltonians
zbMATH Keywords: nonuniform computation
zbMATH Keywords: quantum computation
MaRDI profile type: Publication
OpenAlex ID: W2079270133
Wikidata QID: Q130925558
Recommended article: A Full Characterization of Quantum Advice
Recommended article: Polynomial time quantum computation with advice
Recommended article: Advice Coins for Classical and Quantum Computation
Recommended article: Mathematical Foundations of Computer Science 2004
Recommended article: Quantum Search with Advice
Recommended article: Q6059367
Recommended article: Limitations of Quantum Advice and One-Way Communication
Recommended article: One-way reversible and quantum finite automata with advice
Recommended article: Quantum online algorithms with respect to space and advice complexity
description: scientific article; zbMATH DE number 6330052