Quantum walks on graphs. - Dorit Aharonov; Andris Ambainis; Julia Kempe; Umesh V. Vazirani (STOC, 2001)

Encoded universality from a single physical interaction. - Julia Kempe; David Bacon; David P. DiVincenzo; K. Birgitta Whaley (Quantum Inf. Comput., 2001)

Quantum Random Walks Hit Exponentially Faster - Julia Kempe (CoRR, 2002)

Discrete Quantum Walks Hit Exponentially Faster. - Julia Kempe (RANDOM-APPROX, 2003)

3-local Hamiltonian is QMA-complete. - Julia Kempe; Oded Regev 001 (Quantum Inf. Comput., 2003)

Quantum Communication Cannot Simulate a Public Coin - Dmitry Gavinsky; Julia Kempe; Ronald de Wolf (CoRR, 2004)

Coins make quantum walks faster. - Andris Ambainis; Julia Kempe; Alexander Rivosh (SODA, 2005)

The hidden subgroup problem and permutation group theory. - Julia Kempe; Aner Shalev (SODA, 2005)

Strengths and Weaknesses of Quantum Fingerprinting. - Dmitry Gavinsky; Julia Kempe; Ronald de Wolf (CCC, 2006)

Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. - Dmitry Gavinsky; Julia Kempe; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2006)

The Complexity of the Local Hamiltonian Problem. - Julia Kempe; Alexei Y. Kitaev; Oded Regev 001 (SIAM J. Comput., 2006)

Generalized Performance of Concatenated Quantum Codes - A Dynamical Systems Approach. - Jesse Fern; Julia Kempe; Slobodan N. Simic; Shankar Sastry 001 (IEEE Trans. Autom. Control., 2006)

The Unique Games Conjecture with Entangled Provers is False. - Julia Kempe; Oded Regev 001; Ben Toner (Algebraic Methods in Computational Complexity, 2007)

The Power of Quantum Systems on a Line. - Dorit Aharonov; Daniel Gottesman; Sandy Irani; Julia Kempe (FOCS, 2007)

Exponential separations for one-way quantum communication complexity, with applications to cryptography. - Dmitry Gavinsky; Julia Kempe; Iordanis Kerenidis; Ran Raz; Ronald de Wolf (STOC, 2007)

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. - Dorit Aharonov; Wim van Dam; Julia Kempe; Zeph Landau; Seth Lloyd; Oded Regev 001 (SIAM J. Comput., 2007)

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. - Dmitry Gavinsky; Julia Kempe; Iordanis Kerenidis; Ran Raz; Ronald de Wolf (SIAM J. Comput., 2008)

Using Entanglement in Quantum Multi-Prover Interactive Proofs. - Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Thomas Vidick (Comput. Complex., 2009)

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. - Dmitry Gavinsky; Julia Kempe; Oded Regev 001; Ronald de Wolf (SIAM J. Comput., 2009)

No Strong Parallel Repetition with Entangled and Non-signaling Provers. - Julia Kempe; Oded Regev 001 (CCC, 2010)

Upper bounds on the noise threshold for fault-tolerant quantum computing. - Julia Kempe; Oded Regev 001; Falk Unger; Ronald de Wolf (Quantum Inf. Comput., 2010)

Unique Games with Entangled Provers Are Easy. - Julia Kempe; Oded Regev 001; Ben Toner (SIAM J. Comput., 2010)

Parallel repetition of entangled games. - Julia Kempe; Thomas Vidick (STOC, 2011)

Entangled Games Are Hard to Approximate. - Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Ben Toner; Thomas Vidick (SIAM J. Comput., 2011)

A quantum lovász local lemma. - Andris Ambainis; Julia Kempe; Or Sattath (J. ACM, 2012)

Approximation Algorithms for QMA-Complete Problems. - Sevag Gharibian; Julia Kempe (SIAM J. Comput., 2012)

Two-Source Extractors Secure Against Quantum Adversaries. - Roy Kasher; Julia Kempe (Theory Comput., 2012)

Hardness of approximation for quantum problems. - Sevag Gharibian; Julia Kempe (Quantum Inf. Comput., 2014)

What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? - Nikolaos Tsilivis 002; Julia Kempe (NeurIPS, 2022)

Can we achieve robustness from data alone? - Nikolaos Tsilivis 002; Jingtong Su; Julia Kempe (CoRR, 2022)

ImpressLearn: Continual Learning via Combined Task Impressions. - Dhrupad Bhardwaj; Julia Kempe; Artem Vysogorets; Angela M. Teng; Evaristus C. Ezekwem (CoRR, 2022)

Wavelets Beat Monkeys at Adversarial Robustness. - Jingtong Su; Julia Kempe (CoRR, 2023)

Kernels, Data & Physics. - Francesco Cagnetta; Deborah Oliveira; Mahalakshmi Sabanayagam; Nikolaos Tsilivis 002; Julia Kempe (CoRR, 2023)

