Howard Barnum
https://orcid.org/0000-0003-2336-6147
https://www.wikidata.org/entity/Q51628393
https://d-nb.info/gnd/171189612
Howard Barnum
Matthew A. Graydon
Alexander Wilce
Locally Tomographic Shadows (Extended Abstract).
QPL
2023
47-57
journals/corr/abs-2308-15489
https://doi.org/10.4204/EPTCS.384.3
https://doi.org/10.48550/arXiv.2308.16494
db/series/eptcs/eptcs384.html#abs-2308-16494
Howard Barnum
Matthew A. Graydon
Alexander Wilce
Composites and Categories of Euclidean Jordan Algebras.
359
2020
4
Quantum
https://doi.org/10.22331/q-2020-11-08-359
https://www.wikidata.org/entity/Q114043390
db/journals/quantum/quantum4.html#BarnumGW20
Howard Barnum
Ciarán M. Lee
Carlo Maria Scandolo
John H. Selby
Ruling out Higher-Order Interference from Purity Principles.
253
2017
19
Entropy
6
https://doi.org/10.3390/e19060253
https://www.wikidata.org/entity/Q62117280
db/journals/entropy/entropy19.html#BarnumLSS17
Howard Barnum
Jonathan Barrett
Marius Krumm
Markus P. Müller
Entropy, majorization and thermodynamics in general probabilistic theories.
QPL
2015
43-58
journals/corr/HeunenSV15
https://doi.org/10.4204/EPTCS.195.4
https://doi.org/10.48550/arXiv.1508.03107
db/series/eptcs/eptcs195.html#abs-1508-03107
Howard Barnum
Matthew A. Graydon
Alexander Wilce
Some Nearly Quantum Theories.
QPL
2015
59-70
journals/corr/HeunenSV15
https://doi.org/10.4204/EPTCS.195.5
https://doi.org/10.48550/arXiv.1507.06278
db/series/eptcs/eptcs195.html#abs-1507-06278
Howard Barnum
Ross Duncan
Alexander Wilce
Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational Models.
501-523
2013
42
J. Philos. Log.
3
https://doi.org/10.1007/s10992-013-9280-8
https://www.wikidata.org/entity/Q62117287
db/journals/jphil/jphil42.html#BarnumDW13
Howard Barnum
Oscar C. O. Dahlsten
Matthew Leifer
Ben Toner
Nonclassicality without entanglement enables bit commitment.
386-390
2008
ITW
https://doi.org/10.1109/ITW.2008.4578692
https://www.wikidata.org/entity/Q62117293
conf/itw/2008
db/conf/itw/itw2008.html#BarnumDLT08
Howard Barnum
Alexander Wilce
Information Processing in Convex Operational Theories.
3-15
2008
conf/qpl/2008
QPL/DCM@ICALP
https://doi.org/10.1016/j.entcs.2011.01.002
https://www.wikidata.org/entity/Q62117289
db/conf/qpl/qpldcm2008.html#BarnumW11
Howard Barnum
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
http://arxiv.org/abs/quant-ph/0703141
2007
CoRR
abs/quant-ph/0703141
db/journals/corr/corr0703.html#abs-quant-ph-0703141
Howard Barnum
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries.
2006
Algorithms and Complexity for Continuous Problems
http://drops.dagstuhl.de/opus/volltexte/2007/876
conf/dagstuhl/2006P6391
db/conf/dagstuhl/P6391.html#Barnum06
Xiaoyu Li
Howard Barnum
Quantum Authentication Using Entangled States.
609-617
2004
15
Int. J. Found. Comput. Sci.
4
https://doi.org/10.1142/S0129054104002649
https://www.wikidata.org/entity/Q62117308
db/journals/ijfcs/ijfcs15.html#LiB04
Howard Barnum
Michael E. Saks
A lower bound on the quantum query complexity of read-once functions.
244-258
2004
69
J. Comput. Syst. Sci.
2
https://doi.org/10.1016/j.jcss.2004.02.002
https://www.wikidata.org/entity/Q62117306
db/journals/jcss/jcss69.html#BarnumS04
Howard Barnum
Michael E. Saks
Mario Szegedy
Quantum query complexity and semi-definite programming.
179-193
2003
conf/coco/2003
CCC
https://doi.org/10.1109/CCC.2003.1214419
https://doi.ieeecomputersociety.org/10.1109/CCC.2003.1214419
db/conf/coco/coco2003.html#BarnumSS03
Howard Barnum
Claude Crépeau
Daniel Gottesman
Adam D. Smith
Alain Tapp
Authentication of Quantum Messages.
449-458
2002
conf/focs/2002
FOCS
https://doi.org/10.1109/SFCS.2002.1181969
https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181969
db/conf/focs/focs2002.html#BarnumCGST02
Howard Barnum
Michael E. Saks
A lower bound on the quantum query complexity of read-once functions
http://arxiv.org/abs/quant-ph/0201007
2002
CoRR
quant-ph/0201007
db/journals/corr/corr0201.html#quant-ph-0201007
Howard Barnum
Claude Crépeau
Daniel Gottesman
Adam D. Smith
Alain Tapp
Authentication of Quantum Messages
http://arxiv.org/abs/quant-ph/0205128
2002
CoRR
quant-ph/0205128
db/journals/corr/corr0205.html#quant-ph-0205128
Howard Barnum
Michael E. Saks
A lower bound on the quantum query complexity of read-once functions
Electron. Colloquium Comput. Complex.
2002
TR02
TR02-002
db/journals/eccc/eccc9.html#ECCC-TR02-002
https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-002/index.html
Howard Barnum
Claude Crépeau
Daniel Gottesman
Adam D. Smith
Alain Tapp
Authentication of Quantum Messages.
82
2002
2002
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2002/082
db/journals/iacr/iacr2002.html#BarnumCGST02
Howard Barnum
Emanuel Knill
Michael Nielsen 0002
On quantum fidelities and channel capacities.
1317-1329
2000
46
IEEE Trans. Inf. Theory
4
db/journals/tit/tit46.html#BarnumKN00
https://doi.org/10.1109/18.850671
https://www.wikidata.org/entity/Q55193756
Lee Spector
Howard Barnum
Herbert J. Bernstein
Nikhil Swamy
Finding a better-than-classical quantum AND/OR algorithm using genetic programming.
2239-2246
1999
CEC
https://doi.org/10.1109/CEC.1999.785553
https://www.wikidata.org/entity/Q62117327
conf/cec/1999
db/conf/cec/cec1999.html#SpectorBBS99
Jonathan Barrett
Herbert J. Bernstein
Claude Crépeau
Oscar C. O. Dahlsten
Ross Duncan
Daniel Gottesman
Matthew A. Graydon
Emanuel Knill
Marius Krumm
Ciarán M. Lee
Matthew Leifer
Xiaoyu Li
Markus P. Müller
Michael Nielsen 0002
Michael E. Saks
Carlo Maria Scandolo
John H. Selby
Adam D. Smith
Lee Spector
Nikhil Swamy
Mario Szegedy
Alain Tapp
Ben Toner
Alexander Wilce