activity
20002004
most citedQuantum Random Walks Hit Exponentially Faster

103 citations · 149 across the 7 of their papers we have counts for

collaborators

10 papers

quant-ph200415 cited

Generalized Performance of Concatenated Quantum Codes -- A Dynamical Systems Approach

Jesse Fern, Julia Kempe, Slobodan Simic +1

We apply a dynamical systems approach to concatenation of quantum error correcting codes, extending and generalizing the results of Rahn et al. [1] to both diagonal and nondiagonal…

quant-ph2004

The hidden subgroup problem and permutation group theory

Julia Kempe, Aner Shalev

We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group…

quant-ph2004

The Complexity of the Local Hamiltonian Problem

Julia Kempe, Alexei Kitaev, Oded Regev

The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for…

quant-ph20041 cited

Quantum Color-Coding Is Better

Joshua Von Korff, Julia Kempe

We describe a quantum scheme to ``color-code'' a set of objects in order to record which one is which. In the classical case, N distinct colors are required to color-code N objects…

quant-ph20049 cited

Coins Make Quantum Walks Faster

Andris Ambainis, Julia Kempe, Alexander Rivosh

We show how to search N items arranged on a grid in time , using a discrete time quantum walk. This result for the first time exhibits a…

quant-ph2003

An Explicit Universal Gate-set for Exchange-Only Quantum Computation

M. Hsieh, J. Kempe, S. Myrgren +1

A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computatio…