Pages that link to "Item:Q2018131"
From MaRDI portal
The following pages link to A case study in programming a quantum annealer for hard operational planning problems (Q2018131):
Displayed 27 items.
- 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)
- Practical integer-to-binary mapping for quantum annealers (Q670020) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← 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)
- A subgradient approach for constrained binary optimization via quantum adiabatic evolution (Q1699979) (← links)
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers (Q1790350) (← links)
- Biclustering with a quantum annealer (Q1800360) (← links)
- Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
- The potential of quantum annealing for rapid solution structure identification (Q2074663) (← 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)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Privacy-enhanced multi-user quantum private data query using partial quantum homomorphic encryption (Q2239576) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Minimizing minor embedding energy: an application in quantum annealing (Q2681521) (← links)
- Models in quantum computing: a systematic review (Q2687125) (← links)
- Embedding of complete graphs in broken Chimera graphs (Q2690529) (← links)
- Quantum Computing Meets the Real World (Q2945557) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Inter-generational comparison of quantum annealers in solving hard scheduling problems (Q6048743) (← links)
- Statistical Analysis of Quantum Annealing (Q6092954) (← links)
- Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)