Template-Based Minor Embedding for Adiabatic Quantum Optimization

DOI10.1287/ijoc.2021.1065OpenAlexW3199551301MaRDI QIDQ5084660

No author found.

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

integer linear programmingquantum annealingadiabatic quantum computingminor embeddingquadratic unconstrained binary optimizationChimera graph

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Embedding of complete graphs in broken Chimera graphs

Cites Work

• Unnamed Item
• Fast clique minor generation in Chimera qubit connectivity graphs
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Efficiently embedding QUBO problems on adiabatic quantum computers
• Pseudo-Boolean optimization
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Quadratic functions with exponential number of local maxima
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework
• Boosting quantum annealer performance via sample persistence
• Systematic and deterministic graph minor embedding for Cartesian products of graphs
• A brief history of linear and mixed-integer programming computation
• Hard combinatorial problems and minor embeddings on lattice graphs
• Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
• Adiabatic quantum programming: minor embedding with hard faults
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• The diameter of a long-range percolation graph
• Canonical Cuts on the Unit Hypercube
• The NP-completeness column: An ongoing guide

This page was built for publication: Template-Based Minor Embedding for Adiabatic Quantum Optimization