default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoward Barnum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Howard Barnum, Matthew A. Graydon, Alexander Wilce:
Locally Tomographic Shadows (Extended Abstract). QPL 2023: 47-57- 2020
- [j6]Howard Barnum
, Matthew A. Graydon, Alexander Wilce:
Composites and Categories of Euclidean Jordan Algebras. Quantum 4: 359 (2020)
2010 – 2019
- 2017
- [j5]Howard Barnum, Ciarán M. Lee, Carlo Maria Scandolo, John H. Selby:
Ruling out Higher-Order Interference from Purity Principles. Entropy 19(6): 253 (2017) - 2015
- [c7]Howard Barnum, Jonathan Barrett, Marius Krumm, Markus P. Müller:
Entropy, majorization and thermodynamics in general probabilistic theories. QPL 2015: 43-58 - [c6]Howard Barnum, Matthew A. Graydon, Alexander Wilce:
Some Nearly Quantum Theories. QPL 2015: 59-70 - 2013
- [j4]Howard Barnum, Ross Duncan, Alexander Wilce:
Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational Models. J. Philos. Log. 42(3): 501-523 (2013)
2000 – 2009
- 2008
- [c5]Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer, Ben Toner:
Nonclassicality without entanglement enables bit commitment. ITW 2008: 386-390 - [c4]Howard Barnum, Alexander Wilce:
Information Processing in Convex Operational Theories. QPL/DCM@ICALP 2008: 3-15 - 2007
- [i6]Howard Barnum:
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. CoRR abs/quant-ph/0703141 (2007) - 2006
- [i5]Howard Barnum:
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. Algorithms and Complexity for Continuous Problems 2006 - 2004
- [j3]Xiaoyu Li, Howard Barnum:
Quantum Authentication Using Entangled States. Int. J. Found. Comput. Sci. 15(4): 609-617 (2004) - [j2]Howard Barnum, Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci. 69(2): 244-258 (2004) - 2003
- [c3]Howard Barnum, Michael E. Saks, Mario Szegedy:
Quantum query complexity and semi-definite programming. CCC 2003: 179-193 - 2002
- [c2]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. FOCS 2002: 449-458 - [i4]Howard Barnum, Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions. CoRR quant-ph/0201007 (2002) - [i3]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. CoRR quant-ph/0205128 (2002) - [i2]Howard Barnum, Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions. Electron. Colloquium Comput. Complex. TR02 (2002) - [i1]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. IACR Cryptol. ePrint Arch. 2002: 82 (2002) - 2000
- [j1]Howard Barnum, Emanuel Knill, Michael Nielsen:
On quantum fidelities and channel capacities. IEEE Trans. Inf. Theory 46(4): 1317-1329 (2000)
1990 – 1999
- 1999
- [c1]Lee Spector, Howard Barnum, Herbert J. Bernstein, Nikhil Swamy:
Finding a better-than-classical quantum AND/OR algorithm using genetic programming. CEC 1999: 2239-2246
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
