THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP

DOI10.1142/S021974990300022XzbMath1069.81522arXivquant-ph/0301087OpenAlexW2082633275MaRDI QIDQ4819278

Thomas Beth, Paweł Wocjan

Publication date: 24 September 2004

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0301087

zbMATH Keywords

NPQMAQuantum complexity theory

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity of computation (including implicit computational complexity) (03D15) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem

Cites Work

• Some simplified NP-complete graph problems
• Unnamed Item

This page was built for publication: THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP