Related papers: Quantum Walks on Arbitrary Spatial Networks with R…
We propose an implementation scheme for the continuous-time quantum walk using a diatomic molecule and an optical frequency comb. We show an analogy between the quantum walk and the cascade rotational transitions induced by the optical…
Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc. Successful although these algorithms are,…
Recently, Rydberg atoms appeared as a viable alternative to the quantum gates built on atomic or molecular ions. The lifetimes of the circular Rydberg states can be in the millisecond range. That prevents inherent metastability of the…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
Quantum optics based on highly excited atoms, also known as Rydberg atoms, has cemented itself as a powerful platform for the manipulation of light at the few-photon level. The Rydberg blockade, resulting from the strong interaction between…
Individually trapped Rydberg atoms show significant promise as a platform for scalable quantum simulation and for development of programmable quantum computers. In particular, the Rydberg blockade effect can be used to facilitate both fast…
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with…
Rydberg atoms provide a powerful platform for exploring strongly interacting quantum systems, both in free space and in structured electromagnetic environments, with growing applications in quantum technology. Accurately modeling their…
Quantum walks are expected to serve important modelling and algorithmic applications in many areas of science and mathematics. Although quantum walks have been successfully implemented physically in recent times, no major efforts have been…
Assembled arrays of individual atoms with Rydberg-mediated interactions provide a powerful platform for the simulation of many-body spin Hamiltonians as well as the implementation of universal gate-based quantum information processing. We…
Photonics provide an efficient way to implement quantum walks, the quantum analogue of classical random walk that demonstrates rich physics with potential applications. However, most photonic quantum walks do not involve photon…
This dissertation presents 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…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
We propose hybrid digital-analog learning algorithms on Rydberg atom arrays, combining the potentially practical utility and near-term realizability of quantum learning with the rapidly scaling architectures of neutral atoms. Our…
We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk \'a la Szegedy (2004) that is defined in terms of the…
We lay the foundation for a quantum algorithmic framework to analyse fixed-structure chemical reaction networks (CRNs) using quantum random walks (QRWs) via electrical circuit theory. We model perturbations to CRNs, such as, species…
We develop an approach to realize a quantum switch for Rydberg excitation in atoms with $Y$-typed level configuration. We find that the steady population on two different Rydberg states can be reversibly exchanged in a controllable way by…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
In this letter we introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down- conversion, leading to fundamentally different…
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.