4 papers · 1 filter
Hardness of recognizing phases of matter
Thomas Schuster, Dominik Kufel, Norman Y. Yao +1
We prove that recognizing the phase of matter of an unknown quantum state is quantum computationally hard. More specifically, we show that the quantum computational time of any pha…
Cooling the Sachdev-Ye-Kitaev model using thermofield double states
Thomas Schuster, Bryce Kobrin, Vincent P. Su +2
We analyze a simple and efficient experimental protocol to cool the Sachdev-Ye-Kitaev (SYK) model to low temperatures. The protocol utilizes local couplings between two copies of a…
A polynomial-time classical algorithm for noisy quantum circuits
Thomas Schuster, Chao Yin, Xun Gao +1
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average er…
Fracton models from product codes
Yi Tan, Brenden Roberts, Nathanan Tantivasadakarn +2
We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the re…