| Publication | Date of Publication | Type |
|---|
| Two combinatorial MA-complete problems | 2026-04-15 | Paper |
Hamiltonian complexity in the thermodynamic limit
Journal of the ACM | 2026-01-22 | Paper |
| Stoquastic PCP vs. randomness | 2025-08-12 | Paper |
| Local tests of global entanglement and a counterexample to the generalized area law | 2025-08-05 | Paper |
| Translationally invariant constraint optimization problems | 2024-11-19 | Paper |
| A polynomial-time classical algorithm for noisy random circuit sampling | 2024-05-08 | Paper |
Hamiltonian complexity in the thermodynamic limit
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On the complexity of two dimensional commuting local Hamiltonians
(available as arXiv preprint) | 2023-04-26 | Paper |
Hamiltonian sparsification and gap-simulation
(available as arXiv preprint) | 2022-07-18 | Paper |
The BQP-hardness of approximating the Jones polynomial
New Journal of Physics | 2020-11-24 | Paper |
On quantum advantage in information theoretic single-server PIR
(available as arXiv preprint) | 2020-02-04 | Paper |
| How the High-energy Part of the Spectrum Affects the Adiabatic Computation Gap | 2019-06-06 | Paper |
A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
SIAM Journal on Computing | 2016-05-12 | Paper |
Quantum locally testable codes
SIAM Journal on Computing | 2015-11-04 | Paper |
The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
Quantum Information Processing | 2015-04-13 | Paper |
Quantum walks on graphs
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
The detectability lemma and quantum gap amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A polynomial quantum algorithm for approximating the Jones polynomial
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Quantum bit escrow
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The power of quantum systems on a line
Communications in Mathematical Physics | 2009-09-25 | Paper |
A polynomial quantum algorithm for approximating the Jones polynomial
Algorithmica | 2009-08-31 | Paper |
Fault-Tolerant Quantum Computation with Constant Error Rate
SIAM Journal on Computing | 2009-08-20 | Paper |
Lattice problems in NP ∩ coNP
Journal of the ACM | 2008-12-21 | Paper |
Adiabatic quantum computation is equivalent to standard quantum computation
SIAM Review | 2008-12-16 | Paper |
Adiabatic Quantum State Generation
SIAM Journal on Computing | 2008-03-28 | Paper |
Adiabatic quantum computation is equivalent to standard quantum computation
SIAM Journal on Computing | 2008-03-28 | Paper |
scientific article; zbMATH DE number 1775384 (Why is no real title available?)
(available as arXiv preprint) | 2002-08-01 | Paper |
scientific article; zbMATH DE number 1559533 (Why is no real title available?)
(available as arXiv preprint) | 2001-02-28 | Paper |
