Julia Kempe's AcademicInfluence.com Rankings Why Is Julia Kempe Influential? (Suggest an Edit or Addition)
According to Wikipedia , Julia Kempe is a French, German, and Israeli researcher in quantum computing. She is currently the Director of the Center for Data Science at NYU and Professor at the Courant Institute. Education and career Kempe was born in East Berlin, to a family of Russian descent. She moved to Austria in 1990, and did her undergraduate studies in mathematics and physics at the University of Vienna from 1992 to 1995, with a year as an exchange student in physics at the University of Technology Sydney. She then earned two Master of Advanced Studies degrees in France: one in mathematics in 1996 from Pierre and Marie Curie University and another in 1997 in physics from the École normale supérieure. She completed two doctorates in 2001. The dissertation for her Ph.D. in computer science from the École nationale supérieure des télécommunications was entitled Quantum Computing: Random Walks and Entanglement, and was supervised by Gérard Cohen. Her second Ph.D., in mathematics, was from the University of California, Berkeley, with a dissertation entitled Universal Noiseless Quantum Computation: Theory and Applications and was jointly supervised by Elwyn Berlekamp and chemist K. Birgitta Whaley.
(See a Problem?) Julia Kempe's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
2000 2010 2020 0 250 500 750 1000 1250 1500 1750 2000 2250 Published Works Quantum random walks: An introductory overview (2003) Quantum random-walk search algorithm (2002) Adiabatic quantum computation is equivalent to standard quantum computation (2004) Quantum walks on graphs (2000) Universal quantum computation with the exchange interaction (2000) The Complexity of the Local Hamiltonian Problem (2004) Theory of decoherence-free fault-tolerant universal quantum computation (2000) Coins make quantum walks faster (2004) (334)Quantum information processing and communication (2005) Separable states are more disordered globally than locally. (2000) The Power of Quantum Systems on a Line (2007) Exponential separations for one-way quantum communication complexity, with applications to cryptography (2006) Multiparticle entanglement and its applications to cryptography (1999) Discrete Quantum Walks Hit Exponentially Faster (2003) Interdisciplinary Physics: Biological Physics, Quantum Information, etc. (2001) Quantum Random Walks Hit Exponentially Faster (2002) (128)Robustness of multiparty entanglement (2001) Entangled Games are Hard to Approximate (2007) Unique Games with Entangled Provers are Easy (2007) 3-local Hamiltonian is QMA-complete (2003) (103)Universal simulation of Markovian quantum dynamics (2000) 3-local Hamitonian is QMA-complete (2003) (81)Decoherence-free subspaces for multiple-qubit errors. I. Characterization (1999) Encoded universality from a single physical interaction (2001) (56)Using Entanglement in Quantum Multi-Prover Interactive Proofs (2007) Approaches to quantum error correction (2006) Parallel repetition of entangled games (2010) Decoherence-Free Subspaces for Multiple-Qubit Errors: (II) Universal, Fault-Tolerant Quantum Computation (2000) Bounded-error quantum state identification and exponential separations in communication complexity (2005) Quantum information processing and communication Strategic report on current status , visions and goals for research in Europe (2005) (48)The hidden subgroup problem and permutation group theory (2004) (47)Protecting Quantum Information Encoded in Decoherence Free States Against Exchange Errors (1999) Exact gate sequences for universal quantum computation using the XY interaction alone (2001) Approximation Algorithms for QMA-Complete Problems (2011) No Strong Parallel Repetition with Entangled and Non-signaling Provers (2009) Quantum Communication Cannot Simulate a Public Coin (2004) (32)Strengths and weaknesses of quantum fingerprinting (2006) A quantum Lovász local lemma (2009) An Explicit Universal Gate-Set for Exchange-Only Quantum Computation (2003) The Unique Games Conjecture with Entangled Provers is False (2007) (26)Hardness of approximation for quantum problems (2012) Upper bounds on the noise threshold for fault-tolerant quantum computing (2008) Encoded Universality in Physical Implementations of a Quantum Computer (2001) (23)Two-Source Extractors Secure Against Quantum Adversaries (2010) Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach (2004) Full protection of superconducting qubit systems from coupling errors (2004) Permutation groups, minimal degrees and quantum computing (2006) Quantum advantage in transmitting a permutation. (2004) Optimal photon cloning (2000) Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function (2006) (12)On the Power of Entangled Provers: Immunizing games against entanglement (2007) (11)Quantum random walks: an introductory overview (2009) Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity (2021) (7)On the Power of Entangled Quantum Provers (2006) (7)Universal noiseless quantum computation: mathematical theory and applications (2001) (5)A quantum lovász local lemma (2010) Fault-tolerant quantum computation – a dynamical systems approach (2004) (4)What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? (2022) Universal Fault Tolerant Quantum Computation on a Class of Decoherence-Free Subspaces Without Spatial Symmetry (1999) (3)Can we achieve robustness from data alone? (2022) Quantum Color-Coding Is Better (2004) (1)Quantum Algorithms { Lecture Notes ⁄ { Summer School on Theory and Technology in Quantum Information, Communication, Computation and Cryptography (2006) (0)01 09 10 2 v 1 2 0 Se p 20 01 Robustness of Multi-Party Entanglement (2018) (0)Wavelets Beat Monkeys at Adversarial Robustness (2023) Quantum Algorithms (2009) ImpressLearn: Continual Learning via Combined Task Impressions (2022) 1 2 8 Ju l 2 00 6 Permutation groups , minimal degrees and quantum computing (0)M ar 2 00 3 Quantum random walks-an introductory overview (0)Quantum Random Walks -an Introductory Overview God Does Not Play Dice. Albert Einstein (0)Lambda's, V's and optimal cloning with stimulated emission (2000) More Papers This paper list is powered by the following services:
Other Resources About Julia Kempe What Schools Are Affiliated With Julia Kempe? Julia Kempe is affiliated with the following schools:
