Embedding of complete graphs in broken Chimera graphs
From MaRDI portal
Publication:2690529
DOI10.1007/s11128-021-03168-zOpenAlexW3180994431MaRDI QIDQ2690529
Tobias Stollenwerk, Lukas Schürmann, Elisabeth Lobe
Publication date: 17 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.12720
Related Items (2)
Optimal sufficient requirements on the embedded Ising problem in polynomial time ⋮ Minor embedding in broken chimera and derived graphs is NP-complete
Uses Software
Cites Work
- Fast clique minor generation in Chimera qubit connectivity graphs
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Graph minors. XIII: The disjoint paths problem
- A case study in programming a quantum annealer for hard operational planning problems
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Adiabatic quantum programming: minor embedding with hard faults
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Some Matching Problems for Bipartite Graphs
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- Quantum Annealing versus Digital Computing
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Embedding of complete graphs in broken Chimera graphs
