Fetching the paper…
Reading the bibliography…
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry.
Quantum Mechanics:Volume 2 (North-Holland Publishing Company, 1962)
Messiah, A · 1962
Earlier work this paper cites.
Reducibility among Combinatorial Problems: Proceedings of a symposium on the Complexity of Computer Computations 85–103 (1972)
Karp, R. M · 1972
Earlier work this paper cites.
On the computational complexity of ising spin glass models
Barahona, F · 1982
Earlier work this paper cites.
Optimization by simulated annealing
Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P · 1983
Earlier work this paper cites.
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A. B., Gomez, M. A., Sebenik, C., Stenson, C. & Doll, J. D · 1994
Earlier work this paper cites.
Quantum annealing in the transverse ising model
Kadowaki, T. & Nishimori, H · 1998
Earlier work this paper cites.
Quantum computation by adiabatic evolution
Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M · 2000
Earlier work this paper cites.
A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability
Farhi, E., Goldstone, J. & Gutmann, S · 2000
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Farhi, E. et al · 2001
Earlier work this paper cites.
Quantum adiabatic evolution algorithms versus simulated annealing
Farhi, E., Goldstone, J. & Gutmann, S · 2002
Earlier work this paper cites.
Theory of quantum annealing of an Ising spin glass
Santoro, G. E., Martoňák, R., Tosatti, E. & Car, R · 2002
Earlier work this paper cites.
Finding cliques by quantum adiabatic evolution
Childs, A. M., Farhi, E., Goldstone, J. & Gutmann, S · 2002
Earlier work this paper cites.
Quantum search by local adiabatic evolution
Roland, J. & Cerf, N. J · 2002
Earlier work this paper cites.
Haplotyping populations by pure parsimony: Complexity, exact and approximation algorithms
Lancia, G., Pinotti, C. M. & Rizzi, R · 2004
Earlier work this paper cites.
Quantum annealing and related optimization methods , vol. 679 (Springer Science & Business Media, 2005)
Das, A. & Chakrabarti, B. K · 2005
Earlier work this paper cites.
The Set Cover with Pairs Problem
Hassin, R. & Segev, D · 2005
Earlier work this paper cites.
Quantum annealing and analog quantum computation
Das, A. & Chakrabarti, B. K · 2008
Earlier work this paper cites.
Quantum adiabatic algorithm for factorization and its experimental implementation
Peng, X. et al · 2008
Earlier work this paper cites.
Training a binary classifier with the quantum adiabatic algorithm (2008)
Neven, H., Denchev, V. S., Rose, G. & Macready, W. G · 2008
Earlier work this paper cites.
Nonperturbative k-body to two-body commuting conversion hamiltonians and embedding problem instances into ising spins
Biamonte, J. D · 2008
Earlier work this paper cites.
Minor-embedding in adiabatic quantum computation: I. The Parameter setting problem
Choi, V · 2008
Earlier work this paper cites.
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R. et al · 2010
Earlier work this paper cites.
Choi, V · 2010
Earlier work this paper cites.
BQP and the polynomial hierarchy
Aaronson, S · 2010
Cited alongside, same era.
Quantum annealing with manufactured spins
Johnson, M. W. et al · 2011
Cited alongside, same era.
Disjoint-path Facility Location: Theory and Practice
Breslau, L. et al · 2011
Cited alongside, same era.
Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics
Wang, I.-L. & Yang, H.-E · 2011
Cited alongside, same era.
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Choi, V · 2011
Cited alongside, same era.
Solving the graph-isomorphism problem with a quantum annealer
Hen, I. & Young, A. P · 2012
Cited alongside, same era.
Hearing the shape of the ising model with a programmable superconducting-flux annealer
Vinci, W. et al · 2014
Later among the works it cites.
How “quantum” is the D-Wave machine? (2014)
Shin, S. W., Smith, G., Smolin, J. A. & Vazirani, U · 2014
Later among the works it cites.
Algorithm engineering for a quantum annealing platform (2014)
King, A. D. & McGeoch, C. C · 2014
Later among the works it cites.
Quantum and classical in adiabatic computation
Crowley, P. J. D., Duric, T., Vinci, W., Warburton, P. A. & Green, A. G · 2014
Later among the works it cites.
Quantum versus classical annealing of ising spin glasses
Heim, B., Rønnow, T. F., Isakov, S. V. & Troyer, M · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Denchev, V. S., Ding, N., Vishwanathan, S. & Neven, H · 2012
Cited alongside, same era.
Adiabatic quantum algorithm for search engine ranking
Garnerone, S., Zanardi, P. & Lidar, D. A · 2012
Cited alongside, same era.
Quantum Speedup by Quantun Annealing
Nagaj, D., Somma, R. D. & Kieferova, M · 2012
Cited alongside, same era.
Exact and heuristic approaches for the set cover with pairs problem
Gonçalves, L. B., de Lima Martins, S., Ochi, L. S. & Subramanian, A · 2012
Cited alongside, same era.
Adiabatic quantum programming: Minor embedding with hard faults (2012)
Klymko, C., Sullivan, B. D. & Humble, T. S · 2012
Cited alongside, same era.
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G. & Aspuru-Guzik, A · 2012
Cited alongside, same era.
Gaitan, F. & Clark, L · 2014
Later among the works it cites.
Different strategies for optimization using the quantum adiabatic algorithm (2014)
Crosson, E., Farhi, E., Lin, C. Y.-Y., Lin, H.-H. & Shor, P · 2014
Later among the works it cites.
Discrete optimization using quantum annealing on sparse ising models
Bian, Z. et al · 2014
Later among the works it cites.
Consistency tests of classical and quantum models for a quantum annealer
Albash, T., Vinci, W., Mishra, A., Warburton, P. A. & Lidar, D. A · 2015
Later among the works it cites.
Quantum optimization of fully-connected spin glasses
Venturelli, D. et al · 2015
Later among the works it cites.
Quantum annealing correction with minor embedding
Vinci, W., Albash, T., Paz-Silva, G., Hen, I. & Lidar, D. A · 2015
Later among the works it cites.
Reexamining classical and quantum models for the D-Wave One processor
Albash, T., Rønnow, T. F., Troyer, M. & Lidar, D. A · 2015
Later among the works it cites.
Probing for quantum speedup in spin glass problems with planted solutions
Hen, I. et al · 2015
Later among the works it cites.
Heavy tails in the distribution of time-to-solution for classical and quantum annealing
Steiger, D. S., Rønnow, T. F. & Troyer, M · 2015
Later among the works it cites.
Entanglement as a resource in adiabatic quantum optimization (2015)
Bauer, B., Wang, L., Pižorn, I. & Troyer, M · 2015
Later among the works it cites.
Reexamination of the evidence for entanglement in the d-wave processor
Albash, T., Hen, I., Spedalieri, F. M. & Lidar, D. A · 2015
Later among the works it cites.
Seeking quantum speedup through spin glasses: The good, the bad, and the ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J. & Munoz-Bauza, H · 2015
Later among the works it cites.
Perdomo-Ortiz, A., O’Gorman, B., Fluegemann, J., Biswas, R. & Smelyanskiy, V. N · 2015
Later among the works it cites.
Nested quantum annealing correction arXiv:1511.07084 [quant–ph] (2015)
Vinci, W., Albash, T. & Lidar, D. A · 2015
Later among the works it cites.
What is the computational value of finite range tunneling? (2015)
Denchev, V. S. et al · 2015
Later among the works it cites.
Optimised simulated annealing for ising spin glasses
Isakov, S. V., Zintchenko, I. N., Ronnow, T. F. & Troyer, M · 2015
Later among the works it cites.
Maximum-entropy inference with a programmable annealer
Chancellor, N., Szoke, S., Vinci, W., Aeppli, G. & Warburton, P. A · 2016
Closest in time.