The following pages link to (Q3001461):
Displaying 14 items.
- The complexity of translationally invariant spin chains with low local dimension (Q1683948) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- Entanglement subvolume law for 2D frustration-free spin systems (Q2149071) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- Perturbation gadgets: arbitrary energy scales from a single strong interaction (Q2288292) (← links)
- Quantum logic is undecidable (Q2663337) (← links)
- Total functions in QMA (Q2684235) (← links)
- Complexity Classification of Local Hamiltonian Problems (Q2799351) (← links)
- Quantum 3-SAT Is QMA$_1$-Complete (Q2816302) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
- The complexity of translationally invariant low-dimensional spin lattices in 3D (Q4599491) (← links)
- Gapped and gapless phases of frustration-free spin-12 chains (Q5264398) (← links)
- The quantum detection of projectors in finite-dimensional algebras and holography (Q6163197) (← links)
