Related papers: Quantum Walks-Based Adaptive Distribution Generati…
The two main approaches to quantum computing are gate-based computation and analog computation, which are polynomially equivalent in terms of complexity, and they are often seen as alternatives to each other. In this work, we present a…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
The quantum walks in the lattice spaces are represented as unitary evolutions. We find a generator for the evolution and apply it to further understand the walks. We first extend the discrete time quantum walks to continuous time walks.…
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…
A quantum computing algorithm for rhythm generation is presented, which aims to expand and explore quantum computing applications in the arts, particularly in music. The algorithm maps quantum random walk trajectories onto a rhythmspace --…
In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…
We investigate the evolution dynamics of inhomogeneous discrete-time one-dimensional quantum walks displaying long-range correlations in both space and time. The associated quantum coin operators are built to exhibit a random inhomogeneity…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum…
In this article we present an effective Hamiltonian approach for Discrete Time Quantum Random Walk. A form of the Hamiltonian for one dimensional quantum walk has been prescribed, utilizing the fact that Hamiltonians are the generators of…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
We discuss the use of high-order quantum accelerator modes to achieve an atom optical realization of a biased quantum random walk. We first discuss how one can create co-existent quantum accelerator modes, and hence how momentum transfer…
In this paper, we work on a quantum walk whose system is manipulated by a five-diagonal unitary matrix, and present long-time limit distributions. The quantum walk launches off a location and delocalizes in distribution as its system is…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…