Systematic and deterministic graph minor embedding for Cartesian products of graphs

DOI10.1007/s11128-017-1569-zzbMath1373.81160arXiv1602.04274OpenAlexW2963711262MaRDI QIDQ1679291

Dominic J. J. Marchand, Arman Zaribafiyan, Seyed Saeed Changiz Rezaei

Publication date: 9 November 2017

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

Cartesian productquantum annealingchip architecturegraph minor embedding

Mathematics Subject Classification ID

Quantum computation (81P68) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Template-Based Minor Embedding for Adiabatic Quantum Optimization ⋮ Boosting quantum annealer performance via sample persistence ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ Embedding of complete graphs in broken Chimera graphs ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Hard combinatorial problems and minor embeddings on lattice graphs

Uses Software

• ComputeTW

Cites Work

• Unnamed Item
• Fast clique minor generation in Chimera qubit connectivity graphs
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Faster parameterized algorithms for minor containment
• Recognizing Cartesian products in linear time
• Achievable sets, brambles, and sparse treewidth obstructions
• Treewidth computations. I: Upper bounds
• Graph searching and a min-max theorem for tree-width
• Linear and quadratic programming approaches for the general graph partitioning problem
• A case study in programming a quantum annealer for hard operational planning problems
• On tree width, bramble size, and expansion
• The problem of the rooks and its applications
• Graph Partitioning and Continuous Quadratic Programming

This page was built for publication: Systematic and deterministic graph minor embedding for Cartesian products of graphs