Evasive random walks and the clairvoyant demon. - Aaron Abrams; Henry Landau; Zeph Landau; James Pommersheim; Eric Zaslow (Random Struct. Algorithms, 2002)

Deficits and Excesses of Frames. - Radu V. Balan; Peter G. Casazza; Christopher Heil; Zeph Landau (Adv. Comput. Math., 2003)

Randomizing the replacement attack. - Darko Kirovski; Zeph Landau (ICASSP (5), 2004)

Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem. - Zeph Landau; Alexander Russell (Electron. J. Comb., 2004)

Parameter Analysis for the Generalized LZ Compression of Audio. - Darko Kirovski; Zeph Landau (DCC, 2005)

Parameter analysis for GLZ audio compression. - Zeph Landau; Darko Kirovski (ICASSP (3), 2005)

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)

Generalized Lempel-Ziv Compression for Audio. - Darko Kirovski; Zeph Landau (IEEE Trans. Speech Audio Process., 2007)

The Replacement Attack. - Darko Kirovski; Fabien A. P. Petitcolas; Zeph Landau (IEEE Trans. Speech Audio Process., 2007)

Quantum Approximation of the Jones Polynomial. - Zeph Landau (Encyclopedia of Algorithms, 2008)

The detectability lemma and quantum gap amplification. - Dorit Aharonov; Itai Arad; Zeph Landau; Umesh V. Vazirani (STOC, 2009)

A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. - Dorit Aharonov; Vaughan Jones; Zeph Landau (Algorithmica, 2009)

A fair division solution to the problem of redistricting. - Zeph Landau; Oneil Reid; Ilona Yershov (Soc. Choice Welf., 2009)

Quantum Computation and the Evaluation of Tensor Networks. - Itai Arad; Zeph Landau (SIAM J. Comput., 2010)

The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. - Dorit Aharonov; Itai Arad; Zeph Landau; Umesh V. Vazirani (FOCS, 2011)

Distributions of Order Patterns of Interval Maps. - Aaron Abrams; Eric Babson; Henry Landau; Zeph Landau; James Pommersheim (Comb. Probab. Comput., 2013)

Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. - Dorit Aharonov; Aram W. Harrow; Zeph Landau; Daniel Nagaj; Mario Szegedy; Umesh V. Vazirani (FOCS, 2014)

An efficient algorithm for finding the ground state of 1D gapped local hamiltonians. - Zeph Landau; Umesh V. Vazirani; Thomas Vidick (ITCS, 2014)

Quantum Hamiltonian Complexity. - Sevag Gharibian; Yichen Huang; Zeph Landau (CoRR, 2014)

Fair Division and Redistricting. - Zeph Landau; Francis Edward Su (CoRR, 2014)

Quantum Hamiltonian Complexity. - Sevag Gharibian; Yichen Huang; Zeph Landau; Seung Woo Shin (Found. Trends Theor. Comput. Sci., 2015)

Tensor network non-zero testing. - Sevag Gharibian; Zeph Landau; Seung Woo Shin; Guoming Wang (Quantum Inf. Comput., 2015)

Quantum Approximation of the Jones Polynomial. - Zeph Landau (Encyclopedia of Algorithms, 2016)

Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. - Itai Arad; Zeph Landau; Umesh V. Vazirani; Thomas Vidick (ITCS, 2017)

Noise and the Frontier of Quantum Supremacy. - Adam Bouland; Bill Fefferman; Zeph Landau; Yunchao Liu 002 (FOCS, 2021)

Distributed Quantum inner product estimation. - Anurag Anshu; Zeph Landau; Yunchao Liu 002 (STOC, 2022)

On Eigenvalue Gaps of Integer Matrices. - Aaron Abrams; Zeph Landau; Jamie Pommersheim; Nikhil Srivastava (CoRR, 2022)

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. - Dorit Aharonov; Xun Gao; Zeph Landau; Yunchao Liu 002; Umesh V. Vazirani (STOC, 2023)

Learning Shallow Quantum Circuits. - Hsin-Yuan Huang; Yunchao Liu 002; Michael Broughton; Isaac Kim 001; Anurag Anshu; Zeph Landau; Jarrod R. McClean (STOC, 2024)

Beating Grover search for low-energy estimation and state preparation. - Harry Buhrman; Sevag Gharibian; Zeph Landau; François Le Gall; Norbert Schuch; Suguru Tamaki (CoRR, 2024)

Learning the Closest Product State. - Ainesh Bakshi; John Bostanci; William Kretschmer; Zeph Landau; Jerry Li 001; Allen Liu; Ryan O'Donnell; Ewin Tang (STOC, 2025)

Learning Quantum States Prepared by Shallow Circuits in Polynomial Time. - Zeph Landau; Yunchao Liu 002 (STOC, 2025)