Ferromagnetically Shifting the Power of Pausing
暂无分享,去创建一个
Stuart Hadfield | Eleanor Rieffel | Shon Grabbe | Jeffrey Marshall | Zhihui Wang | Zoe Gonzalez Izquierdo
[1] Vicky Choi. The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization , 2020, Quantum Inf. Process..
[2] Daniel A. Lidar,et al. Evidence for quantum annealing with more than one hundred qubits , 2013, Nature Physics.
[3] R. Car,et al. Theory of Quantum Annealing of an Ising Spin Glass , 2002, Science.
[4] Yan-Long Fang,et al. Minimizing minor embedding energy: an application in quantum annealing , 2019, Quantum Information Processing.
[5] Balaji Raghavachari,et al. Degree-bounded minimum spanning trees , 2004, CCCG.
[6] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[7] Mohit Singh,et al. Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.
[8] G. Passarelli,et al. Improving quantum annealing of the ferromagnetic p -spin model through pausing , 2019, Physical Review B.
[9] R. Ravi,et al. Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.
[10] Bryan O'Gorman,et al. A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.
[11] Samir Khuller,et al. Low-Degree Spanning Trees of Small Weight , 1996, SIAM J. Comput..
[12] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[13] Erio Tosatti,et al. Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model , 2002 .
[14] Michel X. Goemans,et al. Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] Martin Fürer,et al. Approximating the minimum degree spanning tree to within one from the optimal degree , 1992, SODA '92.
[16] J. Doll,et al. Quantum annealing: A new method for minimizing multidimensional functions , 1994, chem-ph/9404003.
[17] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[18] Andrew Lucas,et al. Ising formulations of many NP problems , 2013, Front. Physics.
[19] Andreas Alexander Albrecht,et al. A local search heuristic for bounded-degree minimum spanning trees , 2008 .
[20] Daniel A. Lidar,et al. Why and When Pausing is Beneficial in Quantum Annealing , 2020, Physical Review Applied.
[21] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[22] E. Rieffel,et al. Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers , 2018, Physical Review Applied.
[23] S. Knysh,et al. Quantum Optimization of Fully-Connected Spin Glasses , 2014, 1406.7553.
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[25] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..
[26] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[27] Andreas T. Ernst,et al. Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.
[28] Eleanor G. Rieffel,et al. Perils of embedding for sampling problems , 2020, Physical Review Research.
[29] Kyle Jamieson,et al. Leveraging quantum annealing for large MIMO processing in centralized radio access networks , 2019, SIGCOMM.
[30] Thang Nguyen Bui,et al. An ant-based algorithm for finding degree-constrained minimum spanning tree , 2006, GECCO.
[31] Ray,et al. Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations. , 1989, Physical review. B, Condensed matter.
[32] Xianghua Deng,et al. An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem , 2012, IEEE Transactions on Evolutionary Computation.
[33] Daniel A. Lidar,et al. Experimental signature of programmable quantum annealing , 2012, Nature Communications.
[34] Daniel A. Lidar,et al. Defining and detecting quantum speedup , 2014, Science.