Template-Based Minor Embedding for Adiabatic Quantum Optimization
From MaRDI portal
Publication:5084660
Recommendations
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Hard combinatorial problems and minor embeddings on lattice graphs
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Solving larger maximum clique problems using parallel quantum annealing
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
Cites work
- A brief history of linear and mixed-integer programming computation
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Adiabatic quantum programming: minor embedding with hard faults
- Boosting quantum annealer performance via sample persistence
- Canonical Cuts on the Unit Hypercube
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Fast clique minor generation in Chimera qubit connectivity graphs
- Graph theory
- Hard combinatorial problems and minor embeddings on lattice graphs
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Pseudo-Boolean optimization
- Quadratic functions with exponential number of local maxima
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The diameter of a long-range percolation graph
- The NP-completeness column: An ongoing guide
Cited in
(4)
This page was built for publication: Template-Based Minor Embedding for Adiabatic Quantum Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084660)
