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 68 for “"Quantum walk"”.
-
Discrete-Time Quantum Walk - Dynamics and Applications
… investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various …
-
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 Walk Schemes for Universal Quantum Computation
Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to …
-
Verschränkungsstrukturen in multidimensionalen diskreten Quantum Walk Modellen
… Startzustände auf multidimensionale diskrete Quantum Walk Modelle untersucht. Durch die sich ergebenden Ortskorrelationen, ist es möglich die Struktur der Verschränkung zu analysieren und die Verschräankung selbst zu messen. Dazu werden für eindimensionale Multicoin Modelle und für …
-
Step-by-Step: Quantum Walk Implementations and Visualizations
Quantum walks (QWs) are the quantum analogue to classical random walks. I provide background and motivation for quantum walk algorithms and their applications. I present new visualizations for one-, two-, and three-dimensional quantum walks and explain how the visualizations can help teach quantum …
-
Quantum walk on two-dimensional torus and grid
… a marked vertex, such that χ(m) = 1. Random walk is an algorithm for finding such a vertex. The measure of complexity for random walk is hitting time. There is a quantum algorithm that finds a marked vertex, and runs in the square root of the extended hitting time. For some configurations of …
-
The Power Of Quantum Walk Insights, Implementation, And Applications
In this thesis, I investigate quantum walks in quantum computing from three aspects: the insights, the implementation, and the applications. Quantum walks are the quantum analogue of classical random walks. For the insights of quantum walks, I list and explain the required components for quantizing …
-
Quantum Walk Combs:: Active Mode-Locking in Fast-Gain Ring Lasers
… of fast-gain semiconductor devices—most notably Quantum Cascade Lasers—has enabled a novel regime of self-starting, continuous-wave, frequency‑modulated comb generation. However, despite the thorough exploration of passive and active mode-locking in slow-gain media, and passive mode-locking in …
-
Quantum Search With Interacting Bosons on a Lattice: Mean-Field Theory and Many-Body Simulations of Quantum Walk Algorithms
… 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 work shows that nonlinear quantum walks, inspired by mean-field theories of the Bose-Hubbard model, …
-
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 …
-
Quantum Walks: Theory, Application, And Implementation
The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part …
-
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 …
-
Frameworks for Quantum Algorithms
Due to the difficulty of constructing new quantum algorithms, frameworks that facilitate this construction are of great importance in quantum computing. These frameworks reduce the problem of coming up with a quantum algorithm to that of constructing some combinatorial object that is often much …
-
Quantum Walks on Strongly Regular Graphs
This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We begin by finding the …
-
Quantum Walks on Arc-Transitive Graphs with Self-Loops
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. The lackadaisical quantum walk has been studied on cycles, n-dimensional tori, hypercubes, Johnson graphs, and other classes of vertex-transitive graphs. The …
-
Efficient Composition of Discrete Time Quantum Walks
… search problems are efficiently solved by quantum walk algorithms. Of particular interest are those problems whose efficient solutions involve nesting of search algorithms. The nesting of search algorithms generally incurs an extra logarithmic factor in query and time complexity, due to the …
-
Implementing Quantum Gates With Length-3 Dynamic Graphs
The continuous-time quantum walk is a quantum version of a random walk that evolves by Schrodinger's equation. With the Hamiltonian equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the …
-
Some Upper and Lower Bounds regarding Query Complexity
… It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical computation in solving some problems. Kempe showed that a discrete time quantum walk on hypercube hits the antipodal point with exponentially fewer queries than a simple random walk …
-
Absorption phenomena in quantum walks
The quantum walk is a unitary analogue to the discrete random walk, and its properties have been increasingly studied since the turn of the millennium. In comparison with the classical random walk, the quantum walk exhibits linear spreading and initial condition dependent asymmetries. As noted …
-
Tessellations on graphs: theory, algorithms, and complexity
Due to recent technological advances, quantum computing has gained notoriety. In this paradigm, the concept of quantum walk is fundamental for the development of algorithms for quantum computers. Among the existing quantum walk models, the staggered model, proposed by Portugal et al. stands out, …
Page 1 of 4