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

Howard Barnum. Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. In Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub, editors, Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006. Volume 06391 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [doi]

Authors

Howard Barnum

This author has not been identified. Look up 'Howard Barnum' in Google