Integer programming techniques for minor-embedding in quantum annealers

DOI10.1007/978-3-030-58942-4_8MaRDI QIDQ2110393zbMATH OpenOpenAlexFDO

Authors David E. Bernal, Kyle E. C. Booth, Raouf Dridi, Hedayat Alghassi, Sridhar R. Tayur, Davide Venturelli

Publication date 21 December 2022

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

zbMATH Keywords

algebraic geometrydecompositiongraph minorsinteger programmingquantum annealers

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cited in

(5)

• Embedding equality constraints of optimization problems into a quantum annealer
• Mapping a logical representation of TSP to quantum annealing
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Integer programming techniques for minor-embedding in quantum annealers
• A binary integer programming-based method for qubit mapping in sparse architectures

This page was built for publication: Integer programming techniques for minor-embedding in quantum annealers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2110393)