|
[1] P. W. Shor, \Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM review, 1999.
[2] E. Farhi, J. Goldstone, and S. Gutmann, \A quantum approximate optimization algorithm," arXiv.org preprint arXiv:1411.4028, 2014.
[3] S. Hadeld, Z. Wang, E. G. Rieel, B. O'Gorman, D. Venturelli, and R. Biswas, Quantum approximate optimization with hard and soft constraints," 2017.
[4] I. Hen and M. S. Sarandy, \Driver hamiltonians for constrained optimization in quantum annealing," Physical Review A, 2016.
[5] I. Hen and F. M. Spedalieri, \Quantum annealing for constrained optimization," Physical Review Applied, 2016.
[6] Y. Ruan, S. Marsh, X. Xue, X. Li, Z. Liu, and J. Wang, \Quantum approximate algorithm for np optimization problems with constraints," arXiv preprint arXiv:2002.00943, 2020. |