RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Quantum Query Algorithms are Completely Bounded Forms

January 8, 2018 - 11:00am
Speaker: 
Srinivasan Arunachalam
Institution: 
CWI, Amsterdam

We prove a characterization of t-query quantum algorithms in terms of the unit ball of a space of degree-2t polynomials. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query complexity, answering a question of Aaronson et al. (CCC’16). Our proof is based on a fundamental result of Christensen and Sinclair'87 that generalizes the well-known Stinespring representation for quantum channels to multilinear forms. Using our characterization, we show that many polynomials of degree four are far from those coming from two-query quantum algorithms. We also give a simple and short proof of one of the results of Aaronson et al. showing an equivalence between one-query quantum algorithms and bounded quadratic polynomials.
Joint work with Jop Briet and Carlos Palazuelos.

CSS 3100A