Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
From MaRDI portal
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.
Recommendations
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Realizable Hamiltonians for universal adiabatic quantum computers
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
- scientific article; zbMATH DE number 1984609
Cited in
(7)- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Max-independent set and the quantum alternating operator ansatz
- Low depth quantum circuits for Ising models
- Suppressing weak Ising couplings: tailored gates for quantum computation
- 2D Ising model with competing interactions and its application to clusters and arrays of \(\pi \)-rings, graphene and adiabatic quantum computing
- Resource efficient gadgets for compiling adiabatic quantum optimization problems
- Entangling problem Hamiltonian for adiabatic quantum computation
This page was built for publication: Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573088)
