Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing
Abstract
We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by physically reasonable Hamiltonians like short-range interactions.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.