Julia Kempe

	2011
42		Sevag Gharibian, Julia Kempe: Approximation Algorithms for QMA-Complete Problems. IEEE Conference on Computational Complexity 2011: 178-188
41		Julia Kempe, Thomas Vidick: Parallel repetition of entangled games. STOC 2011: 353-362
40		Sevag Gharibian, Julia Kempe: Approximation algorithms for QMA-complete problems CoRR abs/1101.3884: (2011)
39		Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick: Entangled Games Are Hard to Approximate. SIAM J. Comput. 40(3): 848-877 (2011)
	2010
38		Roy Kasher, Julia Kempe: Two-Source Extractors Secure against Quantum Adversaries. APPROX-RANDOM 2010: 656-669
37		Julia Kempe, Oded Regev: No Strong Parallel Repetition with Entangled and Non-signaling Provers. IEEE Conference on Computational Complexity 2010: 7-15
36		Andris Ambainis, Julia Kempe, Or Sattath: A quantum lovász local lemma. STOC 2010: 151-160
35		Roy Kasher, Julia Kempe: Two-Source Extractors Secure Against Quantum Adversaries CoRR abs/1005.0512: (2010)
34		Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf: Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Information & Computation 10(5&6): 361-376 (2010)
33		Julia Kempe, Oded Regev, Ben Toner: Unique Games with Entangled Provers Are Easy. SIAM J. Comput. 39(7): 3207-3229 (2010)
	2009
32		Julia Kempe, Oded Regev: No Strong Parallel Repetition with Entangled and Non-signaling Provers CoRR abs/0911.0201: (2009)
31		Andris Ambainis, Julia Kempe, Or Sattath: A Quantum Lovasz Local Lemma CoRR abs/0911.1696: (2009)
30		Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-Prover Interactive Proofs. Computational Complexity 18(2): 273-307 (2009)
29		Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. 39(1): 1-24 (2009)
	2008
28		Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick: Entangled Games are Hard to Approximate. FOCS 2008: 447-456
27		Julia Kempe, Oded Regev, Ben Toner: Unique Games with Entangled Provers are Easy. FOCS 2008: 457-466
26		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
25		Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-prover Interactive Proofs. IEEE Conference on Computational Complexity 2008: 211-222
24		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
23		Julia Kempe, Oded Regev, Ben Toner: The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity 2007
22		Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe: The Power of Quantum Systems on a Line. FOCS 2007: 373-383
21		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
20		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
19		Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting. IEEE Conference on Computational Complexity 2006: 288-298
18		Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603
17		Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting CoRR abs/quant-ph/0603173: (2006)
16		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)
15		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)
14		Julia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35(5): 1070-1097 (2006)
	2005
13		Andris Ambainis, Julia Kempe, Alexander Rivosh: Coins make quantum walks faster. SODA 2005: 1099-1108
12		Julia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory. SODA 2005: 1118-1125
11		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
10		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
9		Julia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383
8		Julia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory CoRR quant-ph/0406046: (2004)
7		Julia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem CoRR quant-ph/0406180: (2004)
6		Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Quantum Communication Cannot Simulate a Public Coin CoRR quant-ph/0411051: (2004)
	2003
5		Julia Kempe: Discrete Quantum Walks Hit Exponentially Faster. RANDOM-APPROX 2003: 354-369
4		Julia Kempe, Oded Regev: 3-local Hamitonian is QMA-complete. Quantum Information & Computation 3(3): 258-264 (2003)
	2002
3		Julia Kempe: Quantum Random Walks Hit Exponentially Faster CoRR quant-ph/0205083: (2002)
	2001
2		Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani: Quantum walks on graphs. STOC 2001: 50-59
1		Julia Kempe, David Bacon, David P. DiVincenzo, K. Brigitta Whaley: Encoded universality from a single physical interaction. Quantum Information & Computation 1(4): 33-55 (2001)

Coauthor Index

1	Dorit Aharonov	[2] [10] [20] [22]
2	Andris Ambainis	[2] [13] [31] [36]
3	David Bacon	[1]
4	Wim van Dam	[10] [20]
5	David P. DiVincenzo	[1]
6	Dmitry Gavinsky	[6] [11] [15] [16] [17] [18] [19] [21] [24] [29]
7	Sevag Gharibian	[40] [42]
8	Daniel Gottesman	[22]
9	Sandy Irani	[22]
10	Roy Kasher	[35] [38]
11	Iordanis Kerenidis	[21] [24]
12	Alexei Kitaev	[7] [9] [14]
13	Hirotada Kobayashi	[25] [28] [30] [39]
14	Zeph Landau	[10] [20]
15	Seth Lloyd	[10] [20]
16	Keiji Matsumoto	[25] [28] [30] [39]
17	Ran Raz	[21] [24]
18	Oded Regev	[4] [7] [9] [10] [11] [14] [18] [20] [23] [26] [27] [29] [32] [33] [34] [37]
19	Alexander Rivosh	[13]
20	Or Sattath	[31] [36]
21	Aner Shalev	[8] [12]
22	Ben Toner	[23] [27] [28] [33] [39]
23	Falk Unger	[26] [34]
24	Umesh V. Vazirani	[2]
25	Thomas Vidick	[25] [28] [30] [39] [41]
26	K. Brigitta Whaley	[1]
27	Ronald de Wolf	[6] [11] [15] [16] [17] [18] [19] [21] [24] [26] [29] [34]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page