Julia Kempe

From MaRDI portal
Person:626622

Available identifiers

zbMath Open kempe.juliaDBLPk/JuliaKempeWikidataQ21263733 ScholiaQ21263733MaRDI QIDQ626622

List of research outcomes





PublicationDate of PublicationType
Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach2017-07-27Paper
Quantum walks on graphs2015-02-27Paper
Bounded-error quantum state identification and exponential separations in communication complexity2014-11-25Paper
Coins make quantum walks faster2014-10-13Paper
The hidden subgroup problem and permutation group theory2014-10-13Paper
A quantum Lovász local lemma2014-08-13Paper
Parallel repetition of entangled games2014-06-05Paper
A quantum Lovász local lemma2014-02-17Paper
Hardness of Approximation for Quantum Problems2013-08-12Paper
Approximation Algorithms for QMA-Complete Problems2012-11-29Paper
Two-source extractors secure against quantum adversaries2012-09-27Paper
Entangled Games Are Hard to Approximate2011-10-18Paper
https://portal.mardi4nfdi.de/entity/Q31715992011-10-05Paper
Unique Games with Entangled Provers Are Easy2011-04-04Paper
Quantum Algorithms2011-02-18Paper
Using entanglement in quantum multi-prover interactive proofs2011-02-18Paper
Ion transport in inhomogeneous media based on the bipartition model for primary ions2011-02-13Paper
Two-Source Extractors Secure against Quantum Adversaries2010-09-10Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity2010-03-17Paper
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography2009-11-06Paper
The power of quantum systems on a line2009-09-25Paper
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation2008-12-16Paper
https://portal.mardi4nfdi.de/entity/Q35224392008-09-03Paper
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing2008-08-28Paper
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation2008-03-28Paper
Permutation groups, minimal degrees and quantum computing.2008-02-07Paper
https://portal.mardi4nfdi.de/entity/Q54297172007-12-03Paper
The Complexity of the Local Hamiltonian Problem2006-06-01Paper
Discrete quantum walks hit exponentially faster2005-11-02Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper

Research outcomes over time

This page was built for person: Julia Kempe