#### Filter Results:

- Full text PDF available (39)

#### Publication Year

1950

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown. We settle thisâ€¦ (More)

- Wim van Dam, Michele Mosca, Umesh V. Vazirani
- FOCS
- 2001

We analyze the computational power and limitations of the recently proposed â€˜quantum adiabatic evolution algorithmâ€™.

- Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
- QCQC
- 1998

We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantumâ€¦ (More)

- Dave Bacon, Andrew M. Childs, Wim van Dam
- FOCS
- 2005

We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelianâ€¦ (More)

- Wim van Dam
- FOCS
- 1998

Consider a quantum computer in combination with a binary oracle of domain size N . It is shown how N/2 + âˆš N calls to the oracle are sufficient to guess the whole content of the oracle (being an Nâ€¦ (More)

- Harry Buhrman, Richard Cleve, Wim van Dam
- SIAM J. Comput.
- 2000

We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although aâ€¦ (More)

Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial inputâ€¦ (More)

Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereasâ€¦ (More)

- AndrÃ© Berthiaume, Wim van Dam, Sophie Laplante
- IEEE Conference on Computational Complexity
- 2000

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce thisâ€¦ (More)

We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to aâ€¦ (More)