728 citations · 13.6k across the 152 of their papers we have counts for
153 papers
Entanglement of Sections, Examples Looking for a Theory
M. H. Freedman, M. B. Hastings
Quantum information is about the entanglement of states. To this starting point we add parameters whereby a single state becomes a non-vanishing section of a bundle. We consider th…
Perturbation Theory and the Sum of Squares
Matthew B. Hastings
The sum-of-squares (SoS) hierarchy is a powerful technique based on semi-definite programming that can be used for both classical and quantum optimization problems. This hierarchy…
Adiabatic paths of Hamiltonians, symmetries of topological order, and automorphism codes
David Aasen, Zhenghan Wang, Matthew B. Hastings
The recent "honeycomb code" is a fault-tolerant quantum memory defined by a sequence of checks which implements a nontrivial automorphism of the toric code. We argue that a general…
Performance of planar Floquet codes with Majorana-based qubits
Adam Paetznick, Christina Knapp, Nicolas Delfosse +4
Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the mos…
On Lieb-Robinson Bounds for the Double Bracket Flow
Matthew B. Hastings
We consider the possibility of developing a Lieb-Robinson bound for the double bracket flow. This is a differential equation which may be used t…
A Classical Algorithm Which Also Beats For High Girth MAX-CUT
Matthew B. Hastings
We give a simple classical algorithm which provably achieves the performance in the title. The algorithm is a simple modification of the Gaussian wave process.