TY  - JOUR
AU  - Srinivasan Arunachalam
AU  - Jop Briët
AU  - Palazuelos Cabezón, Carlos
PY  - 2019
DO  - 10.1137/18m117563x
SN  - 0097-5397
SN  - 1095-7111
UR  - https://hdl.handle.net/20.500.14352/95983
T2  - SIAM Journal on Computing
AB  - We prove a characterization of  query quantum algorithms in terms of the unit ball of a space of degree  polynomials. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query complexity, answering a...
LA  - eng
M2  - 903
PB  - Society for Industrial and Applied Mathematics
KW  - Quantum algorithms
KW  - Query complexity
KW  - Polynomial method
KW  - Multilinear forms
KW  - Operator space theory
TI  - Quantum Query Algorithms Are Completely Bounded Forms
TY  - journal article
VL  - 48
ER  -