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 20 of 34 for “"Quantum Search"”.
-
QUANTUM SEARCH ON RANDOM GRAPHS
… random graph contain about the performance of a quantum search acting on it? To investigate this problem, we define a notion of search time to quantify the behavior of a quantum search, and find strong evidence of a relation between its distribution and the model of random graph on which the …
-
Solving Chromatic Number with Quantum Search and Quantum Counting
This thesis presents a novel quantum algorithm that solves the Chromatic Number problem. Complexity analysis of this algorithm revealed a run time of O(2n/2n2(log2n)2). This is an improvement over the best known algorithm, with a run time of 2nnO(1) [1]. This algorithm uses the Quantum Search …
-
Albebraic, geometric and complexity aspects of quantum search algorithms
Quantum search algorithm determines k marked items in an otherwise unstructured set (database), of size N by performing Order(SQRT(N/k)) trials. Hence a quadratic reduction of search complexity is achieved compared to Order(N/k) trials required by any classical algorithm. The quantum algorithm …
-
Classical Search and Quantum Search Algorithms for Synthesis of Quantum Circuits and Optimization of Quantum Oracles
… electric circuits encountered the barrier of quantum mechanics and its effects. However, the laws of quantum mechanics can be also used to produce computational devices that lead to extraordinary speed increases over classical computers. Thus quantum computing becomes a very promising and …
-
Quantum Search With Interacting Bosons on a Lattice: Mean-Field Theory and Many-Body Simulations of Quantum Walk Algorithms
Using a classical computer to search a database takes an amount of time that grows linearly with the number of items one wishes to search through. Quantum algorithms for the same task can provide up to a quadratic speedup, lessening the number of queries needed for a successful search. Previous …
-
Quantum Search Algorithms for Constraint Satisfaction and Optimization Problems Using Grover's Search and Quantum Walk Algorithms with Advanced Oracle Design
The field of quantum computing has emerged as a powerful tool for solving and optimizing combinatorial optimization problems. To solve many real-world problems with many variables and possible solutions for constraint satisfaction and optimization problems, the required number of qubits of scalable …
-
Spatial search via non-linear quantum walk
One approach to the development of quantum search algorithms is the quantum walk. A spatial search can be effected by the continuous-time evolution of a single quantum particle on a lattice or graph containing a marked site. In most conceivable physical applications, however, one would rather …
-
Quantum Reinforcement Learning for Dynamic Spectrum Access in Cognitive Radio Networks
Abstract This thesis proposes Quantum Reinforcement Learning (QRL) as an improvement to conventional reinforcement learning-based dynamic spectrum access used within cognitive radio networks. The aim is to overcome the slow convergence problem associated with exploration within reinforcement …
-
Quantum Enhancements for Direct Search Methods
This dissertation explores the use of quantum search algorithms to im- prove direct search methods for single and multiobjective optimization. Quantum search algorithms are known to reduce the expected number of oracle calls needed to find the solution of an unstructured search problem from O(N ) …
-
Quantum Walks and Structured Searches on Free Groups and Networks
Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of spatial search algorithms, have been studied on a wide variety of structures. We study quantum walks and searches on …
-
CHARACTERIZATION AND ENGINEERING OF QUANTUM SYSTEMS
… the exceptional results and developments that quantum mechanics, in combination with information theory, has developed in recent decades. This thesis is part of this line of research, with the scope of providing new results regarding quantum sensing and quantum control. Firstly, the need for …
-
Kvantinių skaičiavimų taikymas spindulių sekimo technologijai /
This bachelor thesis explores the potential of quantum computing in ray tracing technology. The thesis analyses how Grover’s quantum search algorithm could improve beamobject intersec tion search tasks compared to traditional methods. A hybrid quantumclassical prototype of the ray tracing …
-
Critical challenges in donor based quantum computation
Building a scalable quantum computer is one of the most interesting and difficult problems facing the world of physics today. The requirements for building such a machine are stringent and a number of critical challenges must be overcome before it is achieved. This thesis represents an effort to …
-
Time-Inhomogeneous Quantum Markov Chains
In quantum computation theory, quantum Markov chains and quantum walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. More recently, due to the importance of the quantum decoherence phenomenon, decoherent quantum walks and …
-
Hybrid Quantum Computation
… is a study of two main projects. (1) The hybrid quantum computation model that combines the advantages of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and …
-
Quantum computation and a universal quantum computer.
This thesis covers two main topics in quantum computing: 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 …
-
Design and fabrication of a hi-fidelity free space optical Grover multiport for sensing applications
… Coin" due to its application in the Grover Quantum Search Algorithm, has been particularly interesting because of its even symmetry across all four ports including back reflections. Previous fabrication attempts of the Grover coin using bulk optical components have already been …
-
Quantum inspired algorithms for learning and control of stochastic systems
… control techniques, this dissertation proposes quantum theory inspired algorithms for learning and control of both single-agent and multi-agent stochastic systems.A common problem encountered in traditional reinforcement learning techniques is the exploration-exploitation trade-off. To address …
-
Continuous-time Quantum Algorithms: Searching and Adiabatic Computation
One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum algorithms for 3SAT are considered inefficient. Soon after Grover's discovery, …
-
Architectural Design and Optimization of Quantum-Resistant Cryptographic Processors
The rapidly growing field of quantum computing offers a wide range of improvements over classical computers across various domains. These advantages stem from various properties of Quantum Computers, such as superposition, entanglement, and interference, which enable an exponential speed-up for …
Page 1 of 2