|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 12 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sevag Gharibian, Julia Kempe |
Approximation algorithms for QMA-complete problems  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |
Entangled Games Are Hard to Approximate. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sevag Gharibian, Julia Kempe |
Approximation Algorithms for QMA-Complete Problems. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Thomas Vidick |
Parallel repetition of entangled games. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper bounds on the noise threshold for fault-tolerant quantum computing. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Roy Kasher, Julia Kempe |
Two-Source Extractors Secure Against Quantum Adversaries |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
Unique Games with Entangled Provers Are Easy. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Kasher, Julia Kempe |
Two-Source Extractors Secure against Quantum Adversaries. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev |
No Strong Parallel Repetition with Entangled and Non-signaling Provers. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
entangled two-prover games, unique games, parallel repetition |
| 1 | Andris Ambainis, Julia Kempe, Or Sattath |
A quantum lovász local lemma. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
local lemma, quanum SAT, random quantum sat, quantum computation, probabilistic method |
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-Prover Interactive Proofs. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 81P68, 68Q15, 68Q10 |
| 1 | Julia Kempe, Oded Regev |
No Strong Parallel Repetition with Entangled and Non-signaling Provers |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Julia Kempe, Or Sattath |
A Quantum Lovasz Local Lemma |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
Unique Games with Entangled Provers are Easy. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |
Entangled Games are Hard to Approximate. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-prover Interactive Proofs. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
quantum interactive proofs, public-coin, parallelization, entanglement |
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
The Unique Games Conjecture with Entangled Provers is False. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe |
The Power of Quantum Systems on a Line. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
cryptography, communication complexity, quantum |
| 1 | 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) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Strengths and Weaknesses of Quantum Fingerprinting |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Strengths and Weaknesses of Quantum Fingerprinting. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-error quantum state identification and exponential separations in communication complexity. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
quantum computing, randomness, communication complexity, entanglement, state identification |
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Julia Kempe, Alexander Rivosh |
Coins make quantum walks faster. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Aner Shalev |
The hidden subgroup problem and permutation group theory. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Quantum Communication Cannot Simulate a Public Coin |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Aner Shalev |
The hidden subgroup problem and permutation group theory |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev |
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev |
3-local Hamitonian is QMA-complete. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe |
Discrete Quantum Walks Hit Exponentially Faster. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe |
Quantum Random Walks Hit Exponentially Faster |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, David Bacon, David P. DiVincenzo, K. Brigitta Whaley |
Encoded universality from a single physical interaction. |
Quantum Information & Computation |
2001 |
DBLP BibTeX RDF |
|
| 1 | Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani |
Quantum walks on graphs. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")