The travelling salesman problem and adiabatic quantum computation: an algorithm (Q670009): Difference between revisions

@@ Property / DOI @@
-.1007/s11128-019-2206-9
@@ Property / DOI: 10.1007/s11128-019-2206-9 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.07859
@@ Property / arXiv ID: 1801.07859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Computation and Quantum Information
@@ Property / cites work: Quantum Computation and Quantum Information / rank @@
+Normal rank
@@ Property / cites work @@
+Performance of two different quantum annealing correction codes
+Normal rank
@@ Property / cites work @@
+The travelling salesman problem and adiabatic quantum computation: an algorithm
+Normal rank
@@ Property / cites work @@
+Q3286217
@@ Property / cites work: Q3286217 / rank @@
+Normal rank
@@ Property / cites work @@
+Energy and efficiency of adiabatic quantum search algorithms
+Normal rank
@@ Property / cites work @@
+Maximum speedup in quantum search: \(O\)(1) running time
+Normal rank
@@ Property / cites work @@
+Q3522370
@@ Property / cites work: Q3522370 / rank @@
+Normal rank
@@ Property / cites work @@
+QUANTUM PHASE TRANSITIONS AND ENTANGLEMENT IN J<sub>1</sub>–J<sub>2</sub> MODEL
+Normal rank
@@ Property / DOI @@
+.1007/S11128-019-2206-9
@@ Property / DOI: 10.1007/S11128-019-2206-9 / rank @@
+Normal rank