Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986): Difference between revisions

@@ Property / cites work @@
+A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
+Normal rank
@@ Property / cites work @@
+Quantum versus classical annealing of Ising spin glasses
+Normal rank
@@ Property / cites work @@
+Anderson localization makes adiabatic quantum optimization fail
+Normal rank
@@ Property / cites work @@
+Pseudo-Boolean optimization
@@ Property / cites work: Pseudo-Boolean optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A case study in programming a quantum annealer for hard operational planning problems
+Normal rank
@@ Property / cites work @@
+Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
+Normal rank
@@ Property / cites work @@
+Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for minor containment
+Normal rank
@@ Property / cites work @@
+Systematic and deterministic graph minor embedding for Cartesian products of graphs
+Normal rank
@@ Property / cites work @@
+Fast clique minor generation in Chimera qubit connectivity graphs
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the number partitioning problem
+Normal rank
@@ Property / cites work @@
+Phase Transition in the Number Partitioning Problem
+Normal rank
@@ Property / cites work @@
+Where are the hard knapsack problems?
@@ Property / cites work: Where are the hard knapsack problems? / rank @@
+Normal rank
@@ Property / cites work @@
+Random-energy model: An exactly solvable model of disordered systems
+Normal rank