Quantum Annealing for Constrained Optimization
暂无分享,去创建一个
[1] G. Florio,et al. XX model on the circle , 2008, 0801.1394.
[2] Daniel A. Lidar,et al. Quantum annealing correction with minor embedding , 2015, 1507.02658.
[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[4] Alexander Elgart,et al. The Adiabatic Theorem of Quantum Mechanics , 1998 .
[5] Ryan Babbush,et al. What is the Computational Value of Finite Range Tunneling , 2015, 1512.02206.
[6] Daniel A. Lidar,et al. Adiabatic approximation with exponential accuracy for many-body systems and quantum computation , 2008, 0808.2697.
[7] M. Ruskai,et al. Bounds for the adiabatic approximation with applications to quantum computation , 2006, quant-ph/0603175.
[8] Matthew French,et al. Experimental quantum annealing: case study involving the graph isomorphism problem , 2015, Scientific Reports.
[9] A. Young,et al. Size dependence of the minimum excitation gap in the quantum adiabatic algorithm. , 2008, Physical review letters.
[10] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design , 2010, Quantum Inf. Process..
[11] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[12] Rosenbaum,et al. Quantum annealing of a disordered magnet , 1999, Science.
[13] M. W. Johnson,et al. Tunneling spectroscopy using a probe qubit , 2012, 1210.6310.
[14] A. Young,et al. First-order phase transition in the quantum adiabatic algorithm. , 2009, Physical review letters.
[15] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[16] Tosio Kato. On the Adiabatic Theorem of Quantum Mechanics , 1950 .
[17] Jeremy Frank,et al. Parametrized Families of Hard Planning Problems from Phase Transitions , 2014, AAAI.
[18] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[19] Bryan O'Gorman,et al. A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.
[20] Itay Hen,et al. Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[21] E. Lieb,et al. Two Soluble Models of an Antiferromagnetic Chain , 1961 .
[22] L. Clark,et al. Ramsey numbers and adiabatic quantum computing. , 2011, Physical review letters.
[23] Lane H. Clark,et al. Graph isomorphism and adiabatic quantum computing , 2013, ArXiv.
[24] I. Hen. Excitation gap from optimized correlation functions in quantum Monte Carlo simulations. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[25] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..
[26] Andrew Lucas,et al. Ising formulations of many NP problems , 2013, Front. Physics.
[27] M. W. Johnson,et al. Quantum annealing with manufactured spins , 2011, Nature.
[28] J. Doll,et al. Quantum annealing: A new method for minimizing multidimensional functions , 1994, chem-ph/9404003.