Pages that link to "Item:Q544830"

The following pages link to Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830):

Displaying 25 items.

• Fast clique minor generation in Chimera qubit connectivity graphs (Q265415) (← links)
• A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
• Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (Q669802) (← links)
• Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
• Boosting quantum annealer performance via sample persistence (Q1674555) (← links)
• Enhancing quantum annealing performance for the molecular similarity problem (Q1679285) (← links)
• Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
• Quantum pattern recognition with multi-neuron interactions (Q1746862) (← links)
• Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
• Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
• Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
• Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
• Minimizing minor embedding energy: an application in quantum annealing (Q2681521) (← links)
• Embedding of complete graphs in broken Chimera graphs (Q2690529) (← links)
• QUBO formulation for the contact map overlap problem (Q4620297) (← links)
• Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
• An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
• A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing (Q5207191) (← links)
• Optimal sufficient requirements on the embedded Ising problem in polynomial time (Q6073965) (← links)
• Intersecting longest cycles in Archimedean tilings (Q6174817) (← links)
• Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)