Embarassingly Simple Dataset Distillation. - Yunzhen Feng; Ramakrishna Vedantam; Julia Kempe (CoRR, 2023)

Discovering Galaxy Features via Dataset Distillation. - Haowen Guan; Xuan Zhao; Zishi Wang; Zhiyang Li 004; Julia Kempe (CoRR, 2023)

Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity. - Artem Vysogorets; Julia Kempe (J. Mach. Learn. Res., 2023)

Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors. - Tim G. J. Rudner; Ya Shi Zhang; Andrew Gordon Wilson; Julia Kempe (AISTATS, 2024)

Embarrassingly Simple Dataset Distillation. - Yunzhen Feng; Shanmukha Ramakrishna Vedantam; Julia Kempe (ICLR, 2024)

A Tale of Tails: Model Collapse as a Change of Scaling Laws. - Elvis Dohmatob; Yunzhen Feng; Pu Yang; François Charton; Julia Kempe (ICML, 2024)

Deconstructing the Goldilocks Zone of Neural Network Initialization. - Artem Vysogorets; Anna Dawid; Julia Kempe (ICML, 2024)

The Price of Implicit Bias in Adversarially Robust Generalization. - Nikolaos Tsilivis 002; Natalie Frank; Nati Srebro; Julia Kempe (NeurIPS, 2024)

Iteration Head: A Mechanistic Study of Chain-of-Thought. - Vivien Cabannes; Charles Arnal; Wassim Bouaziz; Xingyu Yang; François Charton; Julia Kempe (NeurIPS, 2024)

Model Collapse Demystified: The Case of Regression. - Elvis Dohmatob; Yunzhen Feng; Julia Kempe (NeurIPS, 2024)

Mission Impossible: A Statistical Perspective on Jailbreaking LLMs. - Jingtong Su; Julia Kempe; Karen Ullrich (NeurIPS, 2024)

Robust Data Pruning: Uncovering and Overcoming Implicit Bias. - Artem Vysogorets; Kartik Ahuja; Julia Kempe (CoRR, 2024)

Iteration Head: A Mechanistic Study of Chain-of-Thought. - Vivien Cabannes; Charles Arnal; Wassim Bouaziz; Alice Yang; François Charton; Julia Kempe (CoRR, 2024)

Beyond Model Collapse: Scaling Up with Synthesized Data Requires Reinforcement. - Yunzhen Feng; Elvis Dohmatob; Pu Yang; François Charton; Julia Kempe (CoRR, 2024)

Emergent properties with repeated examples. - François Charton; Julia Kempe (CoRR, 2024)

On the Geometry of Regularization in Adversarial Training: High-Dimensional Asymptotics and Generalization Bounds. - Matteo Vilucchio; Nikolaos Tsilivis 002; Bruno Loureiro; Julia Kempe (CoRR, 2024)

Attacking Bayes: On the Adversarial Robustness of Bayesian Neural Networks. - Yunzhen Feng; Tim G. J. Rudner; Nikolaos Tsilivis 002; Julia Kempe (Trans. Mach. Learn. Res., 2024)

On the Robustness of Neural Collapse and the Neural Collapse of Robustness. - Jingtong Su; Ya Shi Zhang; Nikolaos Tsilivis 002; Julia Kempe (Trans. Mach. Learn. Res., 2024)

Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks. - Nikolaos Tsilivis 002; Gal Vardi; Julia Kempe (ICLR, 2025)

Strong Model Collapse. - Elvis Dohmatob; Yunzhen Feng; Arjun Subramonian; Julia Kempe (ICLR, 2025)

Beyond Model Collapse: Scaling Up with Synthesized Data Requires Verification. - Yunzhen Feng; Elvis Dohmatob; Pu Yang; François Charton; Julia Kempe (ICLR, 2025)

DRoP: Distributionally Robust Data Pruning. - Artem M. Vysogorets; Kartik Ahuja; Julia Kempe (ICLR, 2025)

PILAF: Optimal Human Preference Sampling for Reward Modeling. - Yunzhen Feng; Ariel Kwiatkowski; Kunhao Zheng; Julia Kempe; Yaqi Duan (CoRR, 2025)

From Concepts to Components: Concept-Agnostic Attention Module Discovery in Transformers. - Jingtong Su; Julia Kempe; Karen Ullrich (CoRR, 2025)

Asymmetric REINFORCE for off-Policy Reinforcement Learning: Balancing positive and negative rewards. - Charles Arnal; Gaëtan Narozniak; Vivien Cabannes; Yunhao Tang; Julia Kempe; Rémi Munos (CoRR, 2025)

Tuning without Peeking: Provable Privacy and Generalization Bounds for LLM Post-Training. - Ismail Labiad; Mathurin Videau; Matthieu Kowalski; Marc Schoenauer; Alessandro Ferreira Leite; Julia Kempe; Olivier Teytaud (CoRR, 2025)