Sciweavers

Share
DAGSTUHL
2006

Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries

9 years 22 days ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such black box functions, we investigate a more general quantum query model in which the goal is to compute functions of N
Howard Barnum
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where DAGSTUHL
Authors Howard Barnum
Comments (0)
books