 | 2007 |
|---|
| 10 |       | Howard Barnum:
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
CoRR abs/quant-ph/0703141: (2007) |
| 2006 |
|---|
| 9 | | Howard Barnum:
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries.
Algorithms and Complexity for Continuous Problems 2006 |
| 2004 |
|---|
| 8 | | Xiaoyu Li,
Howard Barnum:
Quantum Authentication Using Entangled States.
Int. J. Found. Comput. Sci. 15(4): 609-617 (2004) |
| 7 | | 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 |
|---|
| 6 | | Howard Barnum,
Michael E. Saks,
Mario Szegedy:
Quantum query complexity and semi-definite programming.
IEEE Conference on Computational Complexity 2003: 179-193 |
| 2002 |
|---|
| 5 | | Howard Barnum,
Claude Crépeau,
Daniel Gottesman,
Adam Smith,
Alain Tapp:
Authentication of Quantum Messages.
FOCS 2002: 449-458 |
| 4 | | Howard Barnum,
Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions
CoRR quant-ph/0201007: (2002) |
| 3 | | Howard Barnum,
Claude Crépeau,
Daniel Gottesman,
Adam Smith,
Alain Tapp:
Authentication of Quantum Messages
CoRR quant-ph/0205128: (2002) |
| 2 | | Howard Barnum,
Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions
Electronic Colloquium on Computational Complexity (ECCC)(002): (2002) |
| 2000 |
|---|
| 1 |  | Howard Barnum,
Emanuel Knill,
Michael A. Nielsen:
On quantum fidelities and channel capacities.
IEEE Transactions on Information Theory 46(4): 1317-1329 (2000) |
