Libros importados hasta 50% OFF + Envío Gratis a todo USA   Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Quantum Computing Algorithms and Computational Complexity (in English)
Type
Physical Book
Publisher
Language
Inglés
Pages
124
Format
Hardcover
Dimensions
24.4 x 17.0 x 1.3 cm
Weight
0.47 kg.
ISBN13
9783036577463

Quantum Computing Algorithms and Computational Complexity (in English)

Pelayo, Fernando L. ; Mezzini, Mauro (Author) · Mdpi AG · Hardcover

Quantum Computing Algorithms and Computational Complexity (in English) - Pelayo, Fernando L. ; Mezzini, Mauro

Physical Book

$ 48.81

$ 61.01

You save: $ 12.20

20% discount
  • Condition: New
It will be shipped from our warehouse between Thursday, July 11 and Friday, July 12.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Quantum Computing Algorithms and Computational Complexity (in English)"

This 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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews