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 14 of 14 for “"Quantum Walks"”.
-
Sampling Using Controlled Quantum Walks
We give a new quantum algorithm to sample from probability distributions over graph vertices quadratically faster than the optimal classical algorithm, which uses random walks with stopping rules. Efficient sampling is an important computational task used in simulations based on stochastic …
-
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 …
-
Simple Stationary Steps in Quantum Walks
… of type An−1 is given as a sum over a set of quantum walks in the quantum Bruhat graph, QBG(An−1). We establish bounds on the number of quantum steps and simple stationary steps in these quantum walks. By a result of Kato, we map this formula to the equivariant quantum K-theory of partial flag …
-
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 …
-
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 …
-
Topics in quantum information theory and quantum many-body physics
… two results relating to the intersection between quantum information theory and quantum many-body physics. The first pertains to quantum algorithms, where few computational problems are believed to exhibit exponential separation between quantum and classical performance. For those that are, …
-
Evaluation of boolean formulas with restricted inputs
… thesis, I will investigate the running time of quantum algorithms for evaluating boolean functions when the input is promised to satisfy certain conditions. The two quantum algorithms considered in this paper are the quantum walk algorithm for NAND trees given by Farhi and Gutmann [2], and an …
-
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 Aspects of Fluctuation Driven Phenomena
… such as thermal noise, stochasticity, or even quantum fluctuations. The importance of understanding these phenomena lies in their ubiquity in natural systems, from the formation of patterns in biological systems, to the behavior of phase transitions and universality classes, to quantum …
-
Tesselações em grafos e suas aplicações em computação quântica
The usage of random walks in classical computing has resulted in good solutions to problems in many areas. Its quantum counterpart has been an efficient tool in the development of quantum algorithms. An example of great theoretical importance using this approach is Ambainis’ algorithm for the …
-
Machine-learning-assisted state and gate engineering for quantum technologies
… we discuss applications of machine learning to quantum information science. The interface between these two fields has been the subject of much research, recently, driven by the many successes of machine learning for diverse pattern recognition tasks. The work reported in this Thesis addresses …
-
Algorithmic Quantum-State Generation for Simulating Quantum Field Theories on a Quantum Computer
Simulating a quantum field theory (QFT) on a quantum computer comprises three steps: generating an initial state, simulating time evolution and measuring observables, with the initial-state generation being the most expensive step for the entire simulation. In this thesis, we introduce a general …
-
Observing the 2D Bose glass in an optical quasicrystal
… and demonstrate the capability to simulate quantum walks on four-dimensional tight-binding lattices using the diffraction dynamics of 2D quasicrystalline lattices on short timescales. The second (Chapter 6) and the third (Chapter 7) experiments concentrate on studying the disorder nature of …