Classical and quantum tensor product expanders. - Matthew B. Hastings; Aram W. Harrow (Quantum Inf. Comput., 2009)

Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture. - Matthew B. Hastings (Quantum Inf. Comput., 2013)

Obstructions to classically simulating the quantum adiabatic algorithm. - Matthew B. Hastings (Quantum Inf. Comput., 2013)

Homological product codes. - Sergey Bravyi 001; Matthew B. Hastings (STOC, 2014)

Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs. - Michael H. Freedman; Matthew B. Hastings (Quantum Inf. Comput., 2014)

Decoding in hyperbolic spaces: quantum LDPC codes with linear rate and efficient error correction. - Matthew B. Hastings (Quantum Inf. Comput., 2014)

Faster phase estimation. - Krysta M. Svore; Matthew B. Hastings; Michael H. Freedman (Quantum Inf. Comput., 2014)

Partial Reinitialisation for Optimisers. - Ilia N. Zintchenko; Matthew B. Hastings; Nathan Wiebe; Ethan Brown; Matthias Troyer (CoRR, 2015)

Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas. - Matthew B. Hastings; Alan Geller (Quantum Inf. Comput., 2015)

Improving quantum algorithms for quantum chemistry. - Matthew B. Hastings; Dave Wecker; Bela Bauer; Matthias Troyer (Quantum Inf. Comput., 2015)

The Trotter step size required for accurate quantum simulation of quantum chemistry. - David Poulin; Matthew B. Hastings; Dave Wecker; Nathan Wiebe; Andrew C. Doherty; Matthias Troyer (Quantum Inf. Comput., 2015)

Random MERA states and the tightness of the Brandao-Horodecki entropy bound. - Matthew B. Hastings (Quantum Inf. Comput., 2016)

Quantum Codes from High-Dimensional Manifolds. - Matthew B. Hastings (ITCS, 2017)

Turning gate synthesis errors into incoherent errors. - Matthew B. Hastings (Quantum Inf. Comput., 2017)

Small Majorana fermion codes. - Matthew B. Hastings (Quantum Inf. Comput., 2017)

Weight reduction for quantum codes. - Matthew B. Hastings (Quantum Inf. Comput., 2017)

Magic state distillation with low space overhead and optimal asymptotic input count. - Jeongwan Haah; Matthew B. Hastings; David Poulin; Dave Wecker (Quantum, 2017)

Local Maxima and Improved Exact Algorithm for MAX-2-SAT. - Matthew B. Hastings (Chic. J. Theor. Comput. Sci., 2018)

Magic state distillation at intermediate size. - Jeongwan Haah; Matthew B. Hastings; David Poulin; Dave Wecker (Quantum Inf. Comput., 2018)

Codes and Protocols for DistillingT, controlled-S, and Toffoli Gates. - Jeongwan Haah; Matthew B. Hastings (Quantum, 2018)

A Short Path Quantum Algorithm for Exact Optimization. - Matthew B. Hastings (Quantum, 2018)

Classical and quantum bounded depth approximation algorithms. - Matthew B. Hastings (Quantum Inf. Comput., 2019)

The Short Path Algorithm Applied to a Toy Model. - Matthew B. Hastings (Quantum, 2019)

Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad. - Matthew B. Hastings (Quantum, 2019)

Fiber Bundle Codes: Breaking the N1/2 polylog(N) Barrier for Quantum LDPC Codes. - Matthew B. Hastings; Jeongwan Haah; Ryan O'Donnell (CoRR, 2020)

Classical and Quantum Algorithms for Tensor Principal Component Analysis. - Matthew B. Hastings (Quantum, 2020)

(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem. - András Gilyén; Matthew B. Hastings; Umesh V. Vazirani (STOC, 2021)

Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes. - Matthew B. Hastings; Jeongwan Haah; Ryan O'Donnell (STOC, 2021)

A Classical Algorithm Which Also Beats 1/2 + 2/π 1/√D For High Girth MAX-CUT. - Matthew B. Hastings (CoRR, 2021)

Union-Find Decoders For Homological Product Codes. - Nicolas Delfosse; Matthew B. Hastings (Quantum, 2021)

How Dynamical Quantum Memories Forget. - Lukasz Fidkowski; Jeongwan Haah; Matthew B. Hastings (Quantum, 2021)

Symmetry Protected Quantum Computation. - Michael H. Freedman; Matthew B. Hastings; Modjtaba Shokrian Zini (Quantum, 2021)

Measurement sequences for magic state distillation. - Jeongwan Haah; Matthew B. Hastings (Quantum, 2021)

The Power of Adiabatic Quantum Computation with No Sign Problem. - Matthew B. Hastings (Quantum, 2021)

Dynamically Generated Logical Qubits. - Matthew B. Hastings; Jeongwan Haah (Quantum, 2021)

Optimizing strongly interacting fermionic Hamiltonians. - Matthew B. Hastings; Ryan O'Donnell (STOC, 2022)

Boundaries for the Honeycomb Code. - Jeongwan Haah; Matthew B. Hastings (Quantum, 2022)

Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. - Jeongwan Haah; Matthew B. Hastings; Robin Kothari; Guang Hao Low (SIAM J. Comput., 2023)