Howard Barnum - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2020

Composites and Categories of Euclidean Jordan AlgebrasHoward Barnum, Matthew A. Graydon, Alexander Wilce. quantum, 4:359, 2020. [doi]

2017

Ruling out Higher-Order Interference from Purity PrinciplesHoward Barnum, Ciarán M. Lee, Carlo Maria Scandolo, John Selby. entropy, 19(6):253, 2017. [doi]

2013

Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational ModelsHoward Barnum, Ross Duncan, Alexander Wilce. jphil, 42(3):501-523, 2013. [doi]

2011

Information Processing in Convex Operational TheoriesHoward Barnum, Alexander Wilce. ENTCS, 270(1):3-15, 2011. [doi]

2008

Nonclassicality without entanglement enables bit commitmentHoward Barnum, Oscar C. O. Dahlsten, Matthew Leifer, Ben Toner. itw 2008: 386-390 [doi]

2006

Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queriesHoward Barnum. Dagstuhl 2007: [doi]

2004

A lower bound on the quantum query complexity of read-once functionsHoward Barnum, Michael E. Saks. jcss, 69(2):244-258, 2004. [doi]

Quantum Authentication Using Entangled StatesXiaoyu Li, Howard Barnum. ijfcs, 15(4):609-617, 2004. [doi]

2003

Quantum query complexity and semi-definite programmingHoward Barnum, Michael E. Saks, Mario Szegedy. cocoon 2003: 179-193 [doi]

2002

2000

On quantum fidelities and channel capacitiesHoward Barnum, Emanuel Knill, Michael A. Nielsen. TIT, 46(4):1317-1329, 2000.

1999

Finding a better-than-classical quantum AND/OR algorithm using genetic programmingLee Spector, Howard Barnum, Herbert J. Bernstein, Nikhil Swamy. cec 1999: 2239-2246 [doi]

Sign in or sign up to see more results.

runs on WebDSL