dblp.uni-trier.dewww.uni-trier.de

Julia Kempe

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2007
20EEJulia Kempe, Oded Regev, Ben Toner: The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity 2007
19EEDorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe: The Power of Quantum Systems on a Line. FOCS 2007: 373-383
18EEDmitry 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
17EEDorit 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
16EEDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting. IEEE Conference on Computational Complexity 2006: 288-298
15EEDmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603
14EEDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting CoRR abs/quant-ph/0603173: (2006)
13EEDmitry 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)
12EEJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35(5): 1070-1097 (2006)
2005
11EEAndris Ambainis, Julia Kempe, Alexander Rivosh: Coins make quantum walks faster. SODA 2005: 1099-1108
10EEJulia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory. SODA 2005: 1118-1125
9EEDmitry 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
8EEDorit 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
7EEJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383
6EEJulia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory CoRR quant-ph/0406046: (2004)
5EEJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem CoRR quant-ph/0406180: (2004)
4EEDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Quantum Communication Cannot Simulate a Public Coin CoRR quant-ph/0411051: (2004)
2003
3EEJulia Kempe: Discrete Quantum Walks Hit Exponentially Faster. RANDOM-APPROX 2003: 354-369
2002
2EEJulia Kempe: Quantum Random Walks Hit Exponentially Faster CoRR quant-ph/0205083: (2002)
2001
1EEDorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani: Quantum walks on graphs. STOC 2001: 50-59

Coauthor Index

1Dorit Aharonov [1] [8] [17] [19]
2Andris Ambainis [1] [11]
3Wim van Dam [8] [17]
4Dmitry Gavinsky [4] [9] [13] [14] [15] [16] [18]
5Daniel Gottesman [19]
6Sandy Irani [19]
7Iordanis Kerenidis [18]
8Alexei Kitaev [5] [7] [12]
9Zeph Landau [8] [17]
10Seth Lloyd [8] [17]
11Ran Raz [18]
12Oded Regev [5] [7] [8] [9] [12] [15] [17] [20]
13Alexander Rivosh [11]
14Aner Shalev [6] [10]
15Ben Toner [20]
16Umesh V. Vazirani [1]
17Ronald de Wolf [4] [9] [13] [14] [15] [16] [18]

Colors in the list of coauthors

Copyright © Thu Jun 5 07:42:39 2008 by Michael Ley (ley@uni-trier.de)