research
∙
10/06/2022
NLTS Hamiltonians from classical LTCs
We provide a completely self-contained construction of a family of NLTS ...
share
research
∙
06/27/2022
NLTS Hamiltonians from good quantum codes
The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastin...
research
∙
02/16/2022
The Parameterized Complexity of Quantum Verification
We initiate the study of parameterized complexity of problems in terms ...
research
∙
11/04/2021
Quantum search-to-decision reductions and the state synthesis problem
It is a useful fact in classical computer science that many search probl...
research
∙
11/03/2020
Circuit lower bounds for low-energy states of quantum code Hamiltonians
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hasti...
research
∙
03/12/2018