{"product_id":"quantum-computing-algorithms-and-computational-complexity-hardcover-1","title":"Quantum Computing Algorithms and Computational Complexity - Hardcover","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eFernando L. Pelayo\u003c\/b\u003e (Guest Editor), \u003cb\u003eMauro Mezzini\u003c\/b\u003e (Guest Editor)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis Special Issue is mainly concerned with quantum algorithms, their mathematics from behind and the complexity issues arising from them. It comprises seven papers: Two of them are focused on improving the performance by means of quantum algorithms over the best instances of classical ones: \"A Fast Quantum Image Component Labeling Algorithm\" [1] by Yan Li, Dapeng Hao, Yang Xu and Kinkeung Lai. \"Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator\" [2] by Kamil Khadiev, Artem Ilikaev and Jevgenijs Vihrovs. Another four papers deal with enhanced quantum algorithms: \"Progress towards Analytically Optimal Angles in Quantum Approximate Optimisation\" [3] by Daniil Rabinovich, Richik Sengupta, Ernesto Campos, Vishwanathan Akshay and Jacob Biamonte. \"Quantum Weighted Fractional Fourier Transform\" [4] by Tieyu Zhao, Tianyu Yang and Yingying Chi. \"On the Amplitude Amplification of Quantum States Corresponding to the Solutions of the Partition Problem\" [5] by Mauro Mezzini, Jose J. Paulet, Fernando Cuartero, Hernan I. Cruz and Fernando L. Pelayo. \"On the Complexity of Finding the Maximum Entropy Compatible Quantum State\" [6] by Serena Di Giorgio and Paulo Mateus. Last, but not least, one paper researched a classical operational research problem by means of quantum annealing: \"GPS: A New TSP Formulation for Its Generalizations Type QUBO\" [7] by Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje and Parfait Atchade-Adelomou. As Guest Editors of this Special Issue, we would like to thank the authors and reviewers who made this possible by promoting, spreading research on and supporting quantum computing.\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 124\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.5 x 9.61 x 6.69 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e October 10, 2023\u003c\/div\u003e\n            ","brand":"BooksCloud","offers":[{"title":"Default Title","offer_id":47213894074617,"sku":"9783036577463","price":70.29,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0789\/2782\/3097\/files\/0mAqj_5qhH9783036577463_0bcaf9a1-9bd9-4fdc-9a1c-0a7e830c8642.webp?v=1768109494","url":"https:\/\/bookscloud.io\/products\/quantum-computing-algorithms-and-computational-complexity-hardcover-1","provider":"BooksCloud Book Dropshipping","version":"1.0","type":"link"}