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

• Type: Conference
• Year: 2006
• Where: DAGSTUHL
• Authors: Howard Barnum
• Keywords: Black Box, DAGSTUHL 2006, DAGSTUHL 2007, Quantum Query, Quantum Query Complexity