645 citations · 6.4k across the 135 of their papers we have counts for
135 papers
What makes math problems hard for reinforcement learning: a case study
Ali Shehper, Anibal M. Medina-Mardones, Lucas Fagan +6
Using a long-standing conjecture from combinatorial group theory, we explore, from multiple perspectives, the challenges of finding rare instances carrying disproportionately high…
Fault-Tolerant Hastings-Haah Codes in the Presence of Dead Qubits
David Aasen, Jeongwan Haah, Parsa Bonderson +2
We develop protocols for Hastings-Haah Floquet codes in the presence of dead qubits.
On Topology of the Moduli Space of Gapped Hamiltonians for Topological Phases
Po-Shen Hsin, Zhenghan Wang
The moduli space of gapped Hamiltonians that are in the same topological phase is an intrinsic object that is associated to the topological order. The topology of these moduli spac…
Ground state degeneracy of the Ising cage-net model
Xiuqi Ma, Ananth Malladi, Zongyuan Wang +2
The Ising cage-net model, first proposed in Phys. Rev. X 9, 021010 (2019), is a representative type I fracton model with nontrivial non-abelian features. In this paper, we calculat…
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…
Reconstruction of modular data from representations
Siu-Hung Ng, Eric C Rowell, Zhenghan Wang +1
Modular data is the most significant invariant of a modular tensor category. We pursue an approach to the classification of modular data of modular tensor categories by building th…