{"product_id":"quantum-computing-algorithms-and-computational-complexity-9783036577463","title":"Quantum Computing Algorithms and Computational Complexity","description":"\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\u003cbr\u003e\u003cbr\u003e\u003cb\u003eBinding Type:\u003c\/b\u003e Hardcover\u003cbr\u003e\u003cb\u003ePublisher:\u003c\/b\u003e Mdpi AG\u003cbr\u003e\u003cb\u003ePublished:\u003c\/b\u003e 10\/10\/2023\u003cbr\u003e\u003cb\u003eISBN:\u003c\/b\u003e 9783036577463\u003cbr\u003e\u003cb\u003ePages:\u003c\/b\u003e 124\u003cbr\u003e\u003cb\u003eWeight:\u003c\/b\u003e 1.04lbs\u003cbr\u003e\u003cb\u003eSize:\u003c\/b\u003e 9.61h x 6.69w x 0.50d","brand":"Fernando L. Pelayo","offers":[{"title":"Default Title","offer_id":51280747757749,"sku":"9783036577463","price":51.86,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0473\/0804\/6492\/files\/img_d421d846-72b3-4f29-810c-517a1e1b4019.jpg?v=1751468783","url":"https:\/\/pastforward.org\/products\/quantum-computing-algorithms-and-computational-complexity-9783036577463","provider":"Past Forward","version":"1.0","type":"link"}