Related papers: Two-level Quantum Walkers on Directed Graphs II: A…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
We have proposed a scheme of multi-qubit \textit{quantum random access memory} (qRAM) based on the impedance matched photon echo quantum memory incorporated together with the control three-level atom in two coupled QED cavities. A set of…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…
We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete…
In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum…
Random-access quantum memories may offer computational advantages for quantum computers and networks. In this paper, we advance arrays of solid-state quantum memories towards their usage as random-access quantum memory. We perform quantum…
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph.…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
Quantum walk has been successfully used to search for targets on graphs with vertices identified as the elements of a database. This spacial search on a two-dimensional periodic grid takes $\mathcal{O}\left(\sqrt{N\log N}\right)$ oracle…
We observe how an active (i.e., requring $2^n$ parallel control operations) QRAM-like effect $$\sum_{y=0}^{N-1} |y\rangle\langle y| \otimes U^y_{\text{result},\text{memory}_y}$$ can be realized, as a quantum circuit of depth $O(n+\sqrt m)$…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…
Routing classical and quantum information is a fundamental task for quantum information technologies and processes. Here, we consider information encoded in the position of a quantum walker on a graph, and design an optimal structure to…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…