Quantum Computing Algorithms and Computational Complexity
This reprint 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 Quant...
Sparad:
| Materialtyp: | Online |
|---|---|
| Språk: | engelska |
| Utgiven: |
MDPI - Multidisciplinary Digital Publishing Institute
2023
|
| Ämnen: | |
| Länkar: | ONIX_20231130_9783036577463_28 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|
| _version_ | 1869529529066717184 |
|---|---|
| collection | Directory of Open Access Books |
| description | This reprint 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, we would like to thank the authors and reviewers who made this possible by promoting, spreading research on and supporting quantum computing. |
| format | Online |
| id | doab-20.500.12854ir-128576 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2023 |
| publishDateRange | 2023 |
| publishDateSort | 2023 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-1285762024-03-28T03:32:29Z Quantum Computing Algorithms and Computational Complexity Pelayo, Fernando L. Mezzini, Mauro quantum Markov chains maximum von Neumann entropy QSZK-completeness amplitude amplification subset sum problem quantum algorithms computational efficiency quantum computation string processing sorting quantum computing quantum annealing combinatorial optimization QUBO TSP VRP quantum weighted fractional Fourier transform quantum Fourier transform quantum algorithm variatonal algorithms QAOA quantum circuit optimization quantum image processing image component labeling local operator Levialdi shrinking operator n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science This reprint 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, we would like to thank the authors and reviewers who made this possible by promoting, spreading research on and supporting quantum computing. 2023-11-30T20:33:01Z 2023-11-30T20:33:01Z 2023 book ONIX_20231130_9783036577463_28 9783036577463 9783036577470 https://directory.doabooks.org/handle/20.500.12854/128576 eng application/octet-stream Attribution 4.0 International https://mdpi.com/books/pdfview/book/8028 https://mdpi.com/books/pdfview/book/8028 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-0365-7747-0 10.3390/books978-3-0365-7747-0 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783036577463 9783036577470 124 Basel open access |
| spellingShingle | quantum Markov chains maximum von Neumann entropy QSZK-completeness amplitude amplification subset sum problem quantum algorithms computational efficiency quantum computation string processing sorting quantum computing quantum annealing combinatorial optimization QUBO TSP VRP quantum weighted fractional Fourier transform quantum Fourier transform quantum algorithm variatonal algorithms QAOA quantum circuit optimization quantum image processing image component labeling local operator Levialdi shrinking operator n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science Quantum Computing Algorithms and Computational Complexity |
| title | Quantum Computing Algorithms and Computational Complexity |
| title_full | Quantum Computing Algorithms and Computational Complexity |
| title_fullStr | Quantum Computing Algorithms and Computational Complexity |
| title_full_unstemmed | Quantum Computing Algorithms and Computational Complexity |
| title_short | Quantum Computing Algorithms and Computational Complexity |
| title_sort | quantum computing algorithms and computational complexity |
| topic | quantum Markov chains maximum von Neumann entropy QSZK-completeness amplitude amplification subset sum problem quantum algorithms computational efficiency quantum computation string processing sorting quantum computing quantum annealing combinatorial optimization QUBO TSP VRP quantum weighted fractional Fourier transform quantum Fourier transform quantum algorithm variatonal algorithms QAOA quantum circuit optimization quantum image processing image component labeling local operator Levialdi shrinking operator n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| topic_facet | quantum Markov chains maximum von Neumann entropy QSZK-completeness amplitude amplification subset sum problem quantum algorithms computational efficiency quantum computation string processing sorting quantum computing quantum annealing combinatorial optimization QUBO TSP VRP quantum weighted fractional Fourier transform quantum Fourier transform quantum algorithm variatonal algorithms QAOA quantum circuit optimization quantum image processing image component labeling local operator Levialdi shrinking operator n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| url | ONIX_20231130_9783036577463_28 |