Local Hamiltonians with no low-energy stabilizer states

02/28/2023
by   Nolan J. Coble, et al.
0

The recently-defined No Low-energy Sampleable States (NLSS) conjecture of Gharibian and Le Gall [GL22] posits the existence of a family of local Hamiltonians where all states of low-enough constant energy do not have succinct representations allowing perfect sampling access. States that can be prepared using only Clifford gates (i.e. stabilizer states) are an example of sampleable states, so the NLSS conjecture implies the existence of local Hamiltonians whose low-energy space contains no stabilizer states. We describe families that exhibit this requisite property via a simple alteration to local Hamiltonians corresponding to CSS codes. Our method can also be applied to the recent NLTS Hamiltonians of Anshu, Breuckmann, and Nirkhe [ABN22], resulting in a family of local Hamiltonians whose low-energy space contains neither stabilizer states nor trivial states. We hope that our techniques will eventually be helpful for constructing Hamiltonians which simultaneously satisfy NLSS and NLTS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2022

NLTS Hamiltonians from good quantum codes

The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastin...
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/06/2019

Characterizing 3-sets in Union-Closed Families

A family of sets is union-closed (UC) if the union of any two sets in th...
research
07/25/2023

Fermionic Hamiltonians without trivial low-energy states

We construct local fermionic Hamiltonians with no low-energy trivial sta...
research
05/26/2018

On the non-existence of linear perfect Lee codes: The Zhang-Ge condition and a new polynomial criterion

The Golomb-Welch conjecture (1968) states that there are no e-perfect Le...
research
11/25/2021

The Implicit Graph Conjecture is False

An efficient implicit representation of an n-vertex graph G in a family ...
research
10/11/2018

The algorithmic hardness threshold for continuous random energy models

We prove an algorithmic hardness result for finding low-energy states in...

Please sign up or login with your details

Forgot password? Click here to reset