Zeph Landau

Affiliations:
  • University of California, Berkeley, USA


According to our database1, Zeph Landau authored at least 29 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Learning shallow quantum circuits.
CoRR, 2024

2023
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
On Eigenvalue Gaps of Integer Matrices.
CoRR, 2022

Distributed Quantum inner product estimation.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Noise and the Frontier of Quantum Supremacy.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2017
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Quantum Approximation of the Jones Polynomial.
Encyclopedia of Algorithms, 2016

2015
Tensor network non-zero testing.
Quantum Inf. Comput., 2015

Quantum Hamiltonian Complexity.
Found. Trends Theor. Comput. Sci., 2015

2014
Fair Division and Redistricting.
CoRR, 2014

Quantum Hamiltonian Complexity.
CoRR, 2014

An efficient algorithm for finding the ground state of 1D gapped local hamiltonians.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Distributions of Order Patterns of Interval Maps.
Comb. Probab. Comput., 2013

2011
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Quantum Computation and the Evaluation of Tensor Networks.
SIAM J. Comput., 2010

2009
A fair division solution to the problem of redistricting.
Soc. Choice Welf., 2009

A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.
Algorithmica, 2009

The detectability lemma and quantum gap amplification.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Quantum Approximation of the Jones Polynomial.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation.
SIAM Rev., 2008

2007
The Replacement Attack.
IEEE Trans. Speech Audio Process., 2007

Generalized Lempel-Ziv Compression for Audio.
IEEE Trans. Speech Audio Process., 2007

2005
Parameter analysis for GLZ audio compression.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Parameter Analysis for the Generalized LZ Compression of Audio.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004
Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem.
Electron. J. Comb., 2004

Randomizing the replacement attack.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

2003
Deficits and Excesses of Frames.
Adv. Comput. Math., 2003

2002
Evasive random walks and the clairvoyant demon.
Random Struct. Algorithms, 2002


  Loading...