2008 |
26 | EE | Julia Kempe,
Hirotada Kobayashi,
Keiji Matsumoto,
Ben Toner,
Thomas Vidick:
Entangled Games are Hard to Approximate.
FOCS 2008: 447-456 |
25 | EE | Julia Kempe,
Oded Regev,
Ben Toner:
Unique Games with Entangled Provers are Easy.
FOCS 2008: 457-466 |
24 | EE | Julia Kempe,
Oded Regev,
Falk Unger,
Ronald de Wolf:
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing.
ICALP (1) 2008: 845-856 |
23 | EE | Julia Kempe,
Hirotada Kobayashi,
Keiji Matsumoto,
Thomas Vidick:
Using Entanglement in Quantum Multi-prover Interactive Proofs.
IEEE Conference on Computational Complexity 2008: 211-222 |
22 | EE | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.
SIAM J. Comput. 38(5): 1695-1708 (2008) |
2007 |
21 | EE | Julia Kempe,
Oded Regev,
Ben Toner:
The Unique Games Conjecture with Entangled Provers is False.
Algebraic Methods in Computational Complexity 2007 |
20 | EE | Dorit Aharonov,
Daniel Gottesman,
Sandy Irani,
Julia Kempe:
The Power of Quantum Systems on a Line.
FOCS 2007: 373-383 |
19 | EE | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential separations for one-way quantum communication complexity, with applications to cryptography.
STOC 2007: 516-525 |
18 | 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) |
2006 |
17 | EE | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting.
IEEE Conference on Computational Complexity 2006: 288-298 |
16 | EE | Dmitry Gavinsky,
Julia Kempe,
Oded Regev,
Ronald de Wolf:
Bounded-error quantum state identification and exponential separations in communication complexity.
STOC 2006: 594-603 |
15 | EE | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting
CoRR abs/quant-ph/0603173: (2006) |
14 | EE | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
CoRR abs/quant-ph/0607174: (2006) |
13 | EE | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function.
Electronic Colloquium on Computational Complexity (ECCC) 13(086): (2006) |
12 | EE | Julia Kempe,
Alexei Kitaev,
Oded Regev:
The Complexity of the Local Hamiltonian Problem.
SIAM J. Comput. 35(5): 1070-1097 (2006) |
2005 |
11 | EE | Andris Ambainis,
Julia Kempe,
Alexander Rivosh:
Coins make quantum walks faster.
SODA 2005: 1099-1108 |
10 | EE | Julia Kempe,
Aner Shalev:
The hidden subgroup problem and permutation group theory.
SODA 2005: 1118-1125 |
9 | EE | Dmitry Gavinsky,
Julia Kempe,
Oded Regev,
Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
CoRR abs/quant-ph/0511013: (2005) |
2004 |
8 | 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 |
7 | EE | Julia Kempe,
Alexei Kitaev,
Oded Regev:
The Complexity of the Local Hamiltonian Problem.
FSTTCS 2004: 372-383 |
6 | EE | Julia Kempe,
Aner Shalev:
The hidden subgroup problem and permutation group theory
CoRR quant-ph/0406046: (2004) |
5 | EE | Julia Kempe,
Alexei Kitaev,
Oded Regev:
The Complexity of the Local Hamiltonian Problem
CoRR quant-ph/0406180: (2004) |
4 | EE | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Quantum Communication Cannot Simulate a Public Coin
CoRR quant-ph/0411051: (2004) |
2003 |
3 | EE | Julia Kempe:
Discrete Quantum Walks Hit Exponentially Faster.
RANDOM-APPROX 2003: 354-369 |
2002 |
2 | EE | Julia Kempe:
Quantum Random Walks Hit Exponentially Faster
CoRR quant-ph/0205083: (2002) |
2001 |
1 | EE | Dorit Aharonov,
Andris Ambainis,
Julia Kempe,
Umesh V. Vazirani:
Quantum walks on graphs.
STOC 2001: 50-59 |