BQP and the polynomial hierarchy
type: Item
instance of: scholarly article
title: BQP and the polynomial hierarchy
zbMATH Open document ID: 1293.68130
DOI: 10.1145/1806689.1806711
author: Scott Aaronson
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q12
zbMATH DE Number: 6330053
zbMATH Keywords: constant-depth circuits
zbMATH Keywords: Fourier analysis
zbMATH Keywords: Linial-Nisan conjecture
zbMATH Keywords: quantum complexity classes
Wikidata QID: Q56387576
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/1806689.1806711
OpenAlex ID: W2000070319
DBLP publication ID: conf/stoc/Aaronson10
description: scientific article; zbMATH DE number 6330053