Howard Barnum

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