Search the dblp DataBase

Publications of Author

1. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
   Strengths and Weaknesses of Quantum Fingerprinting. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:288-298 [Conf]
   
2. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
   Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP]
   FOCS, 2004, pp:42-51 [Conf]
   
3. Julia Kempe, Alexei Kitaev, Oded Regev
   The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2004, pp:372-383 [Conf]
   
4. Julia Kempe
   Discrete Quantum Walks Hit Exponentially Faster. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2003, pp:354-369 [Conf]
   
5. Andris Ambainis, Julia Kempe, Alexander Rivosh
   Coins make quantum walks faster. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:1099-1108 [Conf]
   
6. Julia Kempe, Aner Shalev
   The hidden subgroup problem and permutation group theory. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:1118-1125 [Conf]
   
7. Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani
   Quantum walks on graphs. [Citation Graph (0, 0)][DBLP]
   STOC, 2001, pp:50-59 [Conf]
   
8. Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
   Bounded-error quantum state identification and exponential separations in communication complexity. [Citation Graph (0, 0)][DBLP]
   STOC, 2006, pp:594-603 [Conf]
   
9. Julia Kempe
   Quantum Random Walks Hit Exponentially Faster [Citation Graph (0, 0)][DBLP]
   CoRR, 2002, v:0, n:, pp:- [Journal]
   
10. Julia Kempe, Aner Shalev
    The hidden subgroup problem and permutation group theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
    
11. Julia Kempe, Alexei Kitaev, Oded Regev
    The Complexity of the Local Hamiltonian Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
    
12. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Quantum Communication Cannot Simulate a Public Coin [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
    
13. Julia Kempe, Alexei Kitaev, Oded Regev
    The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1070-1097 [Journal]
    
14. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
    Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:166-194 [Journal]
    
15. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
    Exponential separations for one-way quantum communication complexity, with applications to cryptography. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:516-525 [Conf]
    
16. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Strengths and Weaknesses of Quantum Fingerprinting [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
17. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
18. 
    Two-Source Extractors Secure against Quantum Adversaries. [Citation Graph (, )][DBLP]
    
    
19. 
    Using Entanglement in Quantum Multi-prover Interactive Proofs. [Citation Graph (, )][DBLP]
    
    
20. 
    No Strong Parallel Repetition with Entangled and Non-signaling Provers. [Citation Graph (, )][DBLP]
    
    
21. 
    The Unique Games Conjecture with Entangled Provers is False. [Citation Graph (, )][DBLP]
    
    
22. 
    The Power of Quantum Systems on a Line. [Citation Graph (, )][DBLP]
    
    
23. 
    Unique Games with Entangled Provers are Easy. [Citation Graph (, )][DBLP]
    
    
24. 
    Entangled Games are Hard to Approximate. [Citation Graph (, )][DBLP]
    
    
25. 
    Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. [Citation Graph (, )][DBLP]
    
    
26. 
    A quantum lovász local lemma. [Citation Graph (, )][DBLP]
    
    
27. 
    Using Entanglement in Quantum Multi-Prover Interactive Proofs. [Citation Graph (, )][DBLP]
    
    
28. 
    Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity [Citation Graph (, )][DBLP]
    
    
29. 
    No Strong Parallel Repetition with Entangled and Non-signaling Provers [Citation Graph (, )][DBLP]
    
    
30. 
    A Quantum Lovasz Local Lemma [Citation Graph (, )][DBLP]
    
    
31. 
    Two-Source Extractors Secure Against Quantum Adversaries [Citation Graph (, )][DBLP]
    
    
32. 
    Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. [Citation Graph (, )][DBLP]