Solving MaxCut with quantum imaginary time evolution
-
Published:2023-07-12
Issue:7
Volume:22
Page:
-
ISSN:1573-1332
-
Container-title:Quantum Information Processing
-
language:en
-
Short-container-title:Quantum Inf Process
Author:
Alam Rizwanul, Siopsis GeorgeORCID, Herrman Rebekah, Ostrowski James, Lotshaw Phillip C., Humble Travis S.
Funder
Defense Sciences Office, DARPA U.S. Air Force Army Research Office Division of Graduate Education Office of Multidisciplinary Activities
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference49 articles.
1. Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., Biswas, R., Boixo, S., Brandao, F.G.S.L., Buell, D.A., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505–510 (2019) 2. Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., Hu, P., Yang, X.-Y., Zhang, W.-J., Li, H., Li, Y., Jiang, X., Gan, L., Yang, G., You, L., Wang, Z., Li, L., Liu, N.-L., Lu, C.-Y., Pan, J.-W.: Quantum computational advantage using photons. Science 370, 6523 (2020) 3. Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optim. Methods Softw. 17(6), 1033–1058 (2002) 4. Schröder, H., May, A.E., Vrt’o, I., Sýkora, O.: Approximation algorithms for the vertex bipartization problem. In: Plášil, F., Jeffery, K.G. (eds.) SOFSEM’97: Theory and Practice of Informatics, pp. 547–554 (1997). Springer, Berlin 5. Kahruman, S., Kolotoglu, E., Butenko, S., Hicks, I.: On greedy construction heuristics for the max-cut problem. Int. J. Comput. Sci. Eng. 1, 04 (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|