Howard Barnum

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 3

Top Topics

Quantum Computing

Distributive Lattices

Extended Abstract

Top Venues

J. Philos. Log.

Publications

Howard Barnum, Matthew A. Graydon, Alexander Wilce
Locally Tomographic Shadows (Extended Abstract). QPL (2023)
Howard Barnum, Matthew A. Graydon, Alexander Wilce
Composites and Categories of Euclidean Jordan Algebras. Quantum 4 (2020)
Howard Barnum, Ciarán M. Lee, Carlo Maria Scandolo, John H. Selby
Ruling out Higher-Order Interference from Purity Principles. Entropy 19 (6) (2017)
Howard Barnum, Jonathan Barrett, Marius Krumm, Markus P. Müller
Entropy, majorization and thermodynamics in general probabilistic theories. QPL (2015)
Howard Barnum, Matthew A. Graydon, Alexander Wilce
Some Nearly Quantum Theories. QPL (2015)
Howard Barnum, Ross Duncan, Alexander Wilce
Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational Models. J. Philos. Log. 42 (3) (2013)
Howard Barnum, Alexander Wilce
Information Processing in Convex Operational Theories. Electron. Notes Theor. Comput. Sci. 270 (1) (2011)
Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer, Ben Toner
Nonclassicality without entanglement enables bit commitment. ITW (2008)
Howard Barnum
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries CoRR (2007)
Howard Barnum
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. Algorithms and Complexity for Continuous Problems (2006)
Xiaoyu Li, Howard Barnum
Quantum Authentication Using Entangled States. Int. J. Found. Comput. Sci. 15 (4) (2004)
Howard Barnum, Michael E. Saks
A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci. 69 (2) (2004)
Howard Barnum, Michael E. Saks, Mario Szegedy
Quantum query complexity and semi-definite programming. Computational Complexity Conference (2003)
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
Authentication of Quantum Messages. IACR Cryptol. ePrint Arch. 2002 (2002)
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
Authentication of Quantum Messages. FOCS (2002)
Howard Barnum, Michael E. Saks
A lower bound on the quantum query complexity of read-once functions Electron. Colloquium Comput. Complex. (002) (2002)
Howard Barnum, Michael E. Saks
A lower bound on the quantum query complexity of read-once functions CoRR (2002)
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
Authentication of Quantum Messages CoRR (2002)
Howard Barnum, Emanuel Knill, Michael Nielsen
On quantum fidelities and channel capacities. IEEE Trans. Inf. Theory 46 (4) (2000)
Lee Spector, Howard Barnum, Herbert J. Bernstein, Nikhil Swamy
Finding a better-than-classical quantum AND/OR algorithm using genetic programming. CEC (1999)