Pages that link to "Item:Q1007120"

The following pages link to Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120):

Displaying 33 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)
• Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
• A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
• Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← 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)
• Quantum adiabatic machine learning (Q2393692) (← 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)
• The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization (Q2677153) (← links)
• Minimizing minor embedding energy: an application in quantum annealing (Q2681521) (← links)
• Garden optimization problems for benchmarking quantum annealers (Q2685606) (← links)
• Support vector machines on the D-wave quantum annealer (Q2698831) (← links)
• Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
• Performing fully parallel constraint logic programming on a quantum annealer (Q4559836) (← links)
• QUBO formulation for the contact map overlap problem (Q4620297) (← links)
• Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
• Quantum Annealing versus Digital Computing (Q5102052) (← links)
• A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing (Q5207191) (← links)
• Inter-generational comparison of quantum annealers in solving hard scheduling problems (Q6048743) (← links)
• Optimal sufficient requirements on the embedded Ising problem in polynomial time (Q6073965) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
• Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)