scientific article

DOI10.4086/toc.2013.v009a002zbMath1366.68073OpenAlexW2403315016MaRDI QIDQ3191569

Daniel Gottesman, Sandy Irani

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2013.v009a002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum Hamiltonian complexitytiling complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete ⋮ Universal qudit Hamiltonians ⋮ The complexity of translationally invariant spin chains with low local dimension ⋮ The complexity of translationally invariant low-dimensional spin lattices in 3D ⋮ Unnamed Item ⋮ Perturbation gadgets: arbitrary energy scales from a single strong interaction ⋮ Translationally invariant universal quantum Hamiltonians in 1D

Cites Work

• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES

This page was built for publication: