The present work focuses on understanding entanglement in quantum walks. In particular, we analyse this property on a specific one-dimensional quantum walk model, the discrete-time quantum walk. For this, we address entanglement through a measure called quantum negativity. We highlight the relevance of entanglement and quantum walks in quantum information and computation, including a description of quantum information theory. Then, we show the results of an original simulation for negativity in quantum walks, and draw conclusions regarding the behaviour of negativity under a quantum walk evolution for several configurations. Lastly, we address mathematical aspects of these observations and provide formal proofs for some of the numerical re- sults. Due to the interdisciplinary nature of this work, we aim to provide an insight of the behaviour of entanglement in quantum walks and the relevance of this property from a quantum information perspective, as well as shedding a light on the utility of the model and the flexible formalism it provides for testing this property and others.
The present work focuses on understanding entanglement in quantum walks. In particular, we analyse this property on a specific one-dimensional quantum walk model, the discrete-time quantum walk. For this, we address entanglement through a measure called quantum negativity. We highlight the relevance of entanglement and quantum walks in quantum information and computation, including a description of quantum information theory. Then, we show the results of an original simulation for negativity in quantum walks, and draw conclusions regarding the behaviour of negativity under a quantum walk evolution for several configurations. Lastly, we address mathematical aspects of these observations and provide formal proofs for some of the numerical re- sults. Due to the interdisciplinary nature of this work, we aim to provide an insight of the behaviour of entanglement in quantum walks and the relevance of this property from a quantum information perspective, as well as shedding a light on the utility of the model and the flexible formalism it provides for testing this property and others.
The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann entropy to measure the entanglement between the coin and the particle's position of the quantum walks. Also we deal with the Shannon entropy which is an important quantity in the information theory. In this paper, we show limits of the von Neumann entropy and the Shannon entropy of the quantum walks on the one dimensional lattice starting from the origin defined by arbitrary coin and initial state. In order to derive these limits, we use the path counting method which is a combinatorial method for computing probability amplitude.
Discrete-time quantum walks are among the branches of quantum information and computation. They are platforms for developing quantum algorithms for quantum computers. In addition, due to their universal primitive nature, discrete-time quantum walks have been used to simulate other quantum systems and phenomena that are observed in physics and chemistry. To fully utilize the potentials that the discrete-time quantum walks hold in their applications, control over the discrete-time quantum walks and their properties becomes essential. In this dissertation, we propose two models for attaining a high level of control over the discrete-time quantum walks. In the first one, we incorporate a dynamical nature for the unitary operator performing the quantum walks. This enables us to readily control the properties of the walker and produce diverse behaviors for it. We show that with our proposal, the important properties of the discrete-time quantum walks such as variance would indeed improve. To explore the potential of this proposal, we apply it in the simulations of topological phases in condensed matter physics. With our proposal, we can control the simulations and determine the type of topological phenomena that should be simulated. In addition, we confirm simulations of topological phases and boundary states that can be observed in one-, two- and three-dimensional systems. Finally, we report the emergence of exotic phase structures in form of cell-like structures that contain all types of topological phases and boundary states of certain classes. In our second proposal, we take advantage of resources available in quantum mechanics, namely quantum entanglement and entangled qubits. In this proposal, we use entangled qubits in the structure of a quantum walk and show that by tuning the initial entanglement between these qubits and how these qubits are modified through the walk, one is able to produce diverse behaviors for the quantum walk and control its behavior.
The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann entropy to measure the entanglement between the coin and the particle's position of the quantum walks. Also we deal with the Shannon entropy which is an important quantity in the information theory. In this paper, we show limits of the von Neumann entropy and the Shannon entropy of the quantum walks on the one dimensional lattice starting from the origin defined by arbitrary coin and initial state. In order to derive these limits, we use the path counting method which is a combinatorial method for computing probability amplitude.
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist.
With the purpose of finding new techniques to develop quantum algorithms, there has been
an increasing interest in studying Quantum Walks, the quantum counterparts of classical random walks. Our work in quantum walks begins with a critical and comprehensive assessment of those elements of classical random walks and discrete quantum walks on undirected graphs relevant to algorithm development.
We propose a model of discrete quantum walks on an infinite line using pairs of quantum coins under different degrees of entanglement, as well as quantum walkers in different initial state configurations, including superpositions of corresponding basis states. We have found that the probability distributions of such quantum walks have particular forms which are different from the probability distributions of classical random walks. Also, our numerical results show that the symmetry properties of quantum walks with entangled coins have a non-trivial relationship with corresponding initial states and evolution operators.
In addition, we have studied the properties of the entanglement generated between walkers, in a family of discrete Hadamard quantum walks on an infinite line with one coin and two walkers. We have found that there is indeed a relation between the amount of entanglement available in each step of the quantum walk and the symmetry of the initial coin state. However, as we show with our numerical simulations, such a relation is not straightforward and, in fact, it can be counterintuitive.
Quantum Image Processing is a blend of two fields: quantum computation and image processing. Our aim has been to promote cross-fertilisation and to explore how ideas from quantum computation could be used to develop image processing algorithms. Firstly, we propose methods for storing and retrieving images using non-entangled and entangled qubits. Secondly, we study a case in which 4 different values are randomly stored in a single qubit, and show that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Finally, we briefly note that entanglement may be used as a computational resource to perform hardware-based pattern recognition of geometrical shapes that would otherwise require
classical hardware and software.
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist. With the purpose of finding new techniques to develop quantum algorithms, there has been an increasing interest in studying Quantum Walks, the quantum counterparts of classical random walks. Our work in quantum walks begins with a critical and comprehensive assessment of those elements of classical random walks and discrete quantum walks on undirected graphs relevant to algorithm development. We propose a model of discrete quantum walks on an infinite line using pairs of quantum coins under different degrees of entanglement, as well as quantum walkers in different initial state configurations, including superpositions of corresponding basis states. We have found that the probability distributions of such quantum walks have particular forms which are different from the probability distributions of classical random walks. Also, our numerical results show that the symmetry properties of quantum walks with entangled coins have a non-trivial relationship with corresponding initial states and evolution operators. In addition, we have studied the properties of the entanglement generated between walkers, in a family of discrete Hadamard quantum walks on an infinite line with one coin and two walkers. We have found that there is indeed a relation between the amount of entanglement available in each step of the quantum walk and the symmetry of the initial coin state. However, as we show with our numerical simulations, such a relation is not straightforward and, in fact, it can be counterintuitive. Quantum Image Processing is a blend of two fields: quantum computation and image processing. Our aim has been to promote cross-fertilisation and to explore how ideas from quantum computation could be used to develop image processing algorithms. Firstly, we propose methods for storing and retrieving images using non-entangled and entangled qubits. Secondly, we study a case in which 4 different values are randomly stored in a single qubit, and show that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Finally, we briefly note that entanglement may be used as a computational resource to perform hardware-based pattern recognition of geometrical shapes that would otherwise require classical hardware and software.
The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. \nIn this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discrete time walk is particularly amenable to investigation using numerical methods, from which most of the results in this thesis are derived, and is the main focus of the work presented. Two aspects of the discrete time walk are investigated: their transport properties \nand their interpretation as quantum computers. I investigated the transport properties in two ways, by looking for a particular type of transport known as perfect \nstate transfer, and examining the transport properties of a new type of coin operator. \nThe search for perfect state transfer concentrated on modifications of small cycles. I found that perfect state transfer is rare for the choices of coin operators \ntested. The structures tested for perfect state transfer were based on cycles, and it appears that the type of modification has more of an effect than the size of the \ncycle. This makes intuitive sense, as the modifications found to lead to walks exhibiting perfect state transfer affected only the initial and target node of the cycle. \nI then investigated a new type of coin operator which does not allow amplitude to return to the node it has come from. This effectively simulates a dimer. Using the general form of this type of operator and random variables for each parameter, I found that the expected distance of the walker from the origin, and standard deviation, were independent of the initial condition. The second half of the thesis concentrates on computational applications of quantum \nwalks using the language acceptance model. I first note their equivalence to a type of quantum automaton known as the QFA-WOM, and this provides an intuitive understanding of the role of the WOM. I then use a more direct construction to show that they can accept a range of formal languages. Using this construction allows us to use superpositions of words as inputs, and the insights provided by investigating these suggest a new way of approaching the problem of quantum state discrimination.