2008 |
24 | EE | Wim van Dam,
Igor Shparlinski:
Classical and Quantum Algorithms for Exponential Congruences.
TQC 2008: 1-10 |
2007 |
23 | EE | Andrew M. Childs,
Wim van Dam:
Quantum algorithm for a generalized hidden shift problem.
SODA 2007: 1225-1232 |
22 | EE | Dorit Aharonov,
Wim van Dam,
Julia Kempe,
Zeph Landau,
Seth Lloyd,
Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation.
SIAM J. Comput. 37(1): 166-194 (2007) |
21 | EE | Wim van Dam,
Frédéric Magniez,
Michele Mosca,
Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates.
SIAM J. Comput. 37(2): 611-629 (2007) |
2006 |
20 | EE | Wim van Dam,
Sean Hallgren,
Lawrence Ip:
Quantum Algorithms for Some Hidden Shift Problems.
SIAM J. Comput. 36(3): 763-778 (2006) |
2005 |
19 | EE | Dave Bacon,
Andrew M. Childs,
Wim van Dam:
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups.
FOCS 2005: 469-478 |
18 | EE | Wim van Dam,
Richard D. Gill,
Peter Grünwald:
The statistical strength of nonlocality proofs.
IEEE Transactions on Information Theory 51(8): 2812-2835 (2005) |
2004 |
17 | EE | Dorit Aharonov,
Wim van Dam,
Julia Kempe,
Zeph Landau,
Seth Lloyd,
Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation.
FOCS 2004: 42-51 |
2003 |
16 | EE | Wim van Dam,
Sean Hallgren,
Lawrence Ip:
Quantum algorithms for some hidden shift problems.
SODA 2003: 489-498 |
2002 |
15 | EE | Wim van Dam:
Quantum Algorithms for Weighing Matrices and Quadratic Residues.
Algorithmica 34(4): 413-428 (2002) |
2001 |
14 | | Wim van Dam,
Michele Mosca,
Umesh V. Vazirani:
How Powerful is Adiabatic Quantum Computation?.
FOCS 2001: 279-287 |
13 | | André Berthiaume,
Wim van Dam,
Sophie Laplante:
Quantum Kolmogorov Complexity.
J. Comput. Syst. Sci. 63(2): 201-221 (2001) |
2000 |
12 | EE | André Berthiaume,
Wim van Dam,
Sophie Laplante:
Quantum Kolmogorov Complexity.
IEEE Conference on Computational Complexity 2000: 240-249 |
11 | EE | Wim van Dam,
Frédéric Magniez,
Michele Mosca,
Miklos Santha:
Self-testing of universal and fault-tolerant sets of quantum gates.
STOC 2000: 688-696 |
10 | EE | Wim van Dam:
Quantum Algorithms for Weighing Matrices and Quadratic Residues
CoRR quant-ph/0008059: (2000) |
9 | EE | Wim van Dam,
Sean Hallgren:
Efficient Quantum Algorithms for Shifted Quadratic Character Problems
CoRR quant-ph/0011067: (2000) |
8 | EE | Harry Buhrman,
Richard Cleve,
Wim van Dam:
Quantum Entanglement and Communication Complexity.
SIAM J. Comput. 30(6): 1829-1841 (2000) |
1999 |
7 | EE | Harry Buhrman,
Wim van Dam:
Quantum Bounded Query Complexity.
IEEE Conference on Computational Complexity 1999: 149- |
6 | EE | Harry Buhrman,
Wim van Dam:
Quantum Bounded Query Complexity
CoRR quant-ph/9903035: (1999) |
5 | EE | Wim van Dam,
Frédéric Magniez,
Michele Mosca,
Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
CoRR quant-ph/9904108: (1999) |
1998 |
4 | EE | Wim van Dam:
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price.
FOCS 1998: 362-367 |
3 | EE | Richard Cleve,
Wim van Dam,
Michael Nielsen,
Alain Tapp:
Quantum Entanglement and the Communication Complexity of the Inner Product Function.
QCQC 1998: 61-74 |
2 | EE | Wim van Dam:
Quantum Oracle Interrogation: Getting all information for almost half the price
CoRR quant-ph/9805006: (1998) |
1 | EE | Wim van Dam:
Two Classical Queries versus One Quantum Query
CoRR quant-ph/9806090: (1998) |