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 9 of 9 for “"Grover Search"”.
-
Quantum computing, quantum games and geometric algebra.
Early researchers attempting to simulate complex quantum mechanical interactions on digital computers discovered that they very quickly consumed the computers’ available memory resources, because the state space of a quantum system typically grows exponentially with problem size. Consequently, …
-
Quantum Reinforcement Learning for Dynamic Spectrum Access in Cognitive Radio Networks
… review for the background of the carried out research work is illustrated. Review of research works on learning-based assignment techniques as well as quantum search techniques is provided. Modelling of three traditional dynamic channel assignment techniques is illustrated and the advantage …
-
Hamiltono ciklo ieškojimas kvantiniais skaičiavimais /
The Hamiltonian cycle search problem is one of the most well-known problems in graph theory, and is relevant in many areas such as computer graphics, network routing, and many others. The Hamiltonian cycle problem belongs to the class of NP-complete problems, so that in the general case the …
-
Quantum computation and a universal quantum computer.
… universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be used to implement the universal set of quantum gates and thereby serve as one possible building block for a universal quantum computer. We then address the core and primary focus …
-
Quantum tunneling, quantum computing, and high temperature superconductivity
… 66}, 042301 (2002)], for solving a generalized Grover search problem. Rigorous proofs are found for several conjectures made by Hu and explicit equations are obtained for finding the values of two phase parameters which make the algorithms sure success. Using self-consistent Hartree-Fock theory, …
-
Characterizing and Suppressing the Effects of Correlated Noise in Quantum Computing Systems
… Approximate Optimization Algorithm, applied to Grover search. Using perturbative filter function analysis, the susceptibilities to various error mechanisms are elucidated. This suite of techniques, tested on superconducting transmon qubits via cloud platforms like IBM, provides a comprehensive …
-
SYMMETRIC-KEY CRYPTOGRAPHY AND QUERY COMPLEXITY IN THE QUANTUM WORLD
… the primary quantum attack is key recovery via Grover search, which provides a quadratic speedup. One way to address this is to double the key length. However, recent results have shown that doubling the key length may not be sufficient in all cases. Therefore, it is crucial to understand the …
-
Finding Paths via Quantum Systems and Its Application for Quantum Algorithms
… quantum systems as a tool for path finding and search algorithms. First, we explore a specific problem of sequential measurements in Quantum Information Theory, namely quantum retrodiction. In experiments involving quantum systems with numerous intermediate interactions, often times the only …
-
Solving Chromatic Number with Quantum Search and Quantum Counting
… of 2nnO(1) [1]. This algorithm uses the Quantum Search algorithm (often called Grover's Algorithm), and the Quantum Counting algorithm. Chromatic Number is an example of an NP-Hard problem, which suggests that other NP-Hard problems can also benefit from a speed-up provided by quantum technology. …