scientific article

zbMath1241.81040arXiv1010.1221MaRDI QIDQ3104215

Vicky Choi

Publication date: 19 December 2011

Full work available at URL: https://arxiv.org/abs/1010.1221

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

zbMATH Keywords

NP-completeexact covermaximum independent setadiabatic quantum algorithmsadiabatic quantum optimization3SAT

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

The improved evolution paths to speedup quantum evolution ⋮ The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization ⋮ Quantum alternating operator ansatz for solving the minimum exact cover problem ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Embedding equality constraints of optimization problems into a quantum annealer ⋮ Entangling problem Hamiltonian for adiabatic quantum computation

This page was built for publication: