Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830): Difference between revisions

@@ Property / OpenAlex ID @@
-W3098146626
@@ Property / OpenAlex ID: W3098146626 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3098146626
@@ Property / OpenAlex ID: W3098146626 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3116
@@ Property / arXiv ID: 1001.3116 / rank @@
+Normal rank
@@ Property / cites work @@
+Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
+Normal rank
@@ Property / cites work @@
+Q3579480
@@ Property / cites work: Q3579480 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Pseudo-Boolean optimization
@@ Property / cites work: Pseudo-Boolean optimization / rank @@
+Normal rank
@@ Property / cites work @@
+<i>Colloquium</i>: Quantum annealing and analog quantum computation
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
+Normal rank
@@ Property / cites work @@
+Simulating Quantum Computation by Contracting Tensor Networks
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank