The following pages link to Julia Kempe (Q626622):
Displaying 31 items.
- (Q623190) (redirect page) (← links)
- Ion transport in inhomogeneous media based on the bipartition model for primary ions (Q623191) (← links)
- Using entanglement in quantum multi-prover interactive proofs (Q626625) (← links)
- The power of quantum systems on a line (Q842451) (← links)
- Permutation groups, minimal degrees and quantum computing. (Q2469771) (← links)
- Discrete quantum walks hit exponentially faster (Q2571012) (← links)
- Hardness of Approximation for Quantum Problems (Q2843264) (← links)
- A quantum lovász local lemma (Q2875141) (← links)
- (Q2913822) (← links)
- (Q2921782) (← links)
- (Q2921784) (← links)
- Bounded-error quantum state identification and exponential separations in communication complexity (Q2931421) (← links)
- Quantum Algorithms (Q3078111) (← links)
- Entangled Games Are Hard to Approximate (Q3093626) (← links)
- Approximation Algorithms for QMA-Complete Problems (Q3143301) (← links)
- (Q3171599) (← links)
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (Q3521970) (← links)
- (Q3522439) (← links)
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553) (← links)
- Two-Source Extractors Secure against Quantum Adversaries (Q3588442) (← links)
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography (Q3642860) (← links)
- Quantum walks on graphs (Q5175952) (← links)
- Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity (Q5189538) (← links)
- Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach (Q5281783) (← links)
- Unique Games with Entangled Provers Are Easy (Q5390593) (← links)
- A quantum Lovász local lemma (Q5395693) (← links)
- Parallel repetition of entangled games (Q5419105) (← links)
- (Q5429717) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465869) (← links)
- The Complexity of the Local Hamiltonian Problem (Q5470726) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900946) (← links)