Quantum lower bounds for approximate counting via Laurent polynomials
S Aaronson, R Kothari, W Kretschmer… - arXiv preprint arXiv …, 2019 - arxiv.org
We study quantum algorithms that are given access to trusted and untrusted quantum
witnesses. We establish strong limitations of such algorithms, via new techniques based on …
witnesses. We establish strong limitations of such algorithms, via new techniques based on …
The approximate degree of bipartite perfect matching
G Beniamini - arXiv preprint arXiv:2004.14318, 2020 - arxiv.org
The approximate degree of a Boolean function is the least degree of a real multilinear
polynomial approximating it in the $\ell_\infty $-norm over the Boolean hypercube. We show …
polynomial approximating it in the $\ell_\infty $-norm over the Boolean hypercube. We show …
Inherently quantum lower bounds on computational complexity
WW Kretschmer - 2023 - repositories.lib.utexas.edu
Computational complexity theory is usually phrased in terms of decision problems and
Boolean functions, whose inputs and outputs are purely classical. However, many quantum …
Boolean functions, whose inputs and outputs are purely classical. However, many quantum …
[PDF][PDF] A Complete Bibliography of ACM Transactions on Computation Theory (ToCT)
NHF Beebe - 2024 - ctan.math.utah.edu
A Complete Bibliography of ACM Transactions on Computation Theory (ToCT) Page 1 A
Complete Bibliography of ACM Transactions on Computation Theory (ToCT) Nelson HF …
Complete Bibliography of ACM Transactions on Computation Theory (ToCT) Nelson HF …