Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Quantum speed-up"”.
-
Quantum Algorithms For String Problems
We design near-optimal quantum query algorithms for two important text processing problems: Longest Common Substring and Lexicographically Minimal String Rotation. Specifically, we show that: - Longest Common Substring can be solved by a quantum algorithm in Õ(n²⸍³) time, improving upon the …
-
Application of quantum walks on graph structures to quantum computing
Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms for problems of practical interest. One of the most successful tools in developing new quantum algorithms is …
-
Adiabatic processes, noise, and stochastic algorithms for quantum computing and quantum simulation
… provide promising platforms for realising quantum computation and quantum simulation. This, in turn, opens new possibilities for developing useful quantum algorithms and explaining complex many-body physics. The advantages of quantum computation have been demonstrated in a small range of …
-
Pricing options on quantum computers: state of the art and outlook
… pricing financial derivative contracts and how quantum computers can be used to accelerate the computing process currently performed on classical computers. More precisely, I provide concrete explanations on how previously suggested circuits work and I give examples of implementations of these …