Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kempe, Julia"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A quantum Lovász local lemma
Andris Ambainis
,
Julia Kempe
,
Or Sattath
Journal of the ACM
59
(5), 2012, pp. 24: 1-24
Hardness of approximation for quantum problems
Sevag Gharibian
,
Julia Kempe
Lecture Notes in Computer Science
7391
, 2012, pp. 387-398
Approximation algorithms for QMA-complete problems
Sevag Gharibian
,
Julia Kempe
SIAM Journal on Computing
41
(4), 2012, pp. 1028-1050
Entangled games are hard to approximate
Julia Kempe
,
Hirotada Kobayashi
,
Keiji Matsumoto
,
Ben Toner
,
Thomas Vidick
SIAM Journal on Computing
40
(3), 2011, pp. 848-877
Parallel repetition of entangled games
Julia Kempe
,
Thomas Vidick
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 353-362
A quantum Lovász Local Lemma
Andris Ambainis
,
Julia Kempe
,
Or Sattath
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 151-160
Unique games with entangled provers are easy
Julia Kempe
,
Oded Regev
,
Ben Toner
SIAM Journal on Computing
39
(7), 2010, pp. 3207-3229
Bounded-error quantum state identification and exponential separations in communication complexity
Dmitry Gavinsky
,
Julia Kempe
,
Oded Regev
,
Ronald de Wolf
SIAM Journal on Computing
39
(1), 2009, pp. 1-24
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov
,
Wim van Dam
,
Julia Kempe
,
Zeph Landau
,
Seth Lloyd
,
Oded Regev
SIAM Review
50
(4), 2008, pp. 755-787
Exponential separation for one-way quantum communication complexity, with applications to cryptography
Dmitry Gavinsky
,
Julia Kempe
,
Iordanis Kerenidis
,
Ran Raz
,
Ronald de Wolf
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1695-1708
Upper bounds on the noise threshold for fault-tolerant quantum computing
Julia Kempe
,
Oded Regev
,
Falk Unger
,
Ronald de Wolf
Lecture Notes in Computer Science
5125
, 2008, pp. 845-856
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov
,
Wim van Dam
,
Julia Kempe
,
Zeph Landau
,
Seth Lloyd
,
Oded Regev
SIAM Journal on Computing
37
(1), 2007, pp. 166-194
Exponential separations for one-way quantum communication complexity, with applications to cryptography
Dmitry Gavinsky
,
Julia Kempe
,
Iordanis Kerenidis
,
Ran Raz
,
Ronald de Wolf
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 516-525
Bounded-error quantum state identification and exponential separations in communication complexity
Dmitry Gavinsky
,
Julia Kempe
,
Oded Regev
,
Ronald de Wolf
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 594-603
The complexity of the local Hamiltonian problem
Julia Kempe
,
Alexei Kitaev
,
Oded Regev
SIAM Journal on Computing
35
(5), 2006, pp. 1070-1097
The complexity of the local Hamiltonian problem
Julia Kempe
,
Alexei Kitaev
,
Oded Regev
Lecture Notes in Computer Science
3328
, 2004, pp. 372-383
Quantum walks on graphs
Dorit Aharonov
,
Andris Ambainis
,
Julia Kempe
,
Umesh Vazirani
Technical Report (2001-72), 2001
Quantum walks on graphs
Dorit Aharonov
,
Andris Ambainis
,
Julia Kempe
,
Umesh Vazirani
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 50-59