Hybrid quantum-classical algorithms for approximate graph coloring
暂无分享,去创建一个
[1] Greg Mohler,et al. Bridging Classical and Quantum with SDP initialized warm-starts for QAOA , 2020 .
[2] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[3] E. Farhi,et al. A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.
[4] F. Brandão,et al. For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances , 2018, 1812.04170.
[5] D. Welsh,et al. A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .
[6] Lin Lin,et al. Policy Gradient based Quantum Approximate Optimization Algorithm , 2020, MSML.
[7] Robert Koenig,et al. Obstacles to Variational Quantum Optimization from Symmetry Protection. , 2019, Physical review letters.
[8] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[9] Majid Sarrafzadeh,et al. Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications , 1998, IEEE Trans. Computers.
[10] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[11] Ryan Babbush,et al. Barren plateaus in quantum neural network training landscapes , 2018, Nature Communications.
[12] Ilya Safro,et al. Multistart Methods for Quantum Approximate optimization , 2019, 2019 IEEE High Performance Extreme Computing Conference (HPEC).
[13] Cristopher Moore,et al. MAX k‐CUT and approximating the chromatic number of random graphs , 2003, Random Struct. Algorithms.
[14] Jakub Marecek,et al. Warm-starting quantum optimization , 2020, Quantum.
[15] David P. Williamson,et al. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming , 2001, STOC '01.
[16] Nicholas C. Wormald,et al. The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.
[17] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[18] D. V. Pasechnik,et al. On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function , 2002 .
[19] Masoud Mohseni,et al. Low-Depth Mechanisms for Quantum Optimization , 2020, PRX Quantum.
[20] Alantha Newman. Complex Semidefinite Programming and Max-k-Cut , 2018, SOSA@SODA.
[21] Paul M. B. Vitányi. How well can a graph be n-colored? , 1981, Discret. Math..
[22] David Gamarnik,et al. The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples , 2020, 2005.08747.
[23] Blake R. Johnson,et al. Unsupervised Machine Learning on a Hybrid Quantum Computer , 2017, 1712.05771.