scientific article
From MaRDI portal
Publication:3002780
DOI10.4086/toc.2007.v003a004zbMath1213.68312OpenAlexW2156954419MaRDI QIDQ3002780
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Unnamed Item ⋮ The BQP-hardness of approximating the Jones polynomial
This page was built for publication:
