Quantum Computing Algorithms and Computational Complexity

• Muut tekijät: Pelayo, Fernando L. (Toimittaja), Mezzini, Mauro (Toimittaja)
• Aineistotyyppi: Elektroninen Kirjan osa
• Kieli: englanti
• Julkaistu: Basel MDPI - Multidisciplinary Digital Publishing Institute 2023
• Aiheet: Research & information: general; Mathematics & science; 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
• Linkit: DOAB: download the publication; DOAB: description of the publication

